Path assignment for virtual circuit routing

E. M. Gafni; D. P. Bertsekas

doi:10.1145/1035237.1035245

Path assignment for virtual circuit routing

E. M. Gafni, D. P. Bertsekas

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 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 language	English (US)
Title of host publication	Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983
Publisher	Association for Computing Machinery, Inc
Pages	21-25
Number of pages	5
ISBN (Electronic)	0897910893, 9780897910897
DOIs	https://doi.org/10.1145/1035237.1035245
State	Published - Oct 8 1983
Externally published	Yes
Event	1983 Symposium on Communications Architectures and Protocols, SIGCOMM 1983 - Austin, United States Duration: Mar 8 1983 → Mar 9 1983

Publication series

Name	Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983

Conference

Conference	1983 Symposium on Communications Architectures and Protocols, SIGCOMM 1983
Country/Territory	United States
City	Austin
Period	3/8/83 → 3/9/83

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/1035237.1035245

Cite this

Path assignment for virtual circuit routing. / Gafni, E. M.; Bertsekas, D. P.
Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983. Association for Computing Machinery, Inc, 1983. p. 21-25 (Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gafni, EM & Bertsekas, DP 1983, Path assignment for virtual circuit routing. in Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983. Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983, Association for Computing Machinery, Inc, pp. 21-25, 1983 Symposium on Communications Architectures and Protocols, SIGCOMM 1983, Austin, United States, 3/8/83. https://doi.org/10.1145/1035237.1035245

@inproceedings{063f466621864bca8e463ce7b6dff1df,

title = "Path assignment for virtual circuit routing",

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.",

author = "Gafni, {E. M.} and Bertsekas, {D. P.}",

note = "Publisher Copyright: {\textcopyright} 1983 ACM.; 1983 Symposium on Communications Architectures and Protocols, SIGCOMM 1983 ; Conference date: 08-03-1983 Through 09-03-1983",

year = "1983",

month = oct,

day = "8",

doi = "10.1145/1035237.1035245",

language = "English (US)",

series = "Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983",

publisher = "Association for Computing Machinery, Inc",

pages = "21--25",

booktitle = "Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983",

}

TY - GEN

T1 - Path assignment for virtual circuit routing

AU - Gafni, E. M.

AU - Bertsekas, D. P.

PY - 1983/10/8

Y1 - 1983/10/8

N2 - 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.

AB - 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.

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

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

U2 - 10.1145/1035237.1035245

DO - 10.1145/1035237.1035245

M3 - Conference contribution

T3 - Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983

SP - 21

EP - 25

BT - Proceedings of the Symposium on Communications Architectures and Protocols, SIGCOMM 1983

PB - Association for Computing Machinery, Inc

T2 - 1983 Symposium on Communications Architectures and Protocols, SIGCOMM 1983

Y2 - 8 March 1983 through 9 March 1983

ER -

Path assignment for virtual circuit routing

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this