Equivalence relations in the approximations for the \(M/G/s/s+r\) queue.

DOI10.1016/S0895-7177(00)00090-XzbMath1042.60540MaRDI QIDQ1597085

R. Smith

Publication date: 5 May 2002

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

Mathematics Subject Classification ID

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

Related Items (5)

A consistent diffusion approximation for finite-capacity multiserver queues ⋮ Multi-server, Finite Waiting Room,M/G/c/KOptimization Models ⋮ M/G/c/K PERFORMANCE MODELS IN MANUFACTURING AND SERVICE SYSTEMS ⋮ Capacity planning of a perinatal network with generalised loss network model with overflow ⋮ Optimal design and performance modelling of \(M/G/1/K\) queueing systems

Cites Work

• Unnamed Item
• Unnamed Item
• Comparison conjectures about the M/G/s queue
• Maximum entropy two-station cyclic queues with multiple general servers
• Numerical inversion of probability generating functions
• Approximation of the queue-length distribution of an M/GI/s queue by the basic equations
• Approximations for the steady-state probabilities in theM/G/cqueue
• Approximating the Mean Waiting Time in the GI/G/s Queue
• Approximations for the M/G/m Queue
• Approximations in finite-capacity multi-server queues by Poisson arrivals
• A Transform-Free Approximation for the Finite Capacity M/G/s Queue
• Complementary generating functions for theM^X/GI/1/kandGI/M^y/1/Kqueues and their application to the comparison of loss probabilities

This page was built for publication: Equivalence relations in the approximations for the \(M/G/s/s+r\) queue.