Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker  Home/Search
Context Related
| icir.org/sylvia/infocom02.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: icir.org/sylvia/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the application-level connectivity between the nodes in these networks is congruent with the underlying IP-level topology. Similarly, in the case of replicated web content, client nodes could use topological information in selecting one of... (Update)
Similar documents based on text: More All
0.9: Topologically-Aware Overlay Construction and Server.. - Ratnasamy, Handley.. (2002) (Correct)
0.5: A Scalable Content-Addressable Network - Ratnasamy, Francis, Handley.. (2001) (Correct)
0.4: Application-Level Multicast Using Content-Addressable.. - Ratnasamy, Handley.. (2001) (Correct)
BibTeX entry: (Update)
S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, "Topologicallyaware overlay construction and server selection," in Proceedings of IEEE INFOCOM'02, New York, NY, June 2002. http://citeseer.ist.psu.edu/ratnasamy02topologicallyaware.html More
@misc{ ratnasamy02topologicallyaware,
author = "S. Ratnasamy and M. Handley and R. Karp and S. Shenker",
title = "Topologicallyaware overlay construction and server selection",
text = "S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, Topologicallyaware overlay
construction and server selection, in Proceedings of IEEE INFOCOM'02, New
York, NY, June 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/ratnasamy02topologicallyaware.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garrey, Johnson - 1979
1225 Chord: A scalable peer-to-peer lookup service for internet a.. - Stoica, Morris et al. - 2001
1023 A Scalable Content-Addressable Network - Ratnasamy, Francis et al. - 2001
458 Tapestry: An infrastructure for fault-tolerant wide-area loc.. - Zhao, Kubiatowicz et al. - 2001
449 Oceanstore: An Architecture for Global-scale Persistent Stor.. - Kubiatowicz - 2000
402 A case for end system multicast - Chu, Rao et al. - 2000
375 On Power-law Relationships of the Internet Topology - Faloutsos, Faloutsos et al. - 1999
344 How to Model an Internetwork - Zegura, Calvert et al. - 1996
125 Enabling conferencing applications on the internet using an .. - Chu, Rao et al. - 2001
106 Locating nearby copies of replicated internet servers - Guyton, Schwartz - 1995
105 Predicting Internet network distance with coordiantes-based .. - Ng, Zhang - 2001
104 A random graph model for massive graphs - Aiello, Chung et al. - 2000
104 Pastry: Scalable, distributed object location and routing fo.. - Rowstron, Druschel - 2001
99 A novel server selection technique for improving the respons.. - Fei, Bhattacharjee et al. - 1998
87 An Architecture for a Global Internet Host Distance Estimati.. - Francis - 1999
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.icir.org/sylvia/): More
Can Heterogeneity Make Gnutella Scalable? - Lv, Ratnasamy, Shenker (Correct)
Application-Level Multicast Using Content-Addressable.. - Ratnasamy, Handley.. (2001) (Correct)
A Scalable Content-Addressable Network - Ratnasamy, Francis, Handley.. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC