Saved in:
Bibliographic Details
Main Authors: Gopalakrishnan, Ragavendran, Zhong, Yueyang
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2304.13845
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909197721927680
author Gopalakrishnan, Ragavendran
Zhong, Yueyang
author_facet Gopalakrishnan, Ragavendran
Zhong, Yueyang
contents This paper presents asymptotic properties of the Erlang-C formula in a spectrum of many-server limiting regimes. Specifically, we address an important gap in the literature regarding its limiting value in critically loaded regimes by studying extensions of the well-known square-root safety staffing rule used in the Quality-and-Efficiency-Driven (QED) regime.
format Preprint
id arxiv_https___arxiv_org_abs_2304_13845
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Some Asymptotic Properties of the Erlang-C Formula in Many-Server Limiting Regimes
Gopalakrishnan, Ragavendran
Zhong, Yueyang
Probability
This paper presents asymptotic properties of the Erlang-C formula in a spectrum of many-server limiting regimes. Specifically, we address an important gap in the literature regarding its limiting value in critically loaded regimes by studying extensions of the well-known square-root safety staffing rule used in the Quality-and-Efficiency-Driven (QED) regime.
title Some Asymptotic Properties of the Erlang-C Formula in Many-Server Limiting Regimes
topic Probability
url https://arxiv.org/abs/2304.13845