摘要:
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.
摘要:
A HCPS (hierarchically clustered P2P streaming system) comprising peers grouped into clusters and hierarchies. The HCPS actively balances the uploading capabilities among clusters and executes an optimal scheduling algorithm within each cluster to ensure that system resources are optimally utilized. The HCPS comprises an architecture which can be used in practical applications, yet can achieve the streaming rate close to the theoretical upper bound.
摘要:
A HCPS (hierarchically clustered P2P streaming system) comprising peers grouped into clusters and hierarchies. The HCPS actively balances the uploading capabilities among clusters and executes an optimal scheduling algorithm within each cluster to ensure that system resources are optimally utilized. The HCPS comprises an architecture which can be used in practical applications, yet can achieve the streaming rate close to the theoretical upper bound.
摘要:
A method and apparatus are described including receiving data from a plurality of cluster heads and forwarding the data to peers. Also described are a method and apparatus including calculating a sub-stream rate, splitting data into a plurality of data sub-streams and pushing the plurality of data sub-streams into corresponding transmission queues. Further described are a method and apparatus including splitting source data into a plurality of equal rate data sub-streams, storing the equal rate data sub-streams into a sub-server content buffer, splitting buffered data into a plurality of data sub-streams, calculating a plurality of sub-stream rates and pushing the data sub-streams into corresponding transmission queues.
摘要:
A method and apparatus are described including forwarding data in a transmission queue to a first peer in a same cluster, computing an average transmission queue size to a threshold, sending a signal to a cluster head based on a result of the comparison. A method and apparatus are also described including forwarding data in a transmission queue to a peer associated with an upper level peer, forwarding data in a playback buffer to a peer in a lower level cluster responsive to a first signal in a signal queue associated with the lower level cluster, determining if the playback buffer has exceeded a threshold for a period of time, sending a second signal to a source server based on a result of the determination.
摘要:
A method and apparatus are described including receiving buffer maps of neighbor peers, measuring serving rates from the neighbor peers, measuring serving rates to the neighbor peers, requesting a unit of data from one of the neighbor peers responsive to information in the buffer maps of the neighbor peers at a rate responsive to the serving rate from the one of the neighbor peers, receiving incoming requests for units of data, sorting the incoming requests into a plurality of queues, selecting one of the incoming requests to serve responsive to the serving rates to the neighbor peers corresponding to the incoming request, updating the queues and selecting a new neighbor peer.
摘要:
A method and apparatus are described including receiving buffer maps of neighbor peers, measuring serving rates from the neighbor peers, measuring serving rates to the neighbor peers, requesting a unit of data from one of the neighbor peers responsive to information in the buffer maps of the neighbor peers at a rate responsive to the serving rate from the one of the neighbor peers, receiving incoming requests for units of data, sorting the incoming requests into a plurality of queues, selecting one of the incoming requests to serve responsive to the serving rates to the neighbor peers corresponding to the incoming request, updating the queues and selecting a new neighbor peer.
摘要:
A Bayesian Inference based recommendation system in a social network is provided. The method and system utilizes content ratings from a querying initiator's friends and their friends depending on the time to live (TTL) and other factors. Receiving users send to the querying initiator recommendation ratings from their friends and a conditional probability of distribution of the recommendation ratings given by the recommender's rooted at the friend. Once this information has been obtained from the friend/hopped friend network, the querying initiator's recommendation query engine constructs the QI's own rating response using the Bayesian Inference Network.
摘要:
A method and apparatus are described including receiving content from a base station, storing the received content, receiving a second message from a first member of a network, determining a highest expected layer, a lowest layer received by the first member of the network requesting help, a highest layer that needs to be multicast to the first member of the network, and a lowest layer that needs to be multicast to the first member of the network, retrieving the stored content responsive to the message and multicasting the retrieved content to the first member of the network responsive to the determining act.
摘要:
A method comprises associating at least one cache replacement granularity value with a given one of a plurality of content streams comprising a number of segments, receiving a request for a given segment of the given content stream in a network element, identifying a given portion of the given content stream which contains the given segment, updating a value corresponding to the given portion of the given content stream, and determining whether to store the given portion of the given content stream in a memory of the network element based at least in part on the updated value corresponding to the given portion. The at least one cache replacement granularity value represents a given number of segments, the given content stream being separable into one or more portions based at least in part on the at least one cache replacement granularity value.