QUEUE-BASED ADAPTIVE CHUNK SCHEDULING FOR PEER-TO PEER LIVE STREAMING

• US 20100138511A1
• Filed: 06/28/2007
• Published: 06/03/2010
• Est. Priority Date: 06/28/2007
• Status: Abandoned Application

• Current Assignee: Magnolia Licensing LLC (IP Edge LLC)
• Original Assignee: Magnolia Licensing LLC (IP Edge LLC)
• Inventors: Liu, Yong, Liang, Chao, Guo, Yang
• Application Number:
  US12/452,033
• Publication Number:
  US 20100138511A1
• Time in Patent Office: Days
• US Class Current: 709/207
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 47/6215 Individual queue per QOS, rate or priority
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/108 characterised by resources being split in blocks or fragments
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests

Abstract

A method and apparatus are described for scheduling content delivery in a peer-to-peer network, including receiving a message from a peer, classifying the received message, storing the classified message in one of a plurality of queues based on the classification, generating responses to messages based on a priority of the queue in which the classified message is stored and transmitting content to all peers in the peer-to-peer network. Also described are a method and apparatus for scheduling content delivery in a peer-to-peer network, including receiving one of a message and content from one of a content source server and a peer, classifying the received message, storing the classified message in one of a plurality of queues based on the classification, storing the received content, generating responses to messages based on a priority of the queue in which the classified message is stored and transmitting content to all other peers in the peer-to-peer network.

Claims

1. A method for scheduling content delivery in a peer-to-peer network, said method comprising:

receiving a message from a peer;

classifying said received message;

storing said classified message in one of a plurality of queues based on said classification;

generating responses to messages based on a priority of said queue in which said classified message is stored; and

transmitting content to all peers in said peer-to-peer network.

2. The method according to claim 1, wherein there are at least three queues.

3. The method according to claim 2, wherein said queues includes a first queue, a second queue and a third queue.

4. The method according to claim 3, wherein messages in said first queue include requests to join said peer-to-peer network and said first queue is a highest priority queue.

5. The method according to claim 4, wherein a response to said request to join said peer-to-peer network includes transmitting to said joining peer a peer list and contact information for peers already in said peer-to-peer network.

6. The method according to claim 3, wherein messages in said second queue include requests for additional content and further wherein responses to said requests for additional content include transmitting said requested additional content.

7. The method according to claim 3, wherein messages in said third queue includes requests to recover missing content and further wherein responses to said requests to recover missing content include transmitting said requested missing content.

8. The method according to claim 3, wherein a priority of said second queue and a priority of said third queue are based on design requirements.

9. An apparatus for scheduling content delivery in a peer-to-peer network, comprising:

means for receiving a message from a peer;

means for classifying said received message;

means for storing said classified message in one of a plurality of queues based on said classification;

means for generating responses to messages based on a priority of said queue in which said classified message is stored; and

means for transmitting content to all peers in said peer-to-peer network.

10. The apparatus according to claim 9, wherein there are at least three queues.

11. The apparatus according to claim 10, wherein said queues includes a first queue, a second queue and a third queue.

12. The apparatus according to claim 11, wherein messages in said first queue include requests to join said peer-to-peer network and said first queue is a highest priority queue.

13. The apparatus according to claim 12, wherein a response to said request to join said peer-to-peer network includes means for transmitting to said joining peer a peer list and contact information for peers already in said peer-to-peer network.

14. The apparatus according to claim 11, wherein messages in said second queue include requests for additional content and further wherein responses to said requests for additional content include means for transmitting said requested additional content.

15. The apparatus according to claim 11, wherein messages in said third queue includes requests to recover missing content and further wherein responses to said requests to recover missing content include means for transmitting said requested missing content.

16. The apparatus according to claim 11, wherein a priority of said second queue and a priority of said third queue are based on design requirements.

17. A method for scheduling content delivery in a peer-to-peer network, said method comprising:

receiving one of a message and content from one of a content source server and a peer;

classifying said received message;

storing said classified message in one of a plurality of queues based on said classification;

storing said received content;

generating responses to messages based on a priority of said queue in which said classified message is stored; and

transmitting content to all other peers in said peer-to-peer network.

18. The method according to claim 17, wherein there are at least three queues.

19. The method according to claim 18, wherein said queues includes a first queue and a second queue.

20. The method according to claim 19, wherein messages in said first queue include a peer list and contact information for peers already in said peer-to-peer network and said first queue is a highest priority queue.

21. The method according to claim 20, wherein a response to said peer list and said contact information includes establishing connections with peers already in said peer-to-peer network.

22. The method according to claim 19, wherein messages in said second queue includes requests to recover missing content and said second queue is a lower priority queue than said first queue and further wherein responses to said requests to recover missing content include transmitting said requested missing content.

23. The method according to claim 19, further comprising storing content to be forwarded to other peers in said peer-to-peer network in a third queue, wherein said third queue has a lowest priority.

24. The method according to claim 17, further comprising:

determining an average queue size;

determining is said average queue size is one of less than and equal to a threshold; and

generating and transmitting a signal message to a content source server, if said average queue size is one of less than and equal to said threshold, wherein said signal message indicates that additional content is needed.

25. The method according to claim 17, further comprising rendering said stored content.

26. An apparatus for scheduling content delivery in a peer-to-peer network, comprising:

means for receiving one of a message and content from one of a content source server and a peer;

means for classifying said received message;

means for storing said classified message in one of a plurality of queues based on said classification;

means for storing said received content;

means for generating responses to messages based on a priority of said queue in which said classified message is stored; and

means for transmitting content to all other peers in said peer-to-peer network.

27. The apparatus according to claim 26, wherein there are at least three queues.

28. The apparatus according to claim 27, wherein said queues includes a first queue and a second queue.

29. The apparatus according to claim 28, wherein messages in said first queue include a peer list and contact information for peers already in said peer-to-peer network and said first queue is a highest priority queue.

30. The apparatus according to claim 29, wherein a response to said peer list and said contact information includes means for establishing connections with peers already in said peer-to-peer network.

31. The apparatus according to claim 28, wherein messages in said second queue includes requests to recover missing content and said second queue is a lower priority queue than said first queue and further wherein responses to said requests to recover missing content include means for transmitting said requested missing content.

32. The apparatus according to claim 28, further comprising means for storing content to be forwarded to other peers in said peer-to-peer network in a third queue, wherein said third queue has a lowest priority.

33. The apparatus according to claim 26, further comprising:

means for determining an average queue size;

means for determining is said average queue size is one of less than and equal to a threshold; and

means for generating and transmitting a signal message to a content source server, if said average queue size is one of less than and equal to said threshold, wherein said signal message indicates that additional content is needed.

34. The apparatus according to claim 26, further comprising means for rendering said stored content.