File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/GLOCOM.2011.6134116
- Scopus: eid_2-s2.0-84857202057
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Closest playback-point first: A new peer selection algorithm for P2P VoD systems
Title | Closest playback-point first: A new peer selection algorithm for P2P VoD systems |
---|---|
Authors | |
Issue Date | 2011 |
Publisher | IEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308 |
Citation | Globecom - IEEE Global Telecommunications Conference, 2011 How to Cite? |
Abstract | Peer-to-peer (P2P) based video-on-demand (VoD) streaming service has been gaining popularity recently. Unlike live streaming, a VoD peer always starts its playback from the beginning of a stored video. The playback-points of different peers, as well as the amount of video contents/pieces they cached, depend on when they join the video session, or their viewing ages. As a result, the upload bandwidth of younger peers tends to be underutilized because older peers are not interested in their cached video pieces. The collaborative piece exchange among peers is undermined due to the unbalanced supply and demand. To address this issue, a playback-point based request peer selection algorithm is proposed in this paper. Specifically, when a peer requests a particular video piece, among the set of potential providers, a request is sent to the peer that has the smallest playback-point difference with itself. We call this request peer selection algorithm closest playback-point first (CPF). With CPF, peers with similar available content can be loosely grouped together for a more balanced collaborative piece exchange. Extensive packet-level simulations show that with CPF, the video playback quality is enhanced and the VoD server load is significantly reduced. © 2011 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/140255 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wen, Z | en_HK |
dc.contributor.author | Liu, N | en_HK |
dc.contributor.author | Yeung, KL | en_HK |
dc.contributor.author | Lei, Z | en_HK |
dc.date.accessioned | 2011-09-23T06:09:19Z | - |
dc.date.available | 2011-09-23T06:09:19Z | - |
dc.date.issued | 2011 | en_HK |
dc.identifier.citation | Globecom - IEEE Global Telecommunications Conference, 2011 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/140255 | - |
dc.description.abstract | Peer-to-peer (P2P) based video-on-demand (VoD) streaming service has been gaining popularity recently. Unlike live streaming, a VoD peer always starts its playback from the beginning of a stored video. The playback-points of different peers, as well as the amount of video contents/pieces they cached, depend on when they join the video session, or their viewing ages. As a result, the upload bandwidth of younger peers tends to be underutilized because older peers are not interested in their cached video pieces. The collaborative piece exchange among peers is undermined due to the unbalanced supply and demand. To address this issue, a playback-point based request peer selection algorithm is proposed in this paper. Specifically, when a peer requests a particular video piece, among the set of potential providers, a request is sent to the peer that has the smallest playback-point difference with itself. We call this request peer selection algorithm closest playback-point first (CPF). With CPF, peers with similar available content can be loosely grouped together for a more balanced collaborative piece exchange. Extensive packet-level simulations show that with CPF, the video playback quality is enhanced and the VoD server load is significantly reduced. © 2011 IEEE. | en_HK |
dc.language | eng | en_US |
dc.publisher | IEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308 | - |
dc.relation.ispartof | GLOBECOM - IEEE Global Telecommunications Conference | en_HK |
dc.title | Closest playback-point first: A new peer selection algorithm for P2P VoD systems | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_HK |
dc.identifier.authority | Yeung, KL=rp00204 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/GLOCOM.2011.6134116 | en_HK |
dc.identifier.scopus | eid_2-s2.0-84857202057 | en_HK |
dc.identifier.hkuros | 195090 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-84857202057&selection=ref&src=s&origin=recordpage | en_HK |
dc.description.other | The IEEE Global Telecommunications Conference (GLOBECOM 2011), Houston, TX, USA, 5-9 December 2011 | - |
dc.identifier.scopusauthorid | Wen, Z=36190141000 | en_HK |
dc.identifier.scopusauthorid | Liu, N=55003782200 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.scopusauthorid | Lei, Z=36661058300 | en_HK |