File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/WCNC.2012.6214363
- Scopus: eid_2-s2.0-84864357992
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Request-peer selection for load-balancing in P2P live streaming systems
Title | Request-peer selection for load-balancing in P2P live streaming systems |
---|---|
Authors | |
Keywords | Design philosophy Live streaming Load-balancing Network traffic Number of datum |
Issue Date | 2012 |
Publisher | IEEE 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? |
Abstract | Unlike 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. |
Description | Theme: Services, Applications and Business |
Persistent Identifier | http://hdl.handle.net/10722/165312 |
ISBN | |
ISSN | 2020 SCImago Journal Rankings: 0.361 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, N | en_US |
dc.contributor.author | Wen, Z | en_US |
dc.contributor.author | Yeung, LK | en_US |
dc.contributor.author | Lei, ZB | en_US |
dc.date.accessioned | 2012-09-20T08:16:54Z | - |
dc.date.available | 2012-09-20T08:16:54Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.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 | en_US |
dc.identifier.isbn | 978-1-4673-0437-5 | - |
dc.identifier.issn | 1525-3511 | - |
dc.identifier.uri | http://hdl.handle.net/10722/165312 | - |
dc.description | Theme: Services, Applications and Business | - |
dc.description.abstract | Unlike 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.language | eng | en_US |
dc.publisher | IEEE Communications Society. | - |
dc.relation.ispartof | IEEE Wireless Communications and Networking Conference Proceedings | en_US |
dc.subject | Design philosophy | - |
dc.subject | Live streaming | - |
dc.subject | Load-balancing | - |
dc.subject | Network traffic | - |
dc.subject | Number of datum | - |
dc.title | Request-peer selection for load-balancing in P2P live streaming systems | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Liu, N: nwliu@eee.hku.hk | en_US |
dc.identifier.email | Wen, Z: wenzheng@eee.hku.hk | - |
dc.identifier.email | Yeung, LK: kyeung@eee.hku.hk | - |
dc.identifier.email | Lei, ZB: lei@astri.org | - |
dc.identifier.authority | Yeung, LK=rp00204 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/WCNC.2012.6214363 | - |
dc.identifier.scopus | eid_2-s2.0-84864357992 | - |
dc.identifier.hkuros | 210609 | en_US |
dc.identifier.spage | 3227 | - |
dc.identifier.epage | 3232 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1525-3511 | - |