Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Fault diagnosis in a small constant number of parallel testing rounds
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Peer-to-peer systems for prefix search
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Brief announcement: deterministic skipnet
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Skip-webs: efficient distributed data structures for multi-dimensional data sets
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A linear time erasure-resilient code with nearly optimal recovery
IEEE Transactions on Information Theory - Part 1
SNet: skip graph based semantic web services discovery
Proceedings of the 2007 ACM symposium on Applied computing
NBDT: an efficient P2P indexing scheme for web service discovery
International Journal of Web Engineering and Technology
Efficient Content Authentication in Peer-to-Peer Networks
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
GRaSP: generalized range search in peer-to-peer networks
Proceedings of the 3rd international conference on Scalable information systems
Dynamic Web Service discovery architecture based on a novel peer based overlay network
Journal of Systems and Software
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Building an efficient P2P overlay for energy-level queries in sensor networks
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
A new result on [k, k + 1]-factors containing given hamiltonian cycles
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
| Hi-index | 0.00 |
We present a distributed data structure, which we call the rainbow skip graph. To our knowledge, this is the first peer-to-peer data structure that simultaneously achieves high fault-tolerance, constant-sized nodes, and fast update and query times for ordered data. It is a non-trivial adaptation of the SkipNet/skip-graph structures of Harvey et al. and Aspnes and Shah, so as to provide fault-tolerance as these structures do, but to do so using constant-sized nodes, as in the family tree structure of Zatloukal and Harvey. It supports successor queries on a set of n items using O(log n) messages with high probability, an improvement over the expected O(log n) messages of the family tree. Our structure achieves these results by using the following new constructs:• Rainbow connections: parallel sets of pointers between related components of nodes, so as to achieve good connectivity between "adjacent" components, using constant-sized nodes.• Hydra components: highly-connected, highly fault-tolerant components of constant-sized nodes, which will contain relatively large connected subcomponents even under the failure of a constant fraction of the nodes in the component.We further augment the hydra components in the rainbow skip graph by using erasure-resilient codes to ensure that any large subcomponent of nodes in a hydra component is sufficient to reconstruct all the data stored in that component. By carefully maintaining the size of related components and hydra components to be O(log n), we are able to achieve fast times for updates and queries in the rainbow skip graph. In addition, we show how to make the communication complexity for updates and queries be worst case, at the expense of more conceptual complexity and a slight degradation in the node congestion of the data structure.