Many Server Scaling of the N-System Under FCFS-ALIS
classification
🧮 math.PR
keywords
firstserverlimitmanyn-systemscalingservicestate
read the original abstract
The N-System with independent Poisson arrivals and exponential server-dependent service times under first come first served and assign to longest idle server policy has explicit steady state distribution. We scale the arrival and the number of servers simultaneously, and obtain the fluid and central limit approximation for the steady state. This is the first step towards exploring the many server scaling limit behavior of general parallel service systems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.