We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names are independent of the routing scheme. In this article, given any constant ∈ (0, 1) and an n-node edge-weighted network of doubling dimension α ∈ O(loglog n), we present -a (1+ )-stretch labeled compact routing scheme with log n -bit routing labels, O(log 2 n/ loglog n)-bit packet headers, and ( ( 1 ) O(α) log 3 n)-bit routing information at each node; -a (9 + )-stretch name-independent compact routing scheme with O(log 2 n/ loglog n)-bit packet headers, and ( ( 1 ) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n ( /60) 2 ) bits of storage at each node has stretch no less than 9− for any ∈ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter of the network. We also present a simpler nonscale-free (9 + )-stretch nameindependent compact routing scheme with improved space requirements if is polynomial in n.
Konjevod, Richa and Xia REF present a compact routing scheme for networks with low doubling dimension that also uses the Thorup and Zwick scheme for trees, where the labels have log n bits.
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension
TALG
Mathematics Computer Science