The forwarding index of communication networks
IEEE Transactions on Information Theory
The Computer Journal
Computer networks
On forwarding indices of networks
Discrete Applied Mathematics
A trade-off between space and efficiency for routing tables
Journal of the ACM (JACM)
Efficient message routing in planar networks
SIAM Journal on Computing
Improved routing strategies with succinct tables
Journal of Algorithms
Complexity of the forwarding index problem
SIAM Journal on Discrete Mathematics
A characterization of networks supporting linear interval routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Discrete Applied Mathematics
Universal algorithms for store-and-forward and wormhole routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
Edge Congestion of Shortest Path Systems for All-to-All Communication
IEEE Transactions on Parallel and Distributed Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On Efficiency of Interval Routing Algorithms
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
The Complexity of Interval Routing on Random Graphs
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Static and Dynamic Low-Congested Interval Routing Schemes
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Multi-Label Linear Interval Routing Schemes (Extended Abstract)
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Hi-index | 5.23 |
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 traffic 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 competitive 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 unidirectional links connecting two neighbor processors, and the undirected congestion case, in which two neighbors are connected by a single bi-directional link.