Name-independent compact routing in trees

Let G be a graph with nodes {0, . . . , n−1} and positive edge weights. The compact routing problem is to design sublinear-sized routing tables and functions so that when a packet labeled with destination t arrives at node i, i consults its local routing table, optionally rewrites the packet header, and then forwards the packet along an outgoing edge determined by the routing function. The routing scheme has stretch α if, for all nodes s and t in T , the route travelled by a packet between s and t is of weight at most α times the shortest distance between s and t. The objective in this work is to reduce the maximum space per node, rather than the total space in the network. When the node labels are assigned arbitrarily (or adversarially) to the nodes in the network, the compact routing scheme is name-independent; and if the labels are assigned by the routing scheme designer, possibly encoding some topologydependent information about the network, then the scheme is name-dependent. Recent papers on compact routing in the name independent model [3,2] have used ∗ Corresponding author. Email address: [email protected] (Kofi A. Laing). URL: http://www.cs.tufts.edu/~laing/ (Kofi A. Laing). 1 Supported in part by NSF grant EHR-0227879.