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

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Zhan, D., & Weiss, G. (2018). Many-server scaling of the N-system under FCFS–ALIS. Queueing Systems, 88(1–2), 27–71. https://doi.org/10.1007/s11134-017-9549-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free