Distributed asynchronous optimal routing in data networks
- 1 April 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 31 (4), 325-332
- https://doi.org/10.1109/tac.1986.1104261
Abstract
This paper we study asynchronous distributed iterativeoptimization algorithms in which each processor does n.ot need tocommunicate to each other processor at each time instance; also,processors may keep performing computations without having towait until they receive the messages that have been transmitted tothem; processors are allowed to remain idle some of the time;finally, some processors nay perform computations faster thanothers. Such algorithms can alleviate communication...Keywords
This publication has 11 references indexed in Scilit:
- Algorithms for nonlinear multicommodity network flow problemsPublished by Springer Nature ,2005
- Distributed asynchronous deterministic and stochastic gradient optimization algorithmsIEEE Transactions on Automatic Control, 1986
- Second Derivative Algorithms for Minimum Delay Distributed Routing in NetworksIEEE Transactions on Communications, 1984
- Projected Newton methods and optimization of multicommodity flowsIEEE Transactions on Automatic Control, 1983
- Distributed asynchronous computation of fixed pointsMathematical Programming, 1983
- Distributed dynamic programmingIEEE Transactions on Automatic Control, 1982
- Projection methods for variational inequalities with application to the traffic assignment problemPublished by Springer Nature ,1982
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- Routing Techniques Used in Computer Communication NetworksIEEE Transactions on Communications, 1980
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977