Waiting times in classical priority queues via elementary lattice path counting

Lars A. Vianen (), Adriana F. Gabor () and Jan-Kees Ommeren ()
Additional contact information
Lars A. Vianen: Erasmus School of Economics
Adriana F. Gabor: United Arab Emirates University
Jan-Kees Ommeren: University of Twente

Queueing Systems: Theory and Applications, 2016, vol. 84, issue 3, No 5, 295-307

Abstract: Abstract 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.

Keywords: Priority queues; Waiting times; Lattice paths; 90B22; 60K25; 68M20 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-016-9498-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:84:y:2016:i:3:d:10.1007_s11134-016-9498-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-016-9498-6

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().