DISTRIBUTED ASYNCHRONOUS OPTIMAL ROUTING IN DATA NETWORKS.

John N. Tsitsiklis; Dimitri P. Bertsekas

doi:10.1109/cdc.1984.272190

DISTRIBUTED ASYNCHRONOUS OPTIMAL ROUTING IN DATA NETWORKS.

John N. Tsitsiklis, Dimitri P. Bertsekas

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

The convergence of a distributed gradient projection method for optimal routing in a data communication network is proved. The analysis is carried out without any synchronization assumption and takes into account the possibility of transients caused by updates in the routing strategy being used.

Original language	English (US)
Pages (from-to)	1133-1138
Number of pages	6
Journal	Proceedings of the IEEE Conference on Decision and Control
DOIs	https://doi.org/10.1109/cdc.1984.272190
State	Published - 1984
Externally published	Yes

ASJC Scopus subject areas

Control and Systems Engineering
Modeling and Simulation
Control and Optimization

Access to Document

10.1109/cdc.1984.272190

Cite this

@article{7b630f78a0644667963ea520c86468fd,

title = "DISTRIBUTED ASYNCHRONOUS OPTIMAL ROUTING IN DATA NETWORKS.",

abstract = "The convergence of a distributed gradient projection method for optimal routing in a data communication network is proved. The analysis is carried out without any synchronization assumption and takes into account the possibility of transients caused by updates in the routing strategy being used.",

author = "Tsitsiklis, {John N.} and Bertsekas, {Dimitri P.}",

year = "1984",

doi = "10.1109/cdc.1984.272190",

language = "English (US)",

pages = "1133--1138",

journal = "Proceedings of the IEEE Conference on Decision and Control",

issn = "0191-2216",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - DISTRIBUTED ASYNCHRONOUS OPTIMAL ROUTING IN DATA NETWORKS.

AU - Tsitsiklis, John N.

AU - Bertsekas, Dimitri P.

PY - 1984

Y1 - 1984

N2 - The convergence of a distributed gradient projection method for optimal routing in a data communication network is proved. The analysis is carried out without any synchronization assumption and takes into account the possibility of transients caused by updates in the routing strategy being used.

AB - The convergence of a distributed gradient projection method for optimal routing in a data communication network is proved. The analysis is carried out without any synchronization assumption and takes into account the possibility of transients caused by updates in the routing strategy being used.

UR - http://www.scopus.com/inward/record.url?scp=0021641974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021641974&partnerID=8YFLogxK

U2 - 10.1109/cdc.1984.272190

DO - 10.1109/cdc.1984.272190

M3 - Conference article

AN - SCOPUS:0021641974

SN - 0191-2216

SP - 1133

EP - 1138

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

ER -

DISTRIBUTED ASYNCHRONOUS OPTIMAL ROUTING IN DATA NETWORKS.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this