Skip to main content
SpringerLink
Log in

The expansion and mixing time of skip graphs with applications

  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ajtai, M., Komlós, J., Szemerédi, E.: Deterministic simulation in LOGSPACE. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC), pp. 132–140 (1987)

  2. Alon N., Milman V.: λ 1, isoperimetric inequalities for graphs and superconcentrators. J. Comb. Theory 38, 73–88 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aspnes, J., Shah, G.: Skip graphs. In: Fourteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 384–393 (2003)

  4. Chung, F.R.K.: Spectral graph theory. In: Regional Conference Series in Mathematics, vol. 92, pp. 1–212. American Mathematical Society (1997)

  5. Friedman, J.: A proof of Alon’s second eigenvalue conjecture. In: Proceedings of the Thirty-fifth ACM Symposium on Theory of Computing (STOC), pp. 720–724 (2003)

  6. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of IEEE INFOCOM (2004)

  7. Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: a scalable overlay network with practical locality properties. In: Proceedings of USITS, USENIX (2003)

  8. King, V., Lewis, S., Saia, J.: On algorithms for choosing a random peer (2005) (unpublished manuscript)

  9. King, V., Saia, J.: Choosing a random peer. In: Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 125–130 (2004)

  10. Law, C., Siu, K.-Y.: Distributed construction of random expander graphs. In: Proceedings of IEEE INFOCOM (2003)

  11. Loo, B.T., Huebsch, R., Stoica, I., Hellerstein, J.M.: The case for a hybrid P2P search infrastructure. In: 3rd International Workshop on Peer-to-Peer Systems (IPTPS), pp. 141–150 (2004)

  12. Lovász, L.: Random walks on graphs: a survey. In: Combinatorics, Paul Erdös is Eighty, vol. 2. Keszthely, Hungary, pp. 1–46 (1993)

  13. Manku, G.S.: Routing networks for distributed hash tables. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 133–142 (2003)

  14. Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 54–63 (2004)

  15. Margulis, G.A.: Explicit constructions of concentrators. Problemy Peredachi Informatsii, 9(4), October–December 1973

  16. Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 50–59 (2003)

  17. Naor, M., Wieder, U.: A simple fault tolerant distributed hash table. In: Second International Workshop on Peer-to-Peer Systems, pp. 88–97 (2003)

  18. Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proceedings of the 2001 ACM SIGCOMM Conference, pp. 149–160 (2001)

  19. Zatloukal, K.C., Harvey, N.J.A.: Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time. In: Fifteenth ACM SIAM Symposium on Discrete Algorithms (SODA), pp. 308–317 (2004)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University, New Haven, CT, USA

    James Aspnes

  2. Microsoft Research Silicon Valley, Mountain View, CA, USA

    Udi Wieder

Authors
  1. James Aspnes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Udi Wieder
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to James Aspnes.

Additional information

J. Aspnes was supported in part by NSF grants CCR-0098078, CNS-0305258, and CNS-0435201. The research described here was conducted while the second author was at the Weizmann Institute of Science.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aspnes, J., Wieder, U. The expansion and mixing time of skip graphs with applications. Distrib. Comput. 21, 385–393 (2009). https://doi.org/10.1007/s00446-008-0071-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-008-0071-3

Keywords

Search

Navigation