Many-server scaling of the N-system under FCFS–ALIS

Dongyuan Zhan, Gideon Weiss

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)27-71
Number of pages45
JournalQueueing Systems
Issue number1-2
StatePublished - 1 Feb 2018

Bibliographical note

Publisher Copyright:
© 2017, The Author(s).


  • Assign to the longest idle server
  • Central limits
  • First come first served
  • Fluid limits
  • Many-server scaling
  • N-system

ASJC Scopus subject areas

  • Statistics and Probability
  • Computer Science Applications
  • Management Science and Operations Research
  • Computational Theory and Mathematics


Dive into the research topics of 'Many-server scaling of the N-system under FCFS–ALIS'. Together they form a unique fingerprint.

Cite this