Optimal Distributed Routing for Virtual Line-Switched Data Networks

Adrian Segall

Research output: Contribution to journalArticlepeer-review

31 Scopus citations


An algorithm that provides minimum delay routing in a data communication network using virtual line-switching is presented. The algorithm uses distributed computation in the sense that the nodes of the network update their information in an orderly fashion based on messages received from their neighbors. Receipt of these messages also triggers the various steps of the update and rerouting, so that these operations are performed in appropriate sequencing. For stationary input requirements and fixed topology the algorithm reduces network delay at each step and provides loop-free routing in the network. The method also provides an algorithm for quasi-static routing, when the input flows are slowly changing.

Original languageEnglish
Pages (from-to)201-209
Number of pages9
JournalIEEE Transactions on Communications
Issue number1
StatePublished - Jan 1979
Externally publishedYes


Dive into the research topics of 'Optimal Distributed Routing for Virtual Line-Switched Data Networks'. Together they form a unique fingerprint.

Cite this