Routing with improved communication-space trade-off

Abstract

Given a weighted undirected network with arbitrary node names, we present a family of routing schemes characterized by an integral parameter κ ≥ 1. The scheme uses O ̃(n1/κ log D)space routing table at each node, and routes along paths of linear stretch O(κ), where D is the normalized diameter of the network. When D is polynomial in n, the scheme has asymptotically optimal stretch factor. With the same memory bound, the best previous results obtained stretch O(κ2). Of independent interest, we also construct a single-source nameindependent routing scheme for uniform weighted graphs with O(1) stretch and Õ (l) bits of storage. With the same stretch, the best previous results obtained memory Õ(n 1/9). © Springer-Verlag 2004.