Routing strategies for fast networks
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 170-179 vol.1
- https://doi.org/10.1109/infcom.1992.263551
Abstract
The authors examine routing strategies for fast packet switching networks based on flooding and predefined routes. The concern is to get both efficient routing and an even balanced use of network resources. They present efficient algorithms for assigning weights to edges in a controlled flooding scheme but show that the flooding scheme is not likely to yield a balanced use of the resources. Efficient algorithms are presented for choosing routes along breadth-first search trees and shortest paths. It is shown that in both cases a balanced use of network resources can be guaranteed.Keywords
This publication has 11 references indexed in Scilit:
- Routing by controlled flooding in communication networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Design of a broadcast packet switching networkIEEE Transactions on Communications, 1988
- Paris: An approach to integrated high‐speed private networksInternational Journal of Communication Systems, 1988
- Matching is as easy as matrix inversionCombinatorica, 1987
- The Routing Problem in Computer NetworksPublished by Springer Nature ,1986
- Computer communications: Milestones and propheciesIEEE Communications Magazine, 1984
- Routing Techniques Used in Computer Communication NetworksIEEE Transactions on Communications, 1980
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973