Consistent hashing and random trees : algorithms for caching in distributed networks

Abstract

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.

Keywords

Computer scienceHash functionAlgorithmParallel computingConsistent hashingDistributed computingTheoretical computer scienceHash tableProgramming languageDouble hashing

Related Publications

Application-specific protocol architectures for wireless networks

Wendi Beth Heinzelman , Anantha P. Chandrakasan , Hari Balakrishnan

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.

2000 DSpace@MIT (Massachusetts Institute o... 1061 citations

Consistent hashing and random trees

David R. Karger , Eric Lehman , Tom Leighton +3 more

We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are parti...

1997 1929 citations

A scalable content-addressable network

Sylvia Ratnasamy , Paul Francis , Mark Handley +2 more

Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large ...

2001 6374 citations

Building peer-to-peer systems with chord, a distributed lookup service

Frank Dabek , Eric W. Brunskill , M. Frans Kaashoek +4 more

We argue that the core problem facing peer-to-peer Systems is locating documents in a decentralized network and propose Chord, a distributed lookup primitive. Chord provides an ...

2005 229 citations

Wide-area cooperative storage with CFS

Frank Dabek , M. Frans Kaashoek , David R. Karger +2 more

The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file stora...

2001 1434 citations

Publication Info

Year: 1998
Type: dissertation
Citations: 52
Access: Closed

External Links

Citation Metrics

OpenAlex

Cite This

APA Style

                            
                                    Daniel Lewin
                                
                            (1998). 
                            Consistent hashing and random trees : algorithms for caching in distributed networks. 
                            DSpace@MIT (Massachusetts Institute of Technology)
                            
                            .