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

DOI10.1007/S11134-006-0298-2MaRDI QIDQ855176zbMATH OpenOpenAlexFDO

Authors Denis E. Denisov, Artem Sapozhnikov

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

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

Recommendations

• Time-dependent properties of symmetric queues
• scientific article; zbMATH DE number 3996820
• Some Time-Dependent Properties of Symmetric M/G/1 Queues
• Symmetric queues served in cyclic order
• The sojourn-time distribution in the M/G/1 queue by processor sharing

Cites work

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

Cited in

(8)

• An M/G/1 queue with customer collection
• Some Time-Dependent Properties of Symmetric M/G/1 Queues
• Time-dependent properties of symmetric queues
• Symmetric queues served in cyclic order
• Server sharing with a limited number of service positions and symmetric queues
• Characterizations of equilibrium queue length distributions in M/GI/1 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

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

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