File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach

TitleSocially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach
Authors
Issue Date2014
PublisherI 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?
AbstractPeer-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 Identifierhttp://hdl.handle.net/10722/201101
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorZhao, Jen_US
dc.contributor.authorWu, Cen_US
dc.date.accessioned2014-08-21T07:13:34Z-
dc.date.available2014-08-21T07:13:34Z-
dc.date.issued2014en_US
dc.identifier.citationThe 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-36en_US
dc.identifier.isbn9781479941827-
dc.identifier.issn1545-0678-
dc.identifier.urihttp://hdl.handle.net/10722/201101-
dc.description.abstractPeer-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.languageengen_US
dc.publisherI E E E, Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000212-
dc.relation.ispartofInternational Conference on Distributed Computing Systems Workshops Proceedingsen_US
dc.rightsInternational Conference on Distributed Computing Systems Workshops Proceedings. Copyright © I E E E, Computer Society.-
dc.rights©2014 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.titleSocially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approachen_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/ICDCSW.2014.27-
dc.identifier.hkuros232130en_US
dc.identifier.spage29-
dc.identifier.epage36-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats