Waiting times in classical priority queues via elementary lattice path counting

Autor:	Jan-Kees van Ommeren, Lars van Vianen, Adriana F. Gabor
Přispěvatelé:	Stochastic Operations Research
Rok vydání:	2016
Předmět:	Waiting time Computer science Distributed computing 0211 other engineering and technologies non-preemptive priority 02 engineering and technology Management Science and Operations Research 01 natural sciences 010104 statistics & probability Multi-server queue IR-103346 Lattice (order) Applied mathematics MSC-68M20 EWI-27662 0101 mathematics Computer Science::Operating Systems MSC-60K25 MSC-90B22 021103 operations research Laplace transform Queue management system Stochastic process Response time Lattice path Computer Science Applications Computational Theory and Mathematics lattice-paths METIS-321691 Priority queue
Zdroj:	Queueing systems, 84(3), 295-307. Springer
ISSN:	1572-9443 0257-0130
Popis:	In this paper, we describe an elementary combinatorial approach for deriving the waiting and response time distributions in a few classical priority queueing models. By making use of lattice paths that are linked in a natural way to the stochastic processes analyzed, the proposed method offers new insights and complements the results previously obtained by inverting the associated Laplace transforms.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e4d9125f5506ecc918ae6c3be981d57 https://doi.org/10.1007/s11134-016-9498-6 Zobrazit plný text záznamu Full text from SpringerLink