New Perspectives on the Erlang-A Queue

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Daw, Andrew, Pender, Jamol
Format: Preprint
Published: 2017
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909989015126016
author Daw, Andrew
Pender, Jamol
author_facet Daw, Andrew
Pender, Jamol
contents The non-stationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large scale multi-server service systems that may experience customer abandonments, such as call centers, hospitals, and urban mobility systems. In this paper, we develop novel approximations to all of its transient and steady state moments, the moment generating function, and the cumulant generating function. We also provide precise bounds for the difference of our approximations and the true model. More importantly, we show that our approximations have explicit stochastic representations as shifted Poisson random variables. Moreover, we are also able to show that our approximations and bounds also hold for non-stationary Erlang-B and Erlang-C queueing models under certain stability conditions. Finally, we perform numerous simulations to support the conclusions of our results.
format Preprint
id arxiv_https___arxiv_org_abs_1712_08445
institution arXiv
publishDate 2017
record_format arxiv
spellingShingle New Perspectives on the Erlang-A Queue
Daw, Andrew
Pender, Jamol
Probability
60K25, 90B22, 62L20
The non-stationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large scale multi-server service systems that may experience customer abandonments, such as call centers, hospitals, and urban mobility systems. In this paper, we develop novel approximations to all of its transient and steady state moments, the moment generating function, and the cumulant generating function. We also provide precise bounds for the difference of our approximations and the true model. More importantly, we show that our approximations have explicit stochastic representations as shifted Poisson random variables. Moreover, we are also able to show that our approximations and bounds also hold for non-stationary Erlang-B and Erlang-C queueing models under certain stability conditions. Finally, we perform numerous simulations to support the conclusions of our results.
title New Perspectives on the Erlang-A Queue
topic Probability
60K25, 90B22, 62L20
url https://arxiv.org/abs/1712.08445