File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Capacity of P2P on-demand streaming with simple, robust and decentralized control

TitleCapacity of P2P on-demand streaming with simple, robust and decentralized control
Authors
KeywordsCapacity regions
Control protocols
Control strategies
High probability
On-demand streaming
Streaming systems
Upload bandwidths
Video-on-Demand (VoD)
Issue Date2013
PublisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359
Citation
The 32nd IEEE Conference on Computer Communications (IEEE INFOCOM 2013), Turin, Italy, 14-19 April 2013. In IEEE Infocom Proceedings, 2013, p. 2697-2705 How to Cite?
AbstractThe performance of large-scaled peer-to-peer (P2P) video-on-demand (VoD) streaming systems can be very challenging to analyze. In practical P2P VoD systems, each peer only interacts with a small number of other peers/neighbors. Further, its upload capacity may vary randomly, and both its downloading position and content availability change dynamically. In this paper, we rigorously study the achievable streaming capacity of large-scale P2P VoD systems with sparse connectivity among peers, and investigate simple and decentralized P2P control strategies that can provably achieve close-to-optimal streaming capacity. We first focus on a single streaming channel. We show that a close-to-optimal streaming rate can be asymptotically achieved for all peers with high probability as the number of peers N increases, by assigning each peer a random set of Θ(log N) neighbors and using a uniform rate-allocation algorithm. Further, the tracker does not need to obtain detailed knowledge of which chunks each peer caches, and hence incurs low overhead. We then study multiple streaming channels where peers watching one channel may help in another channel with insufficient upload bandwidth. We propose a simple random cache-placement strategy, and show that a close-to-optimal streaming capacity region for all channels can be attained with high probability, again with only Θ(logN) per-peer neighbors. These results provide important insights into the dynamics of large-scale P2P VoD systems, which will be useful for guiding the design of improved P2P control protocols. © 2013 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/186480
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorZhao, Cen_US
dc.contributor.authorZhao, Jen_US
dc.contributor.authorLin, Xen_US
dc.contributor.authorWu, Cen_US
dc.date.accessioned2013-08-20T12:11:09Z-
dc.date.available2013-08-20T12:11:09Z-
dc.date.issued2013en_US
dc.identifier.citationThe 32nd IEEE Conference on Computer Communications (IEEE INFOCOM 2013), Turin, Italy, 14-19 April 2013. In IEEE Infocom Proceedings, 2013, p. 2697-2705en_US
dc.identifier.isbn978-1-4673-5946-7-
dc.identifier.issn0743-166X-
dc.identifier.urihttp://hdl.handle.net/10722/186480-
dc.description.abstractThe performance of large-scaled peer-to-peer (P2P) video-on-demand (VoD) streaming systems can be very challenging to analyze. In practical P2P VoD systems, each peer only interacts with a small number of other peers/neighbors. Further, its upload capacity may vary randomly, and both its downloading position and content availability change dynamically. In this paper, we rigorously study the achievable streaming capacity of large-scale P2P VoD systems with sparse connectivity among peers, and investigate simple and decentralized P2P control strategies that can provably achieve close-to-optimal streaming capacity. We first focus on a single streaming channel. We show that a close-to-optimal streaming rate can be asymptotically achieved for all peers with high probability as the number of peers N increases, by assigning each peer a random set of Θ(log N) neighbors and using a uniform rate-allocation algorithm. Further, the tracker does not need to obtain detailed knowledge of which chunks each peer caches, and hence incurs low overhead. We then study multiple streaming channels where peers watching one channel may help in another channel with insufficient upload bandwidth. We propose a simple random cache-placement strategy, and show that a close-to-optimal streaming capacity region for all channels can be attained with high probability, again with only Θ(logN) per-peer neighbors. These results provide important insights into the dynamics of large-scale P2P VoD systems, which will be useful for guiding the design of improved P2P control protocols. © 2013 IEEE.-
dc.languageengen_US
dc.publisherIEEE Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000359-
dc.relation.ispartofIEEE Infocom Proceedingsen_US
dc.rightsIEEE Infocom. Proceedings. Copyright © IEEE Computer Society.-
dc.rights©2013 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.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectCapacity regions-
dc.subjectControl protocols-
dc.subjectControl strategies-
dc.subjectHigh probability-
dc.subjectOn-demand streaming-
dc.subjectStreaming systems-
dc.subjectUpload bandwidths-
dc.subjectVideo-on-Demand (VoD)-
dc.titleCapacity of P2P on-demand streaming with simple, robust and decentralized controlen_US
dc.typeConference_Paperen_US
dc.identifier.emailWu, C: cwu@cs.hku.hken_US
dc.identifier.authorityWu, C=rp01397en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/INFCOM.2013.6567078-
dc.identifier.scopuseid_2-s2.0-84883100718-
dc.identifier.hkuros217644en_US
dc.identifier.spage2697-
dc.identifier.epage2705-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 140523-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats