File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: The streaming capacity of sparsely-connected P2P systems with distributed control

TitleThe streaming capacity of sparsely-connected P2P systems with distributed control
Authors
KeywordsCapacity regions
Complete networks
Content distribution networks
Distributed control
In-channels
Issue Date2011
PublisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/
Citation
The IEEE INFOCOM 2011, Shanghai, China, 10-15 April 2011. In Conference Proceedings, 2011, p. 1449-1457 How to Cite?
AbstractPeer-to-Peer (P2P) streaming technologies can take advantage of the upload capacity of clients, and hence can scale to large content distribution networks with lower cost. A fundamental question for P2P streaming systems is the maximum streaming rate that all users can sustain. Prior works have studied the optimal streaming rate for a complete network, where every peer is assumed to communicate with all other peers. This is however an impractical assumption in real systems. In this paper, we are interested in the achievable streaming rate when each peer can only connect to a small number of neighbors. We show that even with a random peer selection algorithm and uniform rate allocation, as long as each peer maintains Ω(logN) downstream neighbors, where N is the total number of peers in the system, the system can asymptotically achieve a streaming rate that is close to the optimal streaming rate of a complete network.We then extend our analysis to multi-channel P2P networks, and we study the scenario where "helpers" from channels with excessive upload capacity can help peers in channels with insufficient upload capacity. We show that by letting each peer select Ω(logN) neighbors randomly from either the peers in the same channel or from the helpers, we can achieve a close-to-optimal streaming capacity region. Simulation results are provided to verify our analysis. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/135702
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorZhao, Cen_HK
dc.contributor.authorLin, Xen_HK
dc.contributor.authorWu, Cen_HK
dc.date.accessioned2011-07-27T01:46:58Z-
dc.date.available2011-07-27T01:46:58Z-
dc.date.issued2011en_HK
dc.identifier.citationThe IEEE INFOCOM 2011, Shanghai, China, 10-15 April 2011. In Conference Proceedings, 2011, p. 1449-1457en_HK
dc.identifier.issn0743-166Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/135702-
dc.description.abstractPeer-to-Peer (P2P) streaming technologies can take advantage of the upload capacity of clients, and hence can scale to large content distribution networks with lower cost. A fundamental question for P2P streaming systems is the maximum streaming rate that all users can sustain. Prior works have studied the optimal streaming rate for a complete network, where every peer is assumed to communicate with all other peers. This is however an impractical assumption in real systems. In this paper, we are interested in the achievable streaming rate when each peer can only connect to a small number of neighbors. We show that even with a random peer selection algorithm and uniform rate allocation, as long as each peer maintains Ω(logN) downstream neighbors, where N is the total number of peers in the system, the system can asymptotically achieve a streaming rate that is close to the optimal streaming rate of a complete network.We then extend our analysis to multi-channel P2P networks, and we study the scenario where "helpers" from channels with excessive upload capacity can help peers in channels with insufficient upload capacity. We show that by letting each peer select Ω(logN) neighbors randomly from either the peers in the same channel or from the helpers, we can achieve a close-to-optimal streaming capacity region. Simulation results are provided to verify our analysis. © 2011 IEEE.en_HK
dc.languageengen_US
dc.publisherI E E E, Computer Society. The Journal's web site is located at http://www.ieee-infocom.org/en_HK
dc.relation.ispartofProceedings of the IEEE INFOCOMen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsIEEE Infocom Proceedings. Copyright © IEEE, Computer Society.-
dc.rights©2011 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectCapacity regions-
dc.subjectComplete networks-
dc.subjectContent distribution networks-
dc.subjectDistributed control-
dc.subjectIn-channels-
dc.titleThe streaming capacity of sparsely-connected P2P systems with distributed controlen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0743-166X&volume=&spage=1449&epage=1457&date=2011&atitle=The+streaming+capacity+of+sparsely-connected+P2P+systems+with+distributed+control-
dc.identifier.emailWu, C:cwu@cs.hku.hken_HK
dc.identifier.authorityWu, C=rp01397en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/INFCOM.2011.5934932en_HK
dc.identifier.scopuseid_2-s2.0-79960855037en_HK
dc.identifier.hkuros187765en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79960855037&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1449en_HK
dc.identifier.epage1457en_HK
dc.publisher.placeUnited Statesen_HK
dc.description.otherThe IEEE INFOCOM 2011, Shanghai, China, 10-15 April 2011. In Conference Proceedings, 2011, p. 1449-1457-
dc.identifier.scopusauthoridZhao, C=35792987400en_HK
dc.identifier.scopusauthoridLin, X=24776268100en_HK
dc.identifier.scopusauthoridWu, C=15836048100en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats