Dynamic behavior of shortest path routing algorithms for communication networks

• Published in: IEEE transactions on automatic control Vol. 27; no. 1; pp. 60 - 74
• Main Author: Bertsekas, D.
• Format: Journal Article
• Language: English
• Published: IEEE 01.02.1982
• Subjects: Adaptive algorithm; ARPANET; Communication networks; Computer networks; Convergence; Delay; Routing; Stability; Telecommunication traffic; Traffic control
• ISSN: 0018-9286
• DOI: 10.1109/TAC.1982.1102884

Several proposed routing algorithms for store and forward communication networks, including one currently in operation in the ARPANET route messages along shortest paths computed by using some set of link lengths. When these lengths depend on current traffic conditions as they must in an adaptive algorithm, dynamic behavior questions such as stability, convergence, and speed of convergence are of interest. This paper is the first attempt to analyze systematically these issues. It is shown that minimum queuing delay path algorithms tend to exhibit violent oscillatory behavior in the absence of a damping mechanism. The oscillations can be damped by means of several types of schemes two of which are analyzed in this paper. In the first scheme a constant bias is added to the queuing delay thereby providing a preference towards paths with a small number of links. In the second scheme the effects of several past routings are averaged as for example when the link lengths are computed and communicated asynchronously throughout the network.