Efficient Message Routing in Planar Networks
Greg N. Frederickson, Ravi Janardan · SIAM Journal on Computing · 1989
The problem of routing messages along near-shortest paths in a distributed network without using complete routing tables is considered. It is assumed that the nodes of the network can be assigned suitable short names at the time the network is established. Two space-efficient near-shortest-path routing schemes are given for the class of planar networks. Both schemes use the separator property of planar networks in assigning the node names and performing the routings. For an n-node network, the first scheme uses $O(\log n)$-bit names and a total of $O(n^{{4 / 3}} )$ items of routing information, each $O(\log n)$ bits long, to generate routings that are only three times longer than corresponding shortest routings in worst cases. For any constant $\epsilon ,0 < \epsilon < 1/3$, the second scheme achieves the better space bound of $O(n^{1 + \epsilon } )$ items, each $O(({1 / \epsilon })\log n)$ bits long, but at the expense of $O(({1 / \epsilon })\log n)$-bit node names and a worst-case bound of 7 on the routings.