Recursive solution to a quorum queueing system

DOI10.1016/S0895-7177(01)00165-0MaRDI QIDQ1609465zbMATH OpenOpenAlexFDO

Authors L. Tadj, Chakib Tadj

Publication date 15 August 2002

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0895-7177(01)00165-0

zbMATH Keywords

bulk serviceM/G/1-queue

Mathematics Subject Classification ID

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

Review text

To determine the steady state probabilities of an M/G/1-queueing system with bulk service the authors approximate the limit of the transient probabilites and compute these recursively.

Cites work

• A queueing system with a fixed accumulation level, random server capacity and capacity dependent service time
• scientific article; zbMATH DE number 4119378 (Why is no real title available?)
• Markov chains with transition delta-matrix: Ergodicity conditions, invariant probability measures and applications
• Matrix analytic solution to a quorum queueing system
• Maximum entropy solution to a quorum queueing system
• The single server queue in discrete time‐numerical analysis I

Cited in

(2)

• Recursive Solutions for the Generalized Erlang Queueing Systems
• A preemptive discrete-time priority buffer system with partial buffer sharing

This page was built for publication: Recursive solution to a quorum queueing system

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