Routing algorithms in interval and circular-arc networks

A simple parallel algorithm is shown for routing messages between the nodes of a network whose underlying graph is an interval graph. Each node executing the algorithm makes purely local decisions about where to route the message it receives. The algorithm uses constant message length and shortest-path routing. A straightforward extension of the algorithm allows handling time-varying faults in the network. The algorithm is then extended to handle routing in circular-arc graphs, and similar results are obtained.<
>