Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
|
Authors:
|
David Karger
|
Laboratory for Computer Science, MIT, Cambridge, MA
|
|
|
Eric Lehman
|
Laboratory for Computer Science, MIT, Cambridge, MA
|
|
|
Tom Leighton
|
Laboratory for Computer Science, MIT, Cambridge, MA and Department of Mathematics, MIT, Cambridge, MA
|
|
|
Rina Panigrahy
|
Laboratory for Computer Science, MIT, Cambridge, MA
|
|
|
Matthew Levine
|
Laboratory for Computer Science, MIT, Cambridge, MA
|
|
|
Daniel Lewin
|
Laboratory for Computer Science, MIT, Cambridge, MA
|
|
|
1997 Article
|
Bibliometrics
|
· Citation Count: 423
· Downloads (cumulative): 7,595
· Downloads (12 Months): 561
· Downloads (6 Weeks): 63
|
|
| Published in: |
| · Proceeding |
|
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
|
Pages 654-663
El Paso, Texas, USA — May 04 - 06, 1997
ACM New York, NY, USA ©1997
table of contents
ISBN:0-89791-888-6
doi>10.1145/258533.258660
|
|
powered by
|
|