Skip to main content
Conference Proceedings

Papillon: Greedy routing in rings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3724 LNCS 514-515
DOI: 10.1007/11561927_47
4Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We construct the first n-node degree-d ring-based network with worst-case GREEDY routes of length θ(log n/log d) hops. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Abraham, I., Malkhi, D., & Manku, G. S. (2005). Papillon: Greedy routing in rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3724 LNCS, pp. 514–515). https://doi.org/10.1007/11561927_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free