@article{1c306879cd404d759c9bcf4de5cc5436,
title = "Routing strategies for fast networks",
abstract = "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.",
keywords = "Bfs trees, Conditional probabilities, Controlled flooding, Load balancing, Network resources, Routing strategies, Shortest paths",
author = "Yossi Azar and Joseph Naor and Raphael Rom",
note = "Funding Information: A preliminary version of this paper appeared in the Pro- ceedings of the 11th lEEE INFOCOM, Florence, Italy, 1992, pp. 170-179. We would like to thank Noga Alon for many helpful discussions on this paper and in particular for his help in analyzing the algorithm of Section 3.1. Most of this work was done while the first two authors were at the Computer Science Department of Stanford University and supported by contract ONR N00014-88-K-0166.",
year = "1996",
doi = "10.1109/12.485380",
language = "אנגלית",
volume = "45",
pages = "165--173",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "2",
}