Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks

In this paper we present optimum interval routing algorithms for message passing networks that have topological 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 network. KEY WORDS Routing, Network, Algorithms, Message Passing

• Type: Conference
• Year: 2003
• Where: APPINF
• Authors: Gur Saran Adhar
• Keywords: APPINF 2003, Information Technology, Message Passing, Optimum Interval Routing, Routing Algorithms