Distributed Routing in Tree Networks with Few Landmarks

We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situated in a starting node, has to walk to a target node traversing a path of minimum length. All information about adjacencies is distributed to certain nodes called landmarks. We wish to minimize the total memory requirements as well as keep the memory requirements per landmark to reasonable levels. We propose a landmark selection and information distribution scheme with overall memory requirement linear in the number of nodes, and constant memory consumption per non-landmark node. We prove that a navigation algorithm using this scheme attains a constant stretch factor overhead in tree topologies, compared to an optimal landmark-based routing algorithm that obeys certain restrictions. The flexibility of our approach allows for various trade-offs, such as between the number of landmarks and the size of the regio...

• Type: Conference
• Year: 2006
• Where: CAAN
• Authors: Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis
• Keywords: CAAN 2006, Constant Memory Consumption, Discrete Geometry, Memory Requirement, Nodes Called Landmarks