Issue No.02 - February (1996 vol.45)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.485380
<p><b>Abstract</b>—Modern fast packet switching networks are being forced to rethink the routing schemes that are used in more traditional networks. The reexamination is necessitated because in these fast networks switches on the message's route can afford to make only minimal and simple operations. For example, examining a table of a size proportional to the network size is out of the question. In this paper we examine routing strategies for such networks based on flooding and predefined routes. Our concern is to get both efficient routing and an even (balanced) use of network resources. We 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. We then present efficient algorithms for choosing routes along: 1) bfs trees and 2) shortest paths. We show that in both cases a balanced use of network resources can be guaranteed.</p>
Routing strategies, controlled flooding, network resources, load balancing, shortest paths, bfs trees, conditional probabilities.
Yossi Azar, Joseph (Seffi) Naor, Raphael Rom, "Routing Strategies for Fast Networks", IEEE Transactions on Computers, vol.45, no. 2, pp. 165-173, February 1996, doi:10.1109/12.485380