Topology-centric look-up service

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2816, Issue , 2003, Pages 58-69

  Garces Erice L ^a   Ross, K W ^b   Biersack, E W ^a   Felber, P A ^a   Urvoy Keller, G ^a  

^a EURECOM   (France)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; TOPOLOGY;

EXPERIMENTAL EVALUATION; HIERARCHICAL GROUPINGS; IP ROUTING; LOOKUP SERVICES; LOOKUPS; SHORTEST PATH; STRUCTURED PEER-TO-PEER NETWORKS;

PEER TO PEER NETWORKS;

EID: 35248826869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39405-1_6     Document Type: Article

References (23)

1. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. ACM SIGCOMM, 2001.
2. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM, 2001.
3. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Germany, 2001.
4. B.Y. Zhao, J. Kubiatowicz, and A.D. Joseph, "Tapestry: An infrastructure for fault-tolerant wide-area location and routing," Tech. Rep., Computer Science Division, University of California, Berkeley, 2001.
5. S. Shenker, S. Ratnasamy, M. Handley, and R. Karp, "Topologically-aware overlay construction and server selection," in Proc. Infocom, New York, 2002.
6. M. Castro, P. Druschel, Y.C. Hu, and A. Rowstron, "Topology-aware routing in structured peer-to-peer overlay networks," Tech. Rep., Microsoft Research, 2002.
7. A.D. Joseph, B.Y. Zhao, Y. Duan, L. Huang, and J.D. Kubiatowicz, "Brocade: Landmark routing on overlay networks," in Proc. IPTPS'02, (Cambridge, MA), 2002.
8. M. Waldvogel and R. Rinaldi, "Efficient topology-aware overlay network," in Proceedings of HotNets-I, 2002.
9. E. Ng and H. Zhang, "Predicting internet network distance with coordinates-based approaches," in Proc. Infocom, 2002.
10. H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin, "The impact of routing policy on internet paths," in Proc. Infocom, 2001.
11. M. Freedman and D. Mazieres, "Sloppy hashing and self-organizing clusters," in Proc. IPTPS'03, 2003.
12. B. Krishnamurthy, J. Wang, and Y. Xie, "Early measurements of a cluster-based architecture for P2P systems," in ACM SIGCOMM Internet Measurement Workshop, San Francisco, 2001.
13. B. Krisnamurthy and J. Wang, "On network-aware clustering of web sites," in Proc. SIGCOMM, 2000.
14. J. Wang, Network Aware Client Clustering and Applications. PhD thesis, Cornell University, 2001.
15. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer informatic system based on the XOR metric," in Proc. IPTPS'02, (Cambridge, MA), 2002.
16. J. Kangasharju and K. W. Ross, "Adaptive replication and replacement strategies for P2P caching," Tech. Rep., 2002.
17. "http://rv-archive.uoregon.edu/" Oregon University "Route Views" archive.
18. "http://www.merit.edu/∼ipma/routing_table/" Merit Network.
19. "http://www.castify.net" Castify Networks.
20. "http://www.ripe.net/db/whois/whois.html" Whois service at RIPE.
21. "http://moat.nlanr.net/ipaddrocc/" NLANR.
22. "http://www.traceroute.org" Traceroute site.
23. K. P. Gummadi, S. Saroiu, and S. D. Gribble, "King: Estimating latency between arbitrary internet end hosts.," in Proc. 2nd Internet Measurement Workshop, (Marseille, France), 2002.