File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Request-peer selection for load-balancing in P2P live streaming systems

TitleRequest-peer selection for load-balancing in P2P live streaming systems
Authors
KeywordsDesign philosophy
Live streaming
Load-balancing
Network traffic
Number of datum
Issue Date2012
PublisherIEEE Communications Society.
Citation
The IEEE Conference on Wireless Communications and Networking (WCNC 2012), Paris, France, 1-4 April 2012. In IEEE Wireless Communications and Networking Conference Proceedings, 2012, p. 3227-3232 How to Cite?
AbstractUnlike peer-to-peer (P2P) file sharing, P2P live streaming systems have to meet real-time playback constraints, which makes it very challenging yet crucial to maximize the peer uplink bandwidth utilization so as to deliver content pieces in time. In general, this is achieved by adopting tailor-made piece selection and request-peer selection algorithms. The design philosophy is to regulate the network traffic and to balance the load among peers. In this paper, we propose a new request-peer selection algorithm. In particular, a peer in the network estimates the service response time (SRT) between itself and each neighboring peer. An SRT is measured from when a data piece request is sent until the requested piece arrives. When a peer makes a piece request, the neighbor with smaller SRT and fewer data pieces would be favored among potential providers. This is because smaller SRT implies excess serving capacity and fewer data pieces suggests less piece requests received. We evaluate the performance of our request-peer selection algorithm through extensive packet level simulations. Our simulation results show that the traffic load in the network is better balanced in the sense that the difference of the normalized number of data packets uploaded by each peer is getting smaller and the number of repeated piece requests generated by each peer (due to request failure) is significantly reduced. We also found that the load of streaming server is reduced, and the overall quality of service, measured by playback continuity, startup delay etc, is improved as well. © 2012 IEEE.
DescriptionTheme: Services, Applications and Business
Persistent Identifierhttp://hdl.handle.net/10722/165312
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLiu, Nen_US
dc.contributor.authorWen, Zen_US
dc.contributor.authorYeung, LKen_US
dc.contributor.authorLei, ZBen_US
dc.date.accessioned2012-09-20T08:16:54Z-
dc.date.available2012-09-20T08:16:54Z-
dc.date.issued2012en_US
dc.identifier.citationThe IEEE Conference on Wireless Communications and Networking (WCNC 2012), Paris, France, 1-4 April 2012. In IEEE Wireless Communications and Networking Conference Proceedings, 2012, p. 3227-3232en_US
dc.identifier.isbn978-1-4673-0437-5-
dc.identifier.issn1525-3511-
dc.identifier.urihttp://hdl.handle.net/10722/165312-
dc.descriptionTheme: Services, Applications and Business-
dc.description.abstractUnlike peer-to-peer (P2P) file sharing, P2P live streaming systems have to meet real-time playback constraints, which makes it very challenging yet crucial to maximize the peer uplink bandwidth utilization so as to deliver content pieces in time. In general, this is achieved by adopting tailor-made piece selection and request-peer selection algorithms. The design philosophy is to regulate the network traffic and to balance the load among peers. In this paper, we propose a new request-peer selection algorithm. In particular, a peer in the network estimates the service response time (SRT) between itself and each neighboring peer. An SRT is measured from when a data piece request is sent until the requested piece arrives. When a peer makes a piece request, the neighbor with smaller SRT and fewer data pieces would be favored among potential providers. This is because smaller SRT implies excess serving capacity and fewer data pieces suggests less piece requests received. We evaluate the performance of our request-peer selection algorithm through extensive packet level simulations. Our simulation results show that the traffic load in the network is better balanced in the sense that the difference of the normalized number of data packets uploaded by each peer is getting smaller and the number of repeated piece requests generated by each peer (due to request failure) is significantly reduced. We also found that the load of streaming server is reduced, and the overall quality of service, measured by playback continuity, startup delay etc, is improved as well. © 2012 IEEE.-
dc.languageengen_US
dc.publisherIEEE Communications Society.-
dc.relation.ispartofIEEE Wireless Communications and Networking Conference Proceedingsen_US
dc.rightsIEEE Wireless Communications and Networking Conference. Proceedings. Copyright © IEEE Communications Society.-
dc.rights©2012 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.subjectDesign philosophy-
dc.subjectLive streaming-
dc.subjectLoad-balancing-
dc.subjectNetwork traffic-
dc.subjectNumber of datum-
dc.titleRequest-peer selection for load-balancing in P2P live streaming systemsen_US
dc.typeConference_Paperen_US
dc.identifier.emailLiu, N: nwliu@eee.hku.hken_US
dc.identifier.emailWen, Z: wenzheng@eee.hku.hk-
dc.identifier.emailYeung, LK: kyeung@eee.hku.hk-
dc.identifier.emailLei, ZB: lei@astri.org-
dc.identifier.authorityYeung, LK=rp00204en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/WCNC.2012.6214363-
dc.identifier.scopuseid_2-s2.0-84864357992-
dc.identifier.hkuros210609en_US
dc.identifier.spage3227-
dc.identifier.epage3232-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats