Waiting times in classical priority queues via elementary lattice path counting

DOI10.1007/S11134-016-9498-6zbMath1386.90032OpenAlexW2406149818MaRDI QIDQ1691914

Lars A. van Vianen, Adriana F. Gabor, Jan-Kees C. W. van Ommeren

Publication date: 25 January 2018

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://repub.eur.nl/pub/80103/EI2016-17.pdf

zbMATH Keywords

waiting timeslattice pathspriority queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue ⋮ Delay analysis of a two-class priority queue with external arrivals and correlated arrivals from another node ⋮ A base-stock inventory model with service differentiation and response time guarantees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Storage capacity of a dam with gamma type inputs
• Walks in the quarter plane: Kreweras' algebraic model
• Lattice path counting and the theory of queues
• Priority Queues
• Priority assignment on a waiting line
• M/M/c Queue with Two Priority Classes
• Waiting Times in the Non-Preemptive Priority M/M/c Queue
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• The use of a ballot theorem in order statistics
• Waiting-Time Distribution of a Multi-Server, Priority Queuing System
• Combinatorial approach to M/M/1 queues using hypergeometric functions

This page was built for publication: Waiting times in classical priority queues via elementary lattice path counting