An IP Address Based Caching Scheme for Peer-to-Peer Networks

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 7, Issue , 2003, Pages 3845-3850

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

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERING RESEARCH; HEURISTIC METHODS; NETWORK PROTOCOLS; QUERY LANGUAGES; RESOURCE ALLOCATION; ROUTERS; TOPOLOGY;

DISTRIBUTED HASH TABLES (DHT); NODES;

BUFFER STORAGE;

EID: 0842267583     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. M. Castro, P. Druschel, Y. Hu, and A. Rowstron. Exploiting Network Proximity in Peer-to-Peer Overalay Networks, Technical Report MSRTR-2002-82, 2002.
2. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In ACM SIGCOMM'02 Conference, 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. E. Gerich. Guidelines for Management of IP Address Space, RFC 1466, IETF, May 1993.
5. Gnutella. http://gnutella.wego.com/.
6. Theodore Hong. Performance. In Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O'Reilly, 2001.
7. http://www.iana.org/assignments/ipv4-addressspace.
8. K. Hubbard, M. Kosters, D. Conrad, D. Karrenberg, and J. Postel. Internet Registry IP Allocation Guidelines., RFC 2050, EETF, November 1996.
9. Frank Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
10. Napster. http://www.napster.com/.
11. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing Nearby Copies of Replicated Objects in a Distributed Environment. Theory of Computing Systems, 32:241-280, 1999.
12. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of the 2001 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 247-254, San Diego, CA, August 2001.
13. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-Aware Overlay Construction and Server Selection. In Proceedings of IEEE INFOCOM 2002, New Yourk, NY, June 2002.
14. 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.
15. 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 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 247-254, San Diego, CA, August 2001.
16. 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.
17. S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), San Jose, CA, USA, January 2002.
18. S. Sen and J. Wang. Analyzing Peer-to-Peer Traffic Across Large Networks. ACM Transactions on Networking, To appear.
19. 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 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 149-160, San Diego, CA, August 2001.
20. 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.
21. E. Zegura, K. Calvert, and S. Bhattacharjee. How to Model an Internetwork. In Proceedings of IEEE INFOCOM 1996, March 1996.
22. D. Zeinalipour-Yazti and T. Folias. Quantitative Analysis of the Gnutella Network Traffic, Technical Report, Department of Computer Science, University of California at Riverside, June 2002.
23. 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.
24. 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.