Skip to main content
Springer Nature Link
Log in

Papillon: Greedy Routing in Rings

  • Conference paper
Distributed Computing (DISC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3724))

Included in the following conference series:

Abstract

We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n / log d) hops.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Hebrew University of Jerusalem,  

    Ittai Abraham

  2. Hebrew University of Jerusalem and Microsoft Research,  

    Dahlia Malkhi

  3. Google,  

    Gurmeet Singh Manku

Authors
  1. Ittai Abraham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dahlia Malkhi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gurmeet Singh Manku
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS and University Paris Diderot,  

    Pierre Fraigniaud

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abraham, I., Malkhi, D., Manku, G.S. (2005). Papillon: Greedy Routing in Rings. In: Fraigniaud, P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561927_47

Download citation

  • DOI: https://doi.org/10.1007/11561927_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29163-3

  • Online ISBN: 978-3-540-32075-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics