Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Asymptotic behavior of the expansion method for open finite queueing networks
Computers and Operations Research
Buffer space allocation in automated assembly lines
Operations Research
Taking Account of Correlations Between Streams in Queueing Network Approximations
Queueing Systems: Theory and Applications
An M/G/C/C state-dependent network simulation model
Computers and Operations Research
Service and capacity allocation in M/G/c/c state-dependent queueing networks
Computers and Operations Research
Isolation Method in a Network of Queues
IEEE Transactions on Software Engineering
Reversibility and Stochastic Networks
Reversibility and Stochastic Networks
Buffer allocation in general single-server queueing networks
Computers and Operations Research
Performance optimization of open zero-buffer multi-server queueing networks
Computers and Operations Research
End-node approach for pedestrian flow simulation
Proceedings of the Symposium on Simulation for Architecture & Urban Design
| Hi-index | 0.01 |
Congestion is ever present in most practical situations. We describe a methodology for approximate analysis of open state-dependent M/G/c/c queueing networks in which the service rate is subject to congestion, that is, it is a function of the number of customers in the system. Important performance measurements are easily computed with high accuracy, such as the blocking probability, throughput, expected number of customers in the system (known also as work-in-process), and expected waiting time. The methodology forms a basic building block useful in many practical applications and contexts. Computational results demonstrate that the methodology provides accurate results in many topological configurations as well as in the analysis of network evacuation problems in high-rise buildings.