The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages ...

We propose a class of algorithms for finding an optimal quasistatic routing in a communication network. The algorithms are based on Gallager's method (1].

These algorithms are well suited for centralized computation and virtual circuit networks but, in contrast with the ones of this paper, require global ...

Abstract: We propose a class of algorithms for finding an optimal quasistatic routing in a communication network. The algorithms are based on Gallagers method.

We propose a class of algorithms for finding an optimal quasistatic routing in a communication network. The algorithms are based on Gallager's.

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] ...

Second derivative algorithms for minimum delay distributed routing in networks. Author(s). Massachusetts Institute of Technology. Laboratory for Information ...

Second derivative algorithms for minimum delay distributed routing in networks. Description. by Dimitri P. Bertsekas, Eli M. Gafni, Robert G. Gallager ...

The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to -level of traffic input. These advantages ...

Abstract—We study a minimum delay routing problem in the context of distributed networks with and without partial load information.