Optimal Interval Routing for k-Caterpillars and Maximal Outerplanar Networks

G. S. Adhar (USA)


Routing, Network, Algorithms, Message Passing


In this paper we present optimum interval routing al gorithms for message passing networks that have topo logical structure defined by k-caterpillars and maximal outer planar graphs (MOPS). The routing algorithms are optimum in the sense that the route built between any source-destination pair is of minimum length and that the routing function executing at each node has time complexity which is linear in the size of the net work.

Important Links:

Go Back