Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change.

[1]  M..  Projected Newton Methods and Optimization of Multicommodity Flows , 2022 .

[2]  A. Goldstein.  Convex programming in Hilbert space , 1964 .

[3]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

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

[5]  Eli Gafni,et al.  Validation of algorithms for optimal routing of flow in networks , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[6]  Eliezer M. Gafni,et al.  Convergence of a routing algorithm , 1979 .

[7]  Kenneth Steven Vastola.  A Numerical Study of Two Measures of Delay for Network Routing. , 1979 .

[8]  Dimitri P. Bertsekas,et al.  Algorithms for Nonlinear Multicommodity Network Flow Problems , 1979 .

[9]  D. Bertsekas.  A class of optimal routing algorithms for communication networks , 1980 .

[10]  Robert G. Gallager,et al.  Flow Control and Routing Algorithms for Data Networks , 1980 .

[11]  Seyyed Jamaaloddin Golestaani,et al.  A unified theory of flow control and routing in data communication networks , 1980 .

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

[13]  Eliezer M. Gafni,et al.  The integration of routing and flow-control for voice and data in a computer communication network , 1982 .

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

[15]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

[16]  D. Bertsekas,et al.  Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation , 1984 .