Citation Context

...en a key, it maps the key onto a node. Depending on the application using Chord, that node might be responsible for storing a value associated with the key. Chord uses a variant of consistent hashing =-=[11]-=- to assign keys to Chord nodes. Consistent hashing tends to balance load, since each node receives roughly the same number of keys, £ University of California, Berkeley. istoica@cs.berkeley.edu Ý Auth...

Citation Context

..., load balance is hard to achieve as the content of each cache depends heavily on the query pattern. Cache Resolver [30], like CFS, uses consistent hashing to evenly map stored data among the servers =-=[12, 14]-=-. However, Cache Resolver assumes that clients know the entire set of servers; maintaining an up-to-date server list is likely to be difficult in a large peer-to-peer system where servers join and dep...

Citation Context

...peration: given a key, it maps the key onto a node. Depending on the application using Chord, that node might be responsible for storing a value associated with the key. Chord uses consistent hashing =-=[12]-=- to assign keys to Chord nodes. Consistent hashing tends to balance load, since each node receives roughly the same number of keys, and requires relatively little movement of keys when nodes join and ...

Citation Context

...rarchy. Instead GLS allows a node X to select a set of location servers that, probabilistically, is unlike the set of servers selected by 52 Jinyang Li, John Jannotti, et al. other nodes and does not change drastically as nodes enter or leave the network. Nodes searching for X are able to find X’s location servers using no prior knowledge beyond node X’s ID. This is accomplished by carrying out much the same protocol that X used to select its servers in the first place. Our approach draws its intuition from Consistent Hashing, a technique developed to support hierarchical caching of web pages [12]. To avoid making a single node into the bottleneck of the hierarchical cache, that paper used a hash function to build a distinct hierarchy for each page, much as we use a distinct location service hierarchy for each target. Also like our paper, that paper used nested query radii to ensure that queries for a given page did not go to caches much farther away than the page itself. GLS balances the location server work evenly across all the nodes if there is a random distribution of node IDs across the network. GLS ensures that nodes are allocated unique, random IDs by using a strong hash functi...

Citation Context

...e to meet the requirements of these applications. Dynamo uses a synthesis of well known techniques to achieve scalability and availability: Data is partitioned and replicated using consistent hashing =-=[10]-=-, and consistency is facilitated by object versioning [12]. The consistency among replicas during updates is maintained by a quorum-like technique and a decentralized replica synchronization protocol....

Citation Context

...a group consists of selecting the best server and redirecting the client to that server. The details of the server selection algorithm are beyond the scope of this paper as considerable previous work =-=[3, 18]-=- exists in this area. Furthermore, Overcast's particular choices are constrained considerably by a desire to avoid changes at the client. Without such a constraint simpler choices could have been made...

Citation Context

...entally. This requires, the ability to dynamically partition the data over the set of nodes (i.e., storage hosts) in the cluster. Cassandra partitions data across the cluster using consistent hashing =-=[11]-=- but uses an order preserving hash function to do so. In consistent hashing the output range of a hash function is treated as a fixed circular space or “ring” (i.e. the largest hash value wraps around...

Citation Context

... table (DHT) [12], in which content is stored at an overlay node whose node ID is closest to the result of applying a collision-resistant hash function to that content’s name (i.e. consistent hashing =-=[15]-=-). Distributed hash tables have been used, for instance, in constructing the PAST [28] and CFS [8] distributed filesystems, the Overlook [33] scalable name service, the Squirrel [13] cooperative web c...