Locality in structured peer-to-peer networks

Journal of Parallel and Distributed Computing

Volumn 66, Issue 2, 2006, Pages 257-273

  Ferreira, Ronaldo A ^a   Jagannathan, Suresh ^a   Grama, Ananth ^a  

^a Purdue University   (United States)

Author keywords

Caching; DHT; Internet; Locality; Peer to peer networks; Query resolution

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; INTERNET; QUERY LANGUAGES;

CACHING; DHT; LOCALITY; PEER-TO-PEER NETWORKS; QUERY RESOLUTION;

LOCAL AREA NETWORKS;

EID: 30644457480     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2005.09.002     Document Type: Article

References (36)

1. A. Agrawal, and H. Casanova Clustering hosts in P2P and global computing platforms Proceedings of the third International Workshop on Global and Peer-to-Peer Computing Tokyo, Japan 2003 367 373
2. S. Banerjee, B. Bhattacharjee, and C. Kommareddy Scalable application layer multicast Proceedings of the 2002 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication Pittsburgh, PA 2002 205 217
3. P. Cao, and S. Irani Cost-aware WWW proxy caching algorithms Proceedings of the USENIX Symposium on Internet Technologies and Systems (USITS) 1997 Monterey CA 193 206
4. M. Castro, P. Druschel, Y. Hu, A. Rowstron, Exploiting network proximity in peer-to-peer overlay networks, Technical Report MSR-TR-2002-82, 2002.
5. Y. Chu, S.G. Rao, and H. Zhang A case for end system multicast Proceedings of the 2000 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems Santa Clara, CA 2000 1 12
6. E. Cohen, and S. Shenker Replication strategies in unstructured peer-to-peer networks Proceedings of the 2002 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication Pittsburgh, PA 2002
7. F. Dabek, M. Kaashoek, D. Karger, R. Morris, and I. Stoica Wide-area cooperative storage with CFS Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP) 2001 Lake Louise Canada 202 215
8. R. Ferreira, A. Grama, S. Jagannathan, Plethora: a wide-area read-write object repository, URL: http://www.cs.purdue.edu/homes/rf/plethora/.
9. R.A. Ferreira, A. Grama, and S. Jagannathan An IP address-based caching scheme for peer-to-peer networks Proceedings of the IEEE Globecom 2003 2003 San Francisco CA 3845 3850
10. P. Francis, S. Jamin, V. Paxson, L. Zhang, D.F. Gryniewicz, and Y. Jin An architecture for a global internet host distance estimation service Proceedings of the IEEE INFOCOM 1999 1999 New York NY 210 217
11. M.R. Garey, and D.S. Johnson Computers and Intractability - A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York
12. Gnutella, URL: http://gnutella.wego.com/.
13. K.P. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan Measurement, modeling and analysis of a peer-to-peer file sharing workload Proceedings of the 19th ACM Symposium of Operating Systems Principles (SOSP) 2003 New York NY, USA 314 329
14. T. Hong, Performance, in: Peer-to-Peer: Harnessing the Power of Disruptive Technologies, O'Reilly, 2001.
15. J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao OceanStore an architecture for global-scale persistent storage Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000) Cambridge, MA 2000 190 201
16. F.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes 1992 Morgan Kaufmann Los Altos, CA
17. D. Malkhi, M. Naor, et al., Viceroy: a scalable and dynamic emulation of the butterfly, in: Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), Monterey, CA, 2002, pp. 183-192.
18. Z.M. Mao, J. Rexford, J. Wang, and R.H. Katz Towards an accurate AS-level traceroute tool Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication Karlsruhe, Germany 2003 365 378
19. Napster, URL: http://www.napster.com/.
20. T.E. Ng, and H. Zhang Predicting internet network distance with coordinates-based approaches Proceedings of the IEEE INFOCOM 2002 2002 New York NY
21. C.G. Plaxton, R. Rajaraman, and A.W. Richa Accessing nearby copies of replicated objects in a distributed environment Theory Comput. Systems 32 1999 241 280
22. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker A scalable content-addressable network Proceedings of the 2001 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication San Diego, CA 2001 247 254
23. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker Topologically-aware overlay construction and server selection Proceedings of the IEEE INFOCOM 2002 2002 New York NY
24. S. Ratnasamy, S. Shenker, and I. Stoica Routing algorithms for DHTs some open questions Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS'02) Boston, MA 2002 45 52
25. A. Rowstron, and P. Druschel Pastry scalable, decentralized object location and routing for large-scale peer-to-peer systems Proceedings of the 2001 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication San Diego, CA 2001 247 254
26. A. Rowstron, and P. Druschel Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP) 2001 Lake Louise Canada 188 201
27. S.D.G.S. Saroiu, and K.P. Gummadi Measuring and analyzing the characteristics of Napster and Gnutella hosts Multimedia Systems J. 9 2 2003 170 184
28. S. Saroiu, K.P. Gummadi, and S.D. Gribble A measurement study of peer-to-peer file sharing systems Proceedings of the Multimedia Computing and Networking 2002 (MMCN '02) 2002 San Jose CA, USA
29. S. Sen, and J. Wang Analyzing peer-to-peer traffic across large networks ACM Trans. Networking 12 2 2004 219 232
30. Skitter Project, URL: http://www.caida.org/tools/measurement/skitter/
31. K. Sripanidkulchia, The Popularity of Gnutella Queries and its Implication on Scalability, February 2001, URL: http://www.cs.cmu.edu/kunwadee/research/p2p/gnutella.html
32. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan Chord: a scalable peer-to-peer lookup service for internet applications Proceedings of the 2001 ACM SIGCOMM Conference on Applications Technologies, Architectures, and Protocols for Computer Communication San Diego, CA 2001 149 160
33. University of Oregon Route Views Project, URL: http://antc.uoregon.edu/route-views/
34. Z. Xu, M. Mahalingam, and M. Karlsson Turning heterogeneity into an advantage in overlay routing Proceedings of the IEEE INFOCOM 2003 2003 San Francisco CA
35. B. Zhao, Y. Duan, L. Huang, A. Joseph, and J. Kubiatowicz Brocade Landmark routing on overlay networks Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS) Cambridge, MA 2002 34 44
36. B.Y. Zhao, J. Kubiatowicz, A.D. Joseph, Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Technical Report UCB/CSD-0101141, UC Berkeley, Computer Science Division, April 2001.