Superceded by BUCS-TR-2007-013 ; “ Egoist : Overlay Routing using Selfish Neighbor Selection ” Improving the Performance of Overlay Routing and P 2 P File Sharing using Selfish Neighbor Selection

A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into the existing mesh and re-wiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific applications designed to work well in real deployments, and providing abstractions for the underlying problem that are tractable to address via theoretical analyses, especially game-theoretic analysis. Our work unifies these two thrusts first by distilling insights gleaned from clean theoretical models, notably that under natural resource constraints, selfish players can select neighbors so as to efficiently reach near-equilibria that also provide high global performance. Using Egoist, a prototype overlay routing system we implemented on PlanetLab, we demonstrate that our neighbor selection primitives significantly outperform existing heuristics on a variety of performance metrics; that Egoist is competitive with an optimal, but unscalable full-mesh approach; and that it remains highly effective under significant churn. We also describe variants of Egoist’s current design that would enable it to scale to overlays of much larger scale and allow it to cater effectively to applications, such as P2P file sharing in unstructured overlays, based on the use of primitives such as scoped-flooding rather than routing. This work was supported in part by a number of NSF awards, including CISE/CSR Award #0720604, ENG/EFRI Award #0735974, CISE/CNS Award #0524477, CNS/NeTS Award #0520166, CNS/ITR Award #0205294, CISE/EIA RI Award #0202067, CAREER Grant #0446522, and the European Commission (Contract No. RIDS-011923).

[1]  Yishay Mansour,et al.  On Nash Equilibria for a Network Creation Game , 2014, TEAC.

[2]  Azer Bestavros,et al.  Implications of Selfish Neighbor Selection in Overlay Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Mostafa H. Ammar,et al.  Preemptive Strategies to Improve Routing Performance of Native and Overlay Layers , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[4]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

[5]  Rajmohan Rajaraman,et al.  A bounded-degree network formation game , 2007, ArXiv.

[6]  Dmitri Loguinov,et al.  Modeling Heterogeneous User Churn and Local Resilience of Unstructured P2P Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[7]  Walter Willinger,et al.  On Unbiased Sampling for Unstructured Peer-to-Peer Networks , 2006, IEEE/ACM Transactions on Networking.

[8]  Brighten Godfrey,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

[9]  Stefan Schmid,et al.  On the topologies formed by selfish peers , 2006, PODC '06.

[10]  Yong Zhu,et al.  Dynamic overlay routing based on available bandwidth estimation: A simulation study , 2006, Comput. Networks.

[11]  David C. Parkes,et al.  The price of selfish behavior in bilateral network formation , 2005, PODC '05.

[12]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[13]  Kimberly C. Claffy,et al.  Comparison of Public End-to-End Bandwidth Estimation Tools on High-Speed Links , 2005, PAM.

[14]  David Watson,et al.  Topology aware overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Alberto Blanc,et al.  Designing incentives for peer-to-peer routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[16]  Donald F. Towsley,et al.  On the interaction between overlay routing and underlay routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Ion Stoica,et al.  Robust incentive techniques for peer-to-peer networks , 2004, EC '04.

[18]  Ion Stoica,et al.  Characterizing selfishly constructed overlay routing networks , 2004, IEEE INFOCOM 2004.

[19]  Anthony Young,et al.  Overlay mesh construction using interleaved spanning trees , 2004, IEEE INFOCOM 2004.

[20]  Prasant Mohapatra,et al.  The impact of topology on overlay routing service , 2004, IEEE INFOCOM 2004.

[21]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[22]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[23]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[24]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[25]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[26]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[27]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[28]  Scott Shenker,et al.  On a network creation game , 2003, PODC '03.

[29]  Richard G. Baraniuk,et al.  pathChirp: Efficient available bandwidth estimation for network paths , 2003 .

[30]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[31]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS and bandwidth provisioning , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[32]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[33]  S. Shenker,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[34]  V. Latora,et al.  Economic small-world behavior in weighted networks , 2002, cond-mat/0204089.

[35]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[36]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[37]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[38]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[39]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[40]  Karthik Tamilmani,et al.  SWIFT: A System With Incentives For Trading , 2004 .

[41]  Sean C. Rhea,et al.  USENIX Association Proceedings of the General Track : , 2004 .

[42]  Randy H. Katz,et al.  OverQoS: offering Internet QoS using overlays , 2003, CCRV.

[43]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[44]  Amin Vahdat,et al.  Detour: informed Internet routing and transport , 1999, IEEE Micro.

[45]  Vivek S. Pai,et al.  Proceedings of the General Track: 2004 Usenix Annual Technical Conference Reliability and Security in the Codeen Content Distribution Network , 2022 .