An exact root-free method for the expected queue length for a class of discrete-time queueing systems

DOI10.1007/S11134-019-09614-1MaRDI QIDQ2284388zbMATH OpenOpenAlexFDO

Authors A. Al Hanbali, Richard J. Boucherie, A. I. Oblakova, Jan-Kees van Ommeren, W. H. M. Zijm

Publication date 15 January 2020

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11134-019-09614-1

zbMATH Keywords

bulk-service queuecontour integralsfixed-cycle traffic-light modelroots

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Analytic computation schemes for the discrete-time bulk service queue
• Pollaczek contour integrals for the fixed-cycle traffic-light queue
• Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
• Practical methods for queue length behaviour for bulk service queues of the form \(M/G^{0,C}/1\) and \(M(t)/G^{0,C}/1\)
• The Bulk Service Queue with a General Control Strategy: Theoretical Analysis and a New Computational Procedure

Cites work

• A solution to the fixed-cycle traffic light problem for compound Poisson arrivals
• Analytic computation schemes for the discrete-time bulk service queue
• Back to the roots of the M/D/s queue and the works of Erlang, Crommelin and Pollaczek
• Fundamentals of matrix-analytic methods
• scientific article; zbMATH DE number 1930503 (Why is no real title available?)
• scientific article; zbMATH DE number 3088542 (Why is no real title available?)
• Matrix-analytic methods in queueing theory
• On the application of Rouché's theorem in queueing theory
• On the Traffic-light Queue
• Pollaczek contour integrals for the fixed-cycle traffic-light queue
• Pseudo-conservation laws in cyclic-service systems
• The discrete-time single-server queue
• Time-limited polling systems with batch arrivals and~phase-type service times

Cited in

(4)

• Pollaczek contour integrals for the fixed-cycle traffic-light queue
• Analytic computation schemes for the discrete-time bulk service queue
• Analysis of \(D\)-\(BMAP/G/1\) queueing system under \(N\)-policy and its cost optimization
• Roots, symmetry, and contour integrals in queuing-type systems

This page was built for publication: An exact root-free method for the expected queue length for a class of discrete-time queueing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284388)