Peer-to-Peer Packet Scheduling Algorithm

A method of prioritizing pull requests for media packets from a plurality of serving peer nodes to a client node in a peer-to-peer network, the method comprising:

• comparing a buffer map of the client node with a buffer map of each of the plurality of serving peer nodes;
• determining a serving peer node of the plurality of peer nodes that comprises media packets having a maximum sequence number among the buffer maps of the plurality of serving peer nodes;
• randomly selecting packets absent from the client node and adding a corresponding pull request to a front of a pull request queue of the client node;
• scanning the buffer maps of the remaining plurality of serving peer nodes for remaining packets absent from the client node;
• and
• pushing a pull request for the remaining packets absent from the client node to the back of the request queue of the client node.

A method of assigning packet requests for media packets from a client node to a plurality of serving peer nodes in a peer-to-peer network, the method comprising:

• initializing a pull budget for each serving peer node of the plurality of serving peer nodes;
• determining a number of absent packets of the client note that each serving peer node comprises to define a resource ratio for each serving peer node;
• determining a swap path from a serving peer node of the plurality of serving peer nodes having a current requested packet to a differing serving peer node of the plurality of serving peer nodes having a maximal value of resource ratio;
• and
• assigning a pull request to a serving peer node of the plurality of serving peer nodes who has a swap path to a differing serving peer node of the plurality of serving peer nodes having a maximal value of resource ratio.