Computing Loss Probabilities in Discrete-Time Queues

DOI10.1287/OPRE.46.1.149zbMath0979.90017OpenAlexW1974802465MaRDI QIDQ2770076

Frank N. Gouweleeuw, Henk C. Tijms

Publication date: 7 February 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.46.1.149

zbMATH Keywords

discrete-time queueingloss probabilityfinite-buffer queues

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22)

Related Items (3)

Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues ⋮ A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline ⋮ Loss probability in an overloaded discrete-time \(GI/G/1/K\) system with very large \(K\).

This page was built for publication: Computing Loss Probabilities in Discrete-Time Queues