Hui Zhang, Ashish Goel, Ramesh Govindan  Home/Search
Context Related
| usc.edu/~ramesh/papers/LPRS.ps.gz 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: usc.edu/~ramesh/papers/byyear (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale applications ranging from naming systems and le systems to application-layer multicast. DHT systems essentially build an overlay network, but a path on the overlay between any two nodes can be signi cantly di erent from the unicast path between those... (Update)
Similar documents based on text: More All
1.0: Incrementally Improving Lookup Latency in Distributed Hash .. - Zhang, Goel, Govindan (2003) (Correct)
0.4: The Design of A Distributed Rating Scheme for.. - Dutta, Goel, Govindan.. (2003) (Correct)
0.3: Optimal Self-Assembly of Counters at - Temperature Two Qi (Correct)
Related documents from co-citation: More All
12: distributed object location and routing for large-scale peer-to-peer systems (context) - Rowstron, Druschel et al. - 2001
10: Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaram et al. - 1997
9: Tapestry: A resilient global-scale overlay for service deployment - Zhao, Huang et al. - 2003
BibTeX entry: (Update)
A. Goal, H. Zhang, and R. Govindan. Incrementally improving lookup latency in distributed hash table systems. In ACM Sigmetrics, 2003. http://citeseer.ist.psu.edu/zhang03incrementally.html More
@misc{ goal03incrementally,
author = "A. Goal and H. Zhang and R. Govindan",
title = "Incrementally improving lookup latency in distributed hash table systems",
text = "A. Goal, H. Zhang, and R. Govindan. Incrementally improving lookup latency
in distributed hash table systems. In ACM Sigmetrics, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/zhang03incrementally.html" }
Citations (may not include all citations):477 Distributed Object Location and Routing for Large-scale Peer.. (context) - Rowstron, Druschel et al. - 2001
449 Oceanstore: An Architecture for Global-scale Persistent Stor.. - Kubiatowicz, Bindel et al. - 2000
396 Web Caching and Zipf-like Distribution: Evidence and Implica.. - Breslau, Cao et al. - 1999
375 On Power-law Relationships of the Internet Topology - Faloutsos, Faloutsos et al. - 1999
342 Wide-area Cooperative Storage with CFS - Dabek, Kasshoek et al. - 2001
283 Random Graphs (context) - Bollobas - 1985
282 Accessing Nearby Copies of Replicated Objects in A Distribut.. - Plaxton, Rajaraman et al. - 1997
166 Heuristics for Internet Map Discovery - Govindan, Tangmunarunkit - 2000
144 Internet Indirection Infrastructure - Stoica, Adkins et al. - 2002
144 Application-level Multicast Using Content-addressable Networ.. - Ratnasamy, Handley et al. - 2001
117 Measuring ISP Topologies with Rocketfuel - Spring, Mahajan et al. - 2002
117 Topologically-Aware Overlay Construction and Server Selectio.. - Ratnasamy, Handley et al. - 2002
115 Tapestry: An Infrastructure for Fault-resilient Wide-area Lo.. (context) - Zhao, Kubiatowicz et al. - 2001
105 Predicting Internet Network Distance with Coordinates-based .. - Eugene, Zhang - 2002
104 A Random Graph Model for Massive Graphs - Aiello, Chung et al. - 2000
98 SOS: Secure Overlay Services - Keromytis, Misra et al. - 2002
86 Scaling of Multicast Trees: Comments on the Chuang-Sirbu Sca.. - Phillips, Shenker et al. - 1999
79 Exploiting Network Proximity in Peer-to-Peer Overlay Network.. (context) - Castro, Druschel et al. - 2002
66 An Investigation of Geographic Mapping Techniques for Intern.. - Padmanabhan, Subramanian - 2001
53 Routing Algorithms for DHTs: Some Open Questions - Ratnasamy, Shenker et al. - 2002
43 Probabilistic Location and Routing - Rhea, Kubiatowicz - 2002
37 Finding Nearest Neighbors in Growth-restricted Metrics - Karger, Ruhl - 2002
29 Network Topology Generators: Degree-Based vs (context) - Tangmunarunkit, Govindan et al. - 2002
27 SQUIRREL: A Decentralized Peer-to-peer Web Cache - Iyer, Rowstron et al.
22 A Scalable Content-addressable Network (context) - Ratnaswamy, Francis et al. - 2001
15 Chord: A Peer-to-peer Lookup Service for Internet Applicatio.. (context) - Stoica, Morris et al. - 2001
15 Incrementally Improving Lookup Latency in Distributed Hash T.. - Zhang, Goel et al. - 2003
13 Scribe: The Design of A Large-scale Event Noti cation Infras.. (context) - Rowstron, Kermarrec et al. - 2001
4 Ecient Topology-Aware Overlay Network (context) - Waldvogel, Rinaldi - 2002
4 the First International Workshop on Peer-to-peer Systems (context) - Cox, Muthitacharoen et al. - 2002
http://pdos.lcs.mit.edu/cgi-bin/cvsweb.cgi/sfsnet/simulator
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs.usc.edu/~ramesh/papers/byyear.html): More
Multi-dimensional Range Queries in Sensor Networks - Xin Li Young (2003) (Correct)
The Design of A Distributed Rating Scheme for.. - Dutta, Goel, Govindan.. (2003) (Correct)
Directed Diffusion for Wireless Sensor Networking - Intanagonwiwat, Govindan.. (2003) (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