Enhancing locality in structured peer-to-peer networks

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn 10, Issue , 2004, Pages 25-34

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

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS SYSTEMS; DISTRIBUTED HASH TABLES (DHT); INFORMATION REPOSITORY; PEER-TO-PEER NETWORKS;

COMPUTER SIMULATION; DECISION TABLES; HEURISTIC METHODS; INFORMATION RETRIEVAL SYSTEMS; INTERNET; LOCAL AREA NETWORKS; OPTIMIZATION; ROUTERS; TOPOLOGY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 4544369095     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2004.1316077     Document Type: Conference Paper

References (19)

1. P. Cao and S. Irani. Cost-Aware WWW Proxy Caching Algorithms. In Proceedings of USENIX Symposium on Internet Technologies and Sysstems (USITS), Monterey, CA, December 1997.
2. M. Castro, P. Druschel, Y. Hu, and A. Rowstron. Exploiting Network Proximity in Peer-to-Peer Overalay Networks, Technical Report MSR-TR-2002-82, 2002.
3. F. Dabek, M. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-Area Cooperative Storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles, Lake Louise, Canada, October 2001.
4. R. A. Ferreira, A. Grama, and S. Jagannathan. An IP Address Based Caching Scheme for Peer-to-Peer Networks. In Proceedings of IEEE Globecom 2003, San Francisco, CA, December 2003.
5. P. Francis, S. Jamin, V. Paxson, L. Zhang, D. F. Gryniewicz, and Y. Jin. An Architecture for a Global Internet Host Distance Estimation Service. In Proceedings of IEEE INFOCOM 1999, New York, NY, March 1999.
6. Frank Thomson Leighton. Introduction to Parallel Algorithms and Architectures; Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
7. Z. M. Mao, J. Rexford, J. Wang, and R. H. Katz. Towards an Accurate AS-Level Traceroute Tool. In Proceedings of the 2003 ACM SIGCOMM, Karlsruhe, Germany, August 2003.
8. T. E. Ng and H. Zhang. Predicting Internet Network Distance with Coordiantes-Based Approaches. In Proceedings of IEEE INFOCOM 2002, New York, NY, June 2002.
9. Plethora, http://www.cs.purdue.edu/homes/rf/plethora/.
10. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-Aware Overlay Construction and Server Selection. In Proceedings of IEEE INFOCOM 2002, New York, NY, June 2002.
11. S. Ratnasamy, S. Shenker, and I. Stoica. Routing Algorithms for DHTs: Some Open Questions. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), Boston, MA, March 2002.
12. A. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the 2001 ACM SIGCOMM, pages 247-254, San Diego, CA, August 2001.
13. A. Rowstron and P. Druschel. Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles, Lake Louise, Canada, October 2001.
14. K. Sripanidkulchia. The Popularity of Gnutella Queries and its Implication on Scalability, February 2001. http://www.cs.cmu.edu/kunwadee/research/p2p/gnutella.html.
15. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM, pages 149-160, San Diego, CA, August 2001.
16. Z. Xu, M. Mahalingam, and M. Karlsson. Turning Heterogeneity into an Advantage in Overlay Routing. In Proceedings of the IEEE INFOCOM 2003, San Francisco, CA, April 2003.
17. E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings of IEEE INFOCOM 1996, March 1996.
18. B. Zhao, Y Duan, L. Huang, A. Joseph, and J. Kubiatowicz. Brocade: Landmark Routing on Overlay Networks. In Proceedings of 1st International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, March 2002.
19. B. Y. Zhao, J. Kubiatowicz, and 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.