Optimal dynamic routing in Markov queueing networks

Keith W. Ross

doi:10.1016/0005-1098(86)90035-X

Optimal dynamic routing in Markov queueing networks

Keith W. Ross

Research output: Contribution to journal › Article › peer-review

Abstract

Markov decision theory is applied to general Markov queueing networks with finite buffer capacity. Existence of optimal dynamic routing policies is proved for the long-run average and infinite-horizon discounted cases. With the aid of a process that is equivalent to the state process, the subordinated process, fast algorithms are derived for locating an optimal routing policy. A numerical example is given and the application of the theory to computer communication networks is discussed.

Original language	English (US)
Pages (from-to)	367-370
Number of pages	4
Journal	Automatica
Volume	22
Issue number	3
DOIs	https://doi.org/10.1016/0005-1098(86)90035-X
State	Published - May 1986

Keywords

Markov processes
computer communication
dynamic programming
queueing control
traffic control

ASJC Scopus subject areas

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1016/0005-1098(86)90035-X

Cite this

@article{e0f3113d45f149689d46de068cbd519c,

title = "Optimal dynamic routing in Markov queueing networks",

abstract = "Markov decision theory is applied to general Markov queueing networks with finite buffer capacity. Existence of optimal dynamic routing policies is proved for the long-run average and infinite-horizon discounted cases. With the aid of a process that is equivalent to the state process, the subordinated process, fast algorithms are derived for locating an optimal routing policy. A numerical example is given and the application of the theory to computer communication networks is discussed.",

keywords = "Markov processes, computer communication, dynamic programming, queueing control, traffic control",

author = "Ross, {Keith W.}",

year = "1986",

month = may,

doi = "10.1016/0005-1098(86)90035-X",

language = "English (US)",

volume = "22",

pages = "367--370",

journal = "Automatica",

issn = "0005-1098",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - Optimal dynamic routing in Markov queueing networks

AU - Ross, Keith W.

PY - 1986/5

Y1 - 1986/5

N2 - Markov decision theory is applied to general Markov queueing networks with finite buffer capacity. Existence of optimal dynamic routing policies is proved for the long-run average and infinite-horizon discounted cases. With the aid of a process that is equivalent to the state process, the subordinated process, fast algorithms are derived for locating an optimal routing policy. A numerical example is given and the application of the theory to computer communication networks is discussed.

AB - Markov decision theory is applied to general Markov queueing networks with finite buffer capacity. Existence of optimal dynamic routing policies is proved for the long-run average and infinite-horizon discounted cases. With the aid of a process that is equivalent to the state process, the subordinated process, fast algorithms are derived for locating an optimal routing policy. A numerical example is given and the application of the theory to computer communication networks is discussed.

KW - Markov processes

KW - computer communication

KW - dynamic programming

KW - queueing control

KW - traffic control

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

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

U2 - 10.1016/0005-1098(86)90035-X

DO - 10.1016/0005-1098(86)90035-X

M3 - Article

AN - SCOPUS:0022720279

SN - 0005-1098

VL - 22

SP - 367

EP - 370

JO - Automatica

JF - Automatica

IS - 3

ER -

Optimal dynamic routing in Markov queueing networks

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this