Sciweavers

Share
APPINF
2003

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

8 years 7 months ago
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
Gur Saran Adhar
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where APPINF
Authors Gur Saran Adhar
Comments (0)
books