X hits on this document





10 / 10

Acknowledgements We would like to thank Rumen Tashev for helping us with SSFNet simulations, and the anonymous reviewers for their valuable com- ments. Support for this work was partially provided by EU FP6 project DELIS.



[1] A. Nakao, L. Peterson, and A. Bavier, “A Routing Underlay for Overlay Networks,” in SIGCOMM, 2003.

[2] “Slyck,” http://www.slyck.com/.

[3] T. Karagiannis, A. Broido, N. Brownlee, kc claffy, and M. Faloutsos, “Is P2P dying or just hiding?,” in GLOBECOM, 2004.

[4] Light Reading, “Controlling P2P Traffic,” http://www.lightreading.com/document.asp?site= lightreading&doc_id=44435&page_number=3.

[5] R. Steinmetz and K. Wehrle, P2P Systems and Applications, Springer Lecture Notes in CS, 2005.

[6] T. Mennecke, “DSL Broadband Providers Perform Balancing Act,” http://www.slyck.com/news.php?story=973.

[7] R. Keralapura, N. Taft, C. Chuah, and G. Iannaccone, “Can ISPs Take the Heat from Overlay Networks?,” in HotNets, 2004.

[8] G. Shen, Y. Wang, Y. Xiong, B. Zhao, and Z. Zhang, “HPTP: Relieving the Tension between ISPs and P2P,” in IPTPS, 2007.

[9] V. Aggarwal, S. Bender, A. Feldmann, and A. Wichmann, “Methodology for Estimating Network Distances of Gnutella Neighbors,” in GI Jahrestagung - Informatik 2004, 2004.

[10] T. Karagiannis, P. Rodriguez, and K. Papagiannaki, “Should ISPs fear Peer-Assisted Content Distribution?,” in IMC, 2005.

[11] A. Akella, S. Seshan, and A. Shaikh, “An Empirical Evaluation of Wide-Area Internet Bottlenecks,” in ACM IMC, 2003.

[12] A. Rasti, D. Stutzbach, and R. Rejaie, “On the Long-term Evolution of the Two-Tier Gnutella Overlay,” in Global Internet, 2006.

[13] S. Halabi, Internet Routing Architectures, Cisco Press, 2000.

[14] D. Andersen, H. Balakrishnan, M. Kaashoek, and R. Morris, “Resilient Overlay Networks,” in SOSP, 2001.

[15] “Gnutella v0.6 RFC,” http://www.the-gdf.org/.

[16] S. Savage, A. Collins, and E. Hoffman, “The End-to-End Effects of Internet Path Selection,” in SIGCOMM, 1999.

[17] S. Seetharaman and M. Ammar, “On the Interaction between Dynamic Routing in the Native and Overlay Layers,” in INFOCOM, 2006.

[18] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Topologically aware overlay construction and server selection,” in INFOCOM, 2002.

[19] K. Shanahan and M. Freedman, “Locality Prediction for Oblivious Clients,” in IPTPS, 2005.

[20] M. Adler, R. Kumar, K. Ross, D. Rubenstein, T. Suel, and D. Yao, “Optimal Selection of Peers for P2P Downloading and Streaming,” in INFOCOM, 2005.

[21] Bindal et.al., “Improving Traffic Locality in BitTorrent via Biased Neighbor Selection,” in IEEE ICDCS, 2006.

ACM SIGCOMM Computer Communication Review


[22] B. Zhao, Y. Duan, L. Huang, A. Joseph, and J. Kubiatowicz, “Brocade: Landmark Routing on Overlay Networks,” in IPTPS, 2002.

[23] N. Spring, R. Mahajan, and D. Wetherall, “Measuring ISP Topologies with Rocketfuel,” in SIGCOMM, 2002.

[24] “pWhoIs,” http://pwhois.org.

[25] “Cymru Whois,” http://www.cymru.com/BGP/asnlookup.html.

[26] M. Naor and U. Wieder, “Novel architectures for P2P applications: the continuous-discrete approach,” in SPAA, 2003.

[27] G. Plaxton, R. Rajaraman, and A. Richa, “Accessing nearby copies of replicated objects in a distributed environment,” in SPAA, 1997.

[28] I. Abraham, D. Malkhi, and O. Dobzinski, “LAND: stretch (1 + ) locality-aware networks for DHTs,” in SODA, 2004.

[29] S. Arora, S. Rao, and U. Vazirani, “Expander flows, geometric embeddings and graph partitioning,” in STOC, 2004.

[30] P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002.

[31] W. Muehlbauer, A. Feldmann, O. Maennel, M. Roughan, and S. Uhlig, “Building an AS-Topology Model that Captures Route Diversity,” in SIGCOMM, 2006.

[32] P. Mahadevan, D. Krioukov, K. Fall, and A. Vahdat, “Systematic Topology Analysis and Generation Using Degree Correlations,” in SIGCOMM, 2006.

[33] L. Li, D. Alderson, W. Willinger, and J. Doyle, “A First-Principles Approach to Understanding the Internet’s Router-level Topology,” in SIGCOMM, 2004.

[34] H. Chang, S. Jamin, Z. Mao, and W. Willinger, “An Empirical Approach to Modeling Inter-AS Traffic Matrices,” in IMC, 2005.

[35] C. Scheideler, “Towards a paradigm for robust distributed algorithms and data structures,” in HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.

[36] “SSFNet,” http://www.ssfnet.org.

[37] D. Stutzbach, R. Rejaie, and S. Sen, “Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems,” in ACM IMC, 2005.

[38] A. Gish, Y. Shavitt, and T. Tankel, “Geographical Statistics and Characteristics of P2P Query Strings,” in IPTPS, 2007.

[39] D. Stutzbach and R. Rejaie, “Understanding Churn in P2P Networks,” in IMC, 2006.

[40] V. Aggarwal, A. Feldmann, and S. Mohrs, “Implementation of a P2P system within a network simulation framework,” in ECCS P2P-Complex Workshop, 2005.

[41] R. Tashev, “Experimenting with Neighbour Discovery Schemes for P2P Networks in a Simulation Framework,” in Master thesis, Dept of CS, TU Munich, 2006.

[42] “Gnutella Hostcache,” http://www.the-gdf.org/index. php?title=The_Local_Hostcache.

[43] P. Linga, I. Gupta, and K. Birman, “A Churn-Resistant P2P Web Caching System,” in SSRS, 2003.

[44] “yWorks,” http://www.yworks.com/. [45] “GTK-Gnutella,” http://www.gtk-gnutella.com/.

Volume 37, Number 3, July 2007

Document info
Document views14
Page views14
Page last viewedWed Oct 26 03:04:05 UTC 2016