File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICDCSW.2014.27
- Scopus: eid_2-s2.0-84988431011
- WOS: WOS:000346650900005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach
Title | Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach |
---|---|
Authors | |
Issue Date | 2014 |
Publisher | I E E E, Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000212 |
Citation | The 6th International Workshop on Hot Topics in Peer-To-Peer Computing and Online Social Networking (HotPOST), in conjunction with 34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS), Madrid, Spain, 30 June-3 July 3 2014, p. 29-36 How to Cite? |
Abstract | Peer-to-peer (P2P) technology is popularly exploited to enable large-scale content distribution (e.g., live and on-demand video streaming) with low server costs. Most P2P protocols in place are network agnostic, where peers download content chunks from each other regardless of their ISP belonging, leading to significant amounts of inter-ISP traffic. It has been a daunting challenge how to design protocols that optimize the P2P content distribution topology, such that inter-ISP traffic is minimized while the dissemination performance is maximized, not to mention one that motivates peer's voluntary ISP-aware peer selection. In this paper, we formulate a social welfare maximization framework for dynamical construction of the P2P content distribution topology % (namely deciding who is downloading which chunk from whom), taking into consideration both peers' gain due to chunk downloading and inter-ISP traffic that is incurred. Given its nature of an assignment problem, we resort to a primal-dual framework to design the solution algorithm, which can be practically implemented as a set of distributed, interleaving auctions, where peers bid for bandwidth to download chunks at other peers considering the potential inter-ISP traffic as a cost factor. Such an auction-based mechanism encourages peers to download from neighbors with low network costs in between, in order to succeed in bandwidth acquisition for chunk downloading. We analyze and prove the social optimality achieved by the distributed auctions and verify the performance of our proposal using realistic emulation experiments with real P2P traffic. |
Persistent Identifier | http://hdl.handle.net/10722/201101 |
ISBN | |
ISSN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhao, J | en_US |
dc.contributor.author | Wu, C | en_US |
dc.date.accessioned | 2014-08-21T07:13:34Z | - |
dc.date.available | 2014-08-21T07:13:34Z | - |
dc.date.issued | 2014 | en_US |
dc.identifier.citation | The 6th International Workshop on Hot Topics in Peer-To-Peer Computing and Online Social Networking (HotPOST), in conjunction with 34th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS), Madrid, Spain, 30 June-3 July 3 2014, p. 29-36 | en_US |
dc.identifier.isbn | 9781479941827 | - |
dc.identifier.issn | 1545-0678 | - |
dc.identifier.uri | http://hdl.handle.net/10722/201101 | - |
dc.description.abstract | Peer-to-peer (P2P) technology is popularly exploited to enable large-scale content distribution (e.g., live and on-demand video streaming) with low server costs. Most P2P protocols in place are network agnostic, where peers download content chunks from each other regardless of their ISP belonging, leading to significant amounts of inter-ISP traffic. It has been a daunting challenge how to design protocols that optimize the P2P content distribution topology, such that inter-ISP traffic is minimized while the dissemination performance is maximized, not to mention one that motivates peer's voluntary ISP-aware peer selection. In this paper, we formulate a social welfare maximization framework for dynamical construction of the P2P content distribution topology % (namely deciding who is downloading which chunk from whom), taking into consideration both peers' gain due to chunk downloading and inter-ISP traffic that is incurred. Given its nature of an assignment problem, we resort to a primal-dual framework to design the solution algorithm, which can be practically implemented as a set of distributed, interleaving auctions, where peers bid for bandwidth to download chunks at other peers considering the potential inter-ISP traffic as a cost factor. Such an auction-based mechanism encourages peers to download from neighbors with low network costs in between, in order to succeed in bandwidth acquisition for chunk downloading. We analyze and prove the social optimality achieved by the distributed auctions and verify the performance of our proposal using realistic emulation experiments with real P2P traffic. | - |
dc.language | eng | en_US |
dc.publisher | I E E E, Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000212 | - |
dc.relation.ispartof | International Conference on Distributed Computing Systems Workshops Proceedings | en_US |
dc.title | Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Wu, C: cwu@cs.hku.hk | en_US |
dc.identifier.authority | Wu, C=rp01397 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICDCSW.2014.27 | - |
dc.identifier.scopus | eid_2-s2.0-84988431011 | - |
dc.identifier.hkuros | 232130 | en_US |
dc.identifier.spage | 29 | - |
dc.identifier.epage | 36 | - |
dc.identifier.isi | WOS:000346650900005 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 1545-0678 | - |