Resource title

Lattice path counting and the theory of queues

Resource image

image for OpenScout resource :: Lattice path counting and the theory of queues

Resource description

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 M^a/M^b/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´s abstract) ; Series: Research Report Series / Department of Statistics and Mathematics

Resource author

Walter Böhm

Resource publisher

Resource publish date

Resource language

en

Resource content type

application/pdf

Resource resource URL

http://epub.wu.ac.at/1086/1/document.pdf

Resource license

Adapt according to the license agreement. Always reference the original source and author.