SOME ISSUES IN DISTRIBUTED ASYNCHRONOUS ROUTING IN VIRTUAL CIRCUIT DATA NETWORKS.

Wei K. Tsai, John N. Tsitsiklis, Dimitri P. Bertsekas

Research output: Contribution to journalConference articlepeer-review

3 Scopus citations

Abstract

The authors consider the behavior of distributed asynchronous routing algorithms for optimizing the flows in a virtual circuit data network, with respect to a given convex cost function. The algorithms operate with minimal synchronization of computations and information exchange between different processors and consist of gradient projection iterations which compute a target set of flows for each path. The processors try to make the actual flows equal to the target flows, by appropriately assigning paths to incoming, new virtual circuits. The authors concentrate on the many-small-users case, in which there is (on the average) a very large number of virtual circuits, each one requiring a small communication rate. The authors addresses the limiting behavior when the frequency of iteration becomes infinite relative to the frequency of information exchange between nodes.

Original languageEnglish (US)
Pages (from-to)1335-1337
Number of pages3
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
StatePublished - 1986
Externally publishedYes

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'SOME ISSUES IN DISTRIBUTED ASYNCHRONOUS ROUTING IN VIRTUAL CIRCUIT DATA NETWORKS.'. Together they form a unique fingerprint.

Cite this