Summary: Routing Strategies for Fast Networks \Lambda
Yossi Azar y Joseph (Seffi) Naor z Raphael Rom x
Modern fast packet switching networks 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 operation. 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: (i) bfs trees; and (ii)
shortest paths. We show that in both cases a balanced use of network resources
can be guaranteed.
Index terms: routing strategies, controlled flooding, network resources, load
balancing, shortest paths, bfs trees, conditional probabilities.
\Lambda Preliminary version of this paper appeared in the Proceedings of the 11th IEEE INFOCOM,
Florence, Italy, (1992), pp. 170179.