Lattice path counting and the theory of queues

Walter Böhm

Lattice path counting and the theory of queues

Walter Böhm

Publication: Scientific journal › Journal article › peer-review

Abstract

In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like Ma/Mb/1 systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto-Hahn model or systems with preemptive priorities.

Original language	English
Pages (from-to)	2168 - 2183
Journal	Journal of Statistical Planning and Inference
Volume	140
Issue number	8
Publication status	Published - 1 Dec 2010

Cite this

@article{4253c7e44f1747758ddb9ced7cdd9e08,

title = "Lattice path counting and the theory of queues",

abstract = "In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like Ma/Mb/1 systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto-Hahn model or systems with preemptive priorities.",

author = "Walter B{\"o}hm",

year = "2010",

month = dec,

day = "1",

language = "English",

volume = "140",

pages = "2168 -- 2183",

journal = "Journal of Statistical Planning and Inference",

issn = "0378-3758",

publisher = "Elsevier B.V.",

number = "8",

}

TY - JOUR

T1 - Lattice path counting and the theory of queues

AU - Böhm, Walter

PY - 2010/12/1

Y1 - 2010/12/1

N2 - In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like Ma/Mb/1 systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto-Hahn model or systems with preemptive priorities.

AB - In this paper we will show how recent advances in the combinatorics of lattice paths can be applied to solve interesting and nontrivial problems in the theory of queues. The problems we discuss range from classical ones like Ma/Mb/1 systems to open tandem systems with and without global blocking and to queueing models that are related to random walks in a quarter plane like the Flatto-Hahn model or systems with preemptive priorities.

UR - http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0M-4Y6J3VF-6&_user=464393&_coverDate=08%2F31%2F2010&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1582107859&_rerunOrigin=google&_acct=C000022138&_version=1&_urlVersion=0&_userid=464393&md5=2864eb5a51ce38f9bfedaca9bcf24ab0&searchtype=a

M3 - Journal article

SN - 0378-3758

VL - 140

SP - 2168

EP - 2183

JO - Journal of Statistical Planning and Inference

JF - Journal of Statistical Planning and Inference

IS - 8

ER -

Lattice path counting and the theory of queues

Abstract

Other files and links

Cite this