Improving the Performance of Overlay Routing and P2P File Sharing using Selfish Neighbor Selection

National Science Foundation (CISE/CSR 070604, ENG/EFRI 0735974, CISE/CNS 0524477, CNS/NeTS 0520166, CNS/ITR 0205294, CISE/EIA RI 0202067, CAREER 0446522); European Commission (RIDS-011923)

[1]  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.

[2]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

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

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

[5]  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.

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

[7]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS, and bandwidth provisioning , 2003, TNET.

[8]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[9]  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.

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

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

[12]  Larry L. Peterson,et al.  Reliability and Security in the CoDeeN Content Distribution Network , 2004, USENIX Annual Technical Conference, General Track.

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

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

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

[16]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

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

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

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

[20]  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.

[21]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[22]  Massimo Marchiori,et al.  Economic small-world behavior in weighted networks , 2003 .

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

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

[25]  Mostafa H. Ammar,et al.  On the Interaction Between Dynamic Routing in Native and Overlay Layers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[26]  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..

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

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

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

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

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

[32]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

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

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

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

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

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

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

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

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

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

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

[43]  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..

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

[45]  Scott Shenker,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

[46]  Y. Mansour,et al.  On Nash Equilibria for a Network Creation Game , 2006, TEAC.