Static and Dynamic Low-Congested Interval Routing Schemes

Interval routing schemes (IRS) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have practical applications, as they have been implemented with wormhole routing in the last generation of INMOS transputer router chips. In this paper we consider IRS that are optimal with respect to the congestion of the induced path system. In fact, wormhole routing is strongly influenced by the maximum number of paths that share a physical link and from low to moderate congestion it outperforms the packet switching technique. We provide a general framework able to deal with the various congestion issues in IRS. In fact, we will distinguish between static cases, in which the source–destination configurations are fixed, and dynamic cases, where they vary over time. All these situations can be handled in a unified setting, thanks to the notion of competitiveness introduced in this paper. We first give some general results not related to specific trafic demands. Then, in the one-to-all communication pattern, we show that constructing competitive IRS for a given network is an intractable problem, both for the static and the dynamic case, that is when the root vertex is fixed and when it can change along the time, respectively. Finally, both for one-to-all and all-to-all communication patterns, we provide nicely compet- itive k-IRS for relevant topologies. Networks considered are chains, trees, rings, chordal rings and multi-dimensional grids and tori. We consider both the directed congestion case, in which there are pairwise opposite unidirec- tional links connecting two neighbor processors, and the undirected congestion case, in which two neighbors are connected by a single bi-directional link.