Öppna denna publikation i ny flik eller fönster >>2009 (Engelska)Ingår i: Peer-to-Peer Networking and Applications, ISSN 1936-6442, E-ISSN 1936-6450, Vol. 3, nr 3, s. 208-221Artikel i tidskrift (Refereegranskat) Published
Abstract [en]
In mesh-based peer-to-peer streaming systemsdata is distributed among the peers according tolocal scheduling decisions. The local decisions affecthow packets get distributed in the mesh, the probabilityof duplicates and consequently, the probabilityof timely data delivery. In this paper we proposean analytic framework that allows the evaluation ofscheduling algorithms. We consider four solutions inwhich scheduling is performed at the forwarding peer,based on the knowledge of the playout buffer contentat the neighbors. We evaluate the effectiveness of thesolutions in terms of the probability that a peer can playout a packet versus the playback delay, the sensitivityof the solutions to the accuracy of the knowledge of theneighbors’ playout buffer contents, and the scalabilityof the solutions with respect to the size of the overlay.We also show how the model can be used to evaluatethe effects of node arrivals and departures on the overlay’sperformance.
Nyckelord
Mesh-based streaming, Delay performance
Nationell ämneskategori
Telekommunikation
Identifikatorer
urn:nbn:se:kth:diva-12695 (URN)10.1007/s12083-009-0049-3 (DOI)000284095100004 ()2-s2.0-77955176963 (Scopus ID)
Anmärkning
QC 201005062010-05-062010-05-062022-06-25Bibliografiskt granskad