A stochastic analysis of a network with two levels of service

Vianney Bœuf () and Philippe Robert ()
Additional contact information
Vianney Bœuf: CMAP, École Polytechnique
Philippe Robert: INRIA

Queueing Systems: Theory and Applications, 2019, vol. 92, issue 3, No 1, 203-232

Abstract: Abstract In this paper, a stochastic model of a call center with a two-level architecture is analyzed. A first-level pool of operators answers calls, identifies, and handles non-urgent calls. A call classified as urgent has to be transferred to specialized operators at the second level. When the operators of the second level are all busy, the operator of first-level handling the urgent call is blocked until an operator at the second level is available. Under a scaling assumption, the evolution of the number of urgent calls blocked at level 1 is investigated. It is shown that if the ratio of the number of operators at level 2 and 1 is greater than some threshold, then, essentially, the system operates without congestion, with probability close to 1 no urgent call is blocked after some finite time. Otherwise, we prove that a positive fraction of the operators of the first level is blocked due to the congestion of the second level. Stochastic calculus with Poisson processes, coupling arguments and formulations in terms of Skorokhod problems are the main mathematical tools to establish these convergence results.

Keywords: Network with blocking; Stochastic models; Call centers; 60K35; 60K25 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-019-09617-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:92:y:2019:i:3:d:10.1007_s11134-019-09617-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-019-09617-y

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().