David Karger, Eric Lehman, Tom Leighton, Mathhew Levine, Daniel Lewin, Rina Panigrahy  Home/Search
Context Related
Links: DBLP | mit.edu/~karger/Papers/web.ps.gz mit.edu/~djw/library...kargerweb.ps.gz ucsd.edu/~savage/cse291/p...Karger97.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: mit.edu/~mslevine/ (more) From: mit.edu/~djw/library/ Homepages: D.Karger |
Rate this article:      (best)Comment on this article |
Abstract: We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as... (Update)
Cited by: More
D1HT: A Distributed One Hop Hash Table - And (Correct)
Democratizing content publication with Coral - Michael Freedman Eric (2004) (Correct)
Heterogeneity and Load Balance - In Distributed Hash (Correct)
Similar documents (at the sentence level):
32.0%: Relieving Hot Spots on the World Wide Web - Panigrahy (1997) (Correct)
Active bibliography (related documents): More All
0.0: How to Select a Replication Protocol According to.. - Jimenez-Peris.. (2001) (Correct)
0.0: Probabilistic Quorum Systems - Malkhi, Reiter, Wright (1997) (Correct)
0.0: Geographic Quorum Systems Approximations - Paz Carmi Shlomi (2005) (Correct)
Similar documents based on text: More All
0.2: Approximating the Smallest Grammar: Kolmogorov.. - Charikar, Lehman, .. (2002) (Correct)
0.2: Monotonicity Testing over General Poset Domains.. - Fischer, Lehman.. (2002) (Correct)
0.0: Experimental Study of Minimum Cut Algorithms - Levine (1997) (Correct)
Related documents from co-citation: More All
54: Chord: A scalable peer-to-peer lookup service for Internet applications - Stoica, Morris et al. - 2001
50: A scalable content-addressable network - Ratnasamy, Francis et al. - 2001
32: Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz et al. - 2001
BibTeX entry: (Update)
D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 654--663, May 1997. http://citeseer.ist.psu.edu/karger97consistent.html More
@inproceedings{ karger97consistent,
author = "David Karger and Eric Lehman and Tom Leighton and Mathhew Levine and Daniel Lewin and Rina Panigrahy",
title = "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web",
booktitle = "{ACM} Symposium on Theory of Computing",
pages = "654-663",
month = may,
year = "1997",
url = "citeseer.ist.psu.edu/karger97consistent.html" }
Citations (may not include all citations):163 Efficient dispersal of Information for Security (context) - Rabin - 1989
127 Implementing Global Memory Management in a Workstation Clust.. - Feeley, Morgan et al. - 1995 ACM DBLP
75 A Hierarchical Internet Object Cache - Chankhunthod, Danzig et al. - 1996 DBLP
62 Making World Wide Web Caching Servers Cooperate (context) - Malpani, Lorch et al. - 1996
53 ChernoffHoeffding Bounds for Applications with Limited Indep.. - Schmidt, Siegel et al. - 1993
31 Design and Implementation of DDH: A Distributed Dynamic Hash.. - Devine - 1993
28 Information and Computation (context) - Peleg, Wool et al. - 1995 DBLP
26 ACM Transactions on Database Systems (context) - Litwin, Neimat et al. - 1996
22 and availability of quorum systems (context) - Naor, Wool et al. - 1994
16 Fast Fault-Tolerant Concurrent Access to Shared Objects - Plaxton, Rajaraman - 1996 ACM DBLP
2 Ching-Gung Liu and Lixia Zhang (context) - Floyd, Steen
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~mslevine/): More
Finding the Right Cutting Planes for the TSP - Levine (1999) (Correct)
Finding Maximum Flows in Undirected Graphs Seems Easier than.. - Karger, Levine (1997) (Correct)
Fast Randomized Algorithms for Computing Minimum {3,4,5,6}-Way Cuts - Levine (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