Zhan, D;
Weiss, G;
(2017)
Many-server scaling of the N-system under FCFS–ALIS.
Queueing Systems
, 88
, Article 27. 10.1007/s11134-017-9549-7.
Preview |
Text
10.1007_s11134-017-9549-7.pdf - Published Version Download (834kB) | Preview |
Abstract
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.
Type: | Article |
---|---|
Title: | Many-server scaling of the N-system under FCFS–ALIS |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1007/s11134-017-9549-7 |
Publisher version: | http://dx.doi.org/10.1007/s11134-017-9549-7 |
Language: | English |
Additional information: | © The Author(s) 2017. This article is an open access publication |
Keywords: | N-system, Many-server scaling, Fluid limits, Central limits, First come first served, Assign to the longest idle server |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > UCL School of Management |
URI: | https://discovery.ucl.ac.uk/id/eprint/10026107 |
Archive Staff Only
View Item |