A weighted undirected network is Δ growth-bounded if the number of nodes at distance 2 r  around any given node is at most Δ times the number of nodes at distance  r  around the node. Given a weighted undirected network with arbitrary node names and e > 0, we present a routing scheme that routes along paths of stretch 1+e and uses with high probability only  O (1/e O (log Δ) log 5 n) bit routing tables per node.
['Ittai Abraham', 'Dahlia Malkhi']
Name independent routing for growth bounded networks