Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

DOI10.1109/TCOM.1984.1096159zbMath0544.94029OpenAlexW2159049132MaRDI QIDQ3335695

Robert G. Gallager, Dimitri P. Bertsekas, Eli Gafni

Publication date: 1984

Published in: IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcom.1984.1096159

zbMATH Keywords

algorithmsminimum delay routingquasi-static routing in a communication network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Related Items (9)

A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network ⋮ A modified gradient projection algorithm for solving the elastic demand traffic assignment problem ⋮ On a class of approximations for closed queueing networks ⋮ Telecommunications network design: Technology impacts and future directions ⋮ An alternating direction method of multipliers for solving user equilibrium problem ⋮ Solving the combined modal split and traffic assignment problem with two types of transit impedance function ⋮ On the average idle time and average queue length estimates in an \(M/M/1\) queue ⋮ New formulations and solution procedures for the hop constrained network design problem. ⋮ Effect of model uncertainty on some optimal routing problems

This page was built for publication: Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks