A stochastic analysis of a network with two levels of service

DOI10.1007/S11134-019-09617-YMaRDI QIDQ2284385zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 15 January 2020

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.09590

zbMATH Keywords

stochastic modelscall centersnetwork with blocking

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Queueing theory (aspects of probability theory) (60K25)

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 are 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.

Recommendations

• Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method
• Engineering solution of a basic call-center model
• Analysis of a queueing model for a call center with impatient customers and after-call work
• Queueing models of call centers: An introduction
• A Call-Routing Problem with Service-Level Constraints

Cites work

• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• scientific article; zbMATH DE number 1947316 (Why is no real title available?)
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)
• scientific article; zbMATH DE number 227027 (Why is no real title available?)
• scientific article; zbMATH DE number 3227572 (Why is no real title available?)
• Blocking probabilities in large circuit-switched networks
• Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations
• Ergodic Theorems for the Asymmetric Simple Exclusion Process
• Optimal resource allocation for multiqueue systems with a shared server pool
• Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets
• Queueing model for call blending in call centers
• Queueing models for patient-flow dynamics in inpatient wards
• Queueing models of call centers: An introduction
• Reflected Brownian motion on an orthant
• Small Random perturbation of dynamical systems with reflecting boundary
• Stochastic Equations for Diffusion Processes in a Bounded Region. II
• Structure theory of Petri nets

Cited in

(4)

• scientific article; zbMATH DE number 4046839 (Why is no real title available?)
• Service networks with multichannel nodes in a random environment
• Piecewise affine dynamical models of Petri nets -- application to emergency call centers
• Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach

This page was built for publication: A stochastic analysis of a network with two levels of service

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284385)