# US 2014/0195612 A1 · Queue-based adaptive chunk scheduling for peer-to-peer live streaming > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2014/0195612 A1 - Document ID: US20140195612A1 - Status: Published application - Kind: A1 - Application number: 14/181,975 - Filed: 2014-02-17 - Published: 2014-07-10 - Earliest claimed: 2009-12-11 - Assignees: Thomson Licensing - Applicants: Thomson Licensing - Inventors: Yang Guo; Chao Liang; Yong Liu - Web page: https://patentgrep.com/patent/US20140195612A1 ## CPC - H04L 65/611: for multicast or broadcast (systems for broadcast or conference H04L12/18; arrangements for broadcast or distribution combined with broadcast H04H20/00; arrangements for broadcast applications with a direct linkage to broadcast information or to broadcast space-time H04H60/00; selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS], H04W4/06) - H04L 65/612: for unicast - H04L 65/65: Network streaming protocols, e.g. real-time transport protocol [RTP] or real-time control protocol [RTCP] - H04L 65/80: Responding to QoS - H04L 67/1085: {involving dynamic management of active down- or uploading connections} - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## 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 ### Claim 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. ### Claim 2 (depends on 1) The method according to claim 1, wherein there are at least three queues. ### Claim 3 (depends on 2) The method according to claim 2, wherein said queues includes a first queue, a second queue and a third queue. ### Claim 4 (depends on 3) 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. ### Claim 5 (depends on 4) 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. ### Claim 6 (depends on 3) 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. ### Claim 7 (depends on 3) 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. ### Claim 8 (depends on 3) 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. ### Claim 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. ### Claim 10 (depends on 9) The apparatus according to claim 9, wherein there are at least three queues. ### Claim 11 (depends on 10) The apparatus according to claim 10, wherein said queues includes a first queue, a second queue and a third queue. ### Claim 12 (depends on 11) 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. ### Claim 13 (depends on 12) 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. ### Claim 14 (depends on 11) 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. ### Claim 15 (depends on 11) 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. ### Claim 16 (depends on 11) 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. ### Claim 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. ### Claim 18 (depends on 17) The method according to claim 17, wherein there are at least three queues. ### Claim 19 (depends on 18) The method according to claim 18, wherein said queues includes a first queue and a second queue. ### Claim 20 (depends on 19) 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. ### Claim 21 (depends on 20) 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. ### Claim 22 (depends on 19) 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. ### Claim 23 (depends on 19) 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. ### Claim 24 (depends on 17) The method according to claim 17, further comprising: determining an average queue size; determining is said average queue size is one of les 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. ### Claim 25 (depends on 17) The method according to claim 17, further comprising rendering said stored content. ### Claim 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. ### Claim 27 (depends on 26) The apparatus according to claim 26, wherein there are at least three queues. ### Claim 28 (depends on 27) The apparatus according to claim 27, wherein said queues includes a first queue and a second queue. ### Claim 29 (depends on 28) 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. ### Claim 30 (depends on 29) 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. ### Claim 31 (depends on 28) 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. ### Claim 32 (depends on 28) 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. ### Claim 33 (depends on 26) 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. ### Claim 34 (depends on 26) The apparatus according to claim 26, further comprising means for rendering said stored content.