Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

DOI10.1109/TCOM.1984.1096159MaRDI QIDQ3335695zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A distributed adaptive routing algorithm
• An optimal adaptive routing algorithm
• An optimal distributed routing algorithm
• An optimal distributed routing algorithm using dual decomposition techniques
• scientific article; zbMATH DE number 3922330

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335695)