A decentralized algorithm for optimal routing in data-communication networks

JS Meditch, JC Mandojana - 1979 18th IEEE Conference on …, 1979 - ieeexplore.ieee.org
The goal coordination technique of optimization theory for large-scale systems is used to
develop a decentralized algorithm for optimal routing in data-communication networks. The …

[PDF][PDF] A unified theory of flow control and routing in data communication networks

SJ Golestaani - 1980 - dspace.mit.edu
ABSTRACT A joint flow control and routing (JFCR) strategy is proposed for store and
forward communication networks. The strategy is based on a convex optimization problem in …

Optimal dynamic routing in communication networks with continuous traffic

B Hajek, RG Ogier - Networks, 1984 - Wiley Online Library
New characterizations of optimal state‐dependent routing strategies are obtained for the
continuous traffic network model proposed by Segall for linear cost with unity weighting at …

Validation of algorithms for optimal routing of flow in networks

D Bertsekas, E Gafni, KS Vastola - 1978 IEEE Conference on …, 1979 - ieeexplore.ieee.org
This paper presents computational results relating to solution of convex multicommodity
network flow problems by using several recently developed optimization algorithms. These …

A class of optimal routing algorithms for communication networks

DP Bertsekas - NASA STI/Recon Technical Report N, 1980 - ui.adsabs.harvard.edu
This report describes an algorithm for minimum delay routing in a communication network.
During the algorithm each node maintains a list of paths along which it sends traffic to each …

Routing and flow control in high-speed wide-area networks

NF Maxemchuk, M El Zarki - Proceedings of the IEEE, 1990 - ieeexplore.ieee.org
The routing and flow control techniques developed for wide-area, local-area, and
metropolitan-area networks are surveyed. A classification that shows the characteristics that …

A new approach to performance-oriented flow control

K Bharath-Kumar, J Jaffe - IEEE Transactions on …, 1981 - ieeexplore.ieee.org
Flow control is proposed as a means of obtaining an" optimal tradeoff" between low delay
and high throughput in computer networks. Several versions of" optimal tradeoff" are defined …

Comments on" Optimization flow control. I. Basic algorithm and convergence"

A Karbowski - IEEE/ACM Transactions on Networking, 2003 - ieeexplore.ieee.org
The author comments on an error in Low and Lapsley's article (see ibid., vol. 7, p. 861-74,
Dec. 1999). Because of this error, the proof of the Theorem 2 presented in the article is …

Network flow

M Iri - System Modelling and Optimization: Proceedings of the …, 1996 - books.google.com
The research in this subject has now a long history and a large variety of related fields in
science, engineering and operations research, and is still developing fast, especially in its …

Routing procedures in communications networks-part i: Random procedures

R Prosser - IRE Transactions on Communications Systems, 1962 - ieeexplore.ieee.org
A study is made of possible routing procedures in military communications networks in order
to evaluate these procedures in terms of future tactical requirements. In Part I this study is …