Distributed Asynchronous Optimal Routing in Data Networks

John N. Tsitsiklis, Dimitri P. Bertsekas

Research output: Contribution to journalArticlepeer-review

91 Scopus citations


In this paper we study the performance of a class of distributed optimal routing algorithms of the gradient projection type under weaker and more realistic assumptions than those considered thus far. In particular, we show convergence to an optimal routing without assuming synchronization of computation at all nodes and measurement of link lengths at all links, while taking into account the possibility of link flow transients caused by routing updates. This demonstrates the robustness of these algorithms in a realistic distributed operating environment.

Original languageEnglish (US)
Pages (from-to)325-332
Number of pages8
JournalIEEE Transactions on Automatic Control
Issue number4
StatePublished - Apr 1986
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Distributed Asynchronous Optimal Routing in Data Networks'. Together they form a unique fingerprint.

Cite this