Papillon: Greedy Routing in Rings
- Ittai Abraham ,
- Dahlia Malkhi ,
- Gurmeet Manku
Brief Announcement in the 19th Intl. Symposium on Distributed Computing (DISC 05) |
We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n / log d) hops.