On the distribution of the number of customers in the symmetric M/G/1 queue

DOI10.1007/s11134-006-0298-2zbMath1104.60054OpenAlexW2132663705MaRDI QIDQ855176

Artëm Sapozhnikov, Denis Denisov

Publication date: 4 January 2007

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

Full work available at URL: https://research.tue.nl/nl/publications/40418d4e-3cb4-4921-b49e-05b1d7e41f52

zbMATH Keywords

InsensitivityLast come first served queueProcessor-sharing queueSymmetric queueTime-dependent analysis

Mathematics Subject Classification ID

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

Related Items (3)

Time-dependent properties of symmetric queues ⋮ A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues ⋮ When random-order-of-service outperforms first-come-first-served

Cites Work

• The M/G/1 processor-sharing model: Transient behavior
• Some Time-Dependent Properties of Symmetric M/G/1 Queues

This page was built for publication: On the distribution of the number of customers in the symmetric M/G/1 queue