The N-system with independent Poisson arrivals and exponential server-dependent service times under the first come first served and assign to the longest idle server policy has an explicit steady-state distribution. We scale the arrival rate and the number of servers simultaneously, and obtain the fluid and central limit approximation for the steady state. This is the first step toward exploring the many-server scaling limit behavior of general parallel service systems.
Bibliographical noteFunding Information:
Research supported in part by Israel Science Foundation Grants 711/09 and 286/13.
© 2017, The Author(s).
- Assign to the longest idle server
- Central limits
- First come first served
- Fluid limits
- Many-server scaling
ASJC Scopus subject areas
- Statistics and Probability
- Computer Science Applications
- Management Science and Operations Research
- Computational Theory and Mathematics