Book ChapterDOI
Koorde: A Simple Degree-Optimal Distributed Hash Table.
M. Frans Kaashoek,David R. Karger +1 more
- Vol. 2735, pp 98-107
TLDR
Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs 2 that meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node.Abstract:Â
Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs 2. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n/log log n) hops per lookup request with O(log n) neighbors per node.read more
Citations
More filters
Journal ArticleDOI
Tapestry: a resilient global-scale overlay for service deployment
TL;DR: Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers, illustrating its utility as a deployment infrastructure.
Proceedings ArticleDOI
OverSim: A Flexible Overlay Network Simulation Framework
TL;DR: OverSim, a flexible overlay network simulation framework based on OMNeT++, is presented and it is shown that with OverSim simulations of overlay networks with up to 100,000 nodes are feasible.
Proceedings ArticleDOI
MAAN: a multi-attribute addressable network for grid information services
TL;DR: A Multi-Attribute Addressable Network (MAAN) that extends Chord to support multi-attribute and range queries and measured the performance of the implementation and the experimental results are consistent with the theoretical analysis.
Journal ArticleDOI
Survey of research towards robust peer-to-peer networks: search methods
J. Risson,Tim Moors +1 more
TL;DR: In this article, the authors present a survey of peer-to-peer (P2P) search methods, including simple key lookup, keyword lookup, information retrieval and data management, and early efforts to optimize range, multiattribute, join and aggregation queries over P2P indexes.
Proceedings ArticleDOI
Simple efficient load balancing algorithms for peer-to-peer systems
David R. Karger,Matthias Ruhl +1 more
TL;DR: Two new load-balancing protocols whose provable performance guarantees are within a constant factor of optimal are given, refine the consistent hashing data structure that underlies the Chord P2P network and give an optimal implementation of a distributed data structure for range searches on ordered data.
References
More filters
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Book ChapterDOI
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Proceedings ArticleDOI
A scalable content-addressable network
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Book ChapterDOI
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Petar Maymounkov,David Mazières +1 more
TL;DR: In this paper, the authors describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment, which routes queries and locates nodes using a novel XOR-based metric topology.
Proceedings ArticleDOI
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
TL;DR: 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, based on a special kind of hashing that is called consistent hashing.
Related Papers (5)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more