Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/the-expansion-and-mixing-time-of-skip-graphs-with-applications-ZafsHWUkpH
References (28)
-
I. Stoica, R. Morris, David Karger, M. Kaashoek, H. Balakrishnan (2001)
Chord: A scalable peer-to-peer lookup service for internet applications -
Valerie King, Scott Lewis, Jared Saia (2004)
On Algorithms for Choosing a Random Peer -
G. Manku, M. Naor, Udi Wieder (2004)
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks -
C. Gkantsidis, M. Mihail, A. Saberi (2004)
Random walks in peer-to-peer networksIEEE INFOCOM 2004, 1
-
Ben Zhao, J. Kubiatowicz, A. Joseph (2001)
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and -
N. Alon (1986)
Eigenvalues and expandersCombinatorica, 6
-
B. Loo, Ryan Huebsch, I. Stoica, J. Hellerstein (2004)
The Case for a Hybrid P2P Search Infrastructure -
J. Friedman (2003)
A proof of alon's second eigenvalue conjecture -
A. Rowstron, P. Druschel (2001)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems -
B. Bollobás (2015)
The Probabilistic MethodFundamentals of Ramsey Theory
-
Valerie King, Scott Lewis, Jared Saia, Maxwell Young (2007)
Choosing a Random Peer in ChordAlgorithmica, 49
-
N. Alon, V. Milman (1985)
il , , lsoperimetric Inequalities for Graphs , and Superconcentrators -
M. Naor, Udi Wieder (2003)
Novel architectures for P2P applications: the continuous-discrete approach -
Valerie King, Jared Saia (2004)
Choosing a random peer -
K. Zatloukal, Nicholas Harvey (2004)
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time -
M. Naor, Udi Wieder (2003)
A Simple Fault Tolerant Distributed Hash Table -
L. Lovász (2001)
Random Walks on Graphs: A Survey -
James Aspnes -
D. Gillman (1993)
A Chernoff bound for random walks on expander graphsProceedings of 1993 IEEE 34th Annual Foundations of Computer Science
-
J. Aspnes, J. Kirsch, A. Krishnamurthy (2004)
Load balancing and locality in range-queriable data structures -
G. Manku (2003)
Routing networks for distributed hash tables -
J. Aspnes, Gauri Shah (2003)
Skip graphsACM Transactions on Algorithms (TALG), 3
-
M. Ajtai, J. Komlos, E. Szemerédi (1987)
Deterministic simulation in LOGSPACEProceedings of the nineteenth annual ACM symposium on Theory of computing
-
Mayank Bawa, Prabhakar Raghavan (2003)
Proceedings of Usits '03: 4th Usenix Symposium on Internet Technologies and Systems Symphony: Distributed Hashing in a Small World -
David Karger, M. Ruhl (2004)
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer SystemsTheory of Computing Systems, 39
-
(1973)
Explicit constructions of concentrators -
Ching Law, Kai-Yeung Siu (2003)
Distributed construction of random expander graphs -
Ben Zhao, J. Kubiatowicz, A. Joseph (2001)
An Infrastructure for Fault-tolerant Wide-area Location and Routing
- Publisher
- Springer Journals
- Copyright
- Copyright © 2008 by Springer-Verlag
- Subject
- Computer Science; Theory of Computation ; Software Engineering/Programming and Operating Systems ; Computer Systems Organization and Communication Networks; Computer Hardware ; Computer Communication Networks
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-008-0071-3
- Publisher site
- See Article on Publisher Site
Abstract
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph and estimate the quality of the expansion via simulations. As a consequence, skip graphs contain a large connected component even after an adversarial deletion of nodes. We show how the expansion property can be used to sample a node in the skip graph in a highly efficient manner. We also show that the expansion property can be used to load balance the skip graph quickly. Finally, it is shown that the skip graph could serve as an unstructured P2P system, making it a good candidate for a hybrid P2P system.
Journal
Distributed Computing – Springer Journals
Published: Oct 2, 2008