Abstract

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