Asymptotic optimality of shortest path routing algorithms

Many communication networks use adaptive shortest path routing. By this we mean that each network link is periodically assigned a length that depends on its congestion level during the preceding period, and all traffic generated between length updates is routed along a shortest path corresponding to the latest link lengths. We show that in certain situations, typical of networks involving a large number of small users and utilizing virtual circuits, this routing method performs optimally in an asymptotic sense. In other cases, shortest path routing can be far from optimal.

[1]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[2]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[3]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[4]  T. Stern,et al.  A Class of Decentralized Routing Algorithms Using Relaxation , 1977, IEEE Trans. Commun..

[5]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[6]  I. Richer,et al.  A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..

[7]  Adrian Segall,et al.  AN OPTIMAL CONTROL APPROACH TO DYNAMIC ROUTING IN DATA COMMUNICATION NETWORKS , 1978 .

[8]  Dimitri Bertsekas.  Dynamic models of shortest path routing algorithms for communication networks with multiple destinations , 1979, 1979 18th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[9]  Adrian Segall,et al.  Optimal Distributed Routing for Virtual Line-Switched Data Networks , 1979, IEEE Trans. Commun..

[10]  J.K. Wolf,et al.  Computer-communication network design and analysis , 1979, Proceedings of the IEEE.

[11]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[12]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[13]  Dimitri P. Bertsekas,et al.  Optimal routing and flow control methods for communication networks , 1982 .

[14]  A. Segall,et al.  An optimal control approach to dynamic routing in networks , 1982 .

[15]  Bruce E. Hajek,et al.  Optimal dynamic routing in communication networks with continuous traffic , 1982, 1982 21st IEEE Conference on Decision and Control.

[16]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .

[17]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[18]  D. Bertsekas,et al.  Path assignment for virtual circuit routing , 1983, SIGCOMM.

[19]  Dimitri P. Bertsekas,et al.  Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks , 1984, IEEE Trans. Commun..

[20]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .