Compact routing in chordal grids and other networks

Static routing based on routing tables is often used in distributed systems. Such a technique becomes inefficient when the network is big and when an update of the tables is necessary due to a change of the topology. Moreover, this technique is very sensitive to failures and, thus, not fault-tolerant. This paper proposes a routing method which reduces the space complexity and avoids the need of updating all the nodes in wireline networks when changes in the topology occur. Based on a certain labelling of the nodes, this method stores information on the routers, which do not depend on the topology, and is particularly efficient when the network reconfiguration consists of adding and removing nodes.