Path assignment for virtual circuit routing

E. M. Gafni, D. P. Bertsekas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

We consider a network which routes on a virtual-circuit. Each virtual-circuit is associated with a session. Virtual-circuit is assigned to a session at the time the session is initiated. We address the dynamic case where new sessions arrive and old sessions terminate. We formulate an optimal control problem to deduce which virtual-circuit an incoming session will be assigned to. We then discuss various approximations to the problem and show that the heuristic rule, "route on the shortest marginal delay path", is close to optimal in an asymptotic sense.

Original languageEnglish (US)
Title of host publicationProceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983
PublisherAssociation for Computing Machinery, Inc
Pages21-25
Number of pages5
ISBN (Electronic)0897910893, 9780897910897
DOIs
StatePublished - Oct 8 1983
Externally publishedYes
Event1983 Symposium on Communications Architectures and Protocols, SIGCOMM 1983 - Austin, United States
Duration: Mar 8 1983Mar 9 1983

Publication series

NameProceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983

Conference

Conference1983 Symposium on Communications Architectures and Protocols, SIGCOMM 1983
CountryUnited States
CityAustin
Period3/8/833/9/83

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Path assignment for virtual circuit routing'. Together they form a unique fingerprint.

Cite this