Skip to main content
Log in

A stochastic analysis of a network with two levels of service

  • Published:
Queueing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Allamigeon, X., Bœuf, V., Gaubert, S.: Performance evaluation of an emergency call center: tropical polynomial systems applied to timed Petri nets, FORMATS’15. Lecture Notes in Computer Science, vol. 9268. Springer (2015)

  2. Allamigeon, X., Bœuf, V., Gaubert, S.: Stationary solutions of discrete and continuous Petri nets with priorities. Perform. Eval. 113, 1–12 (2017)

    Article  Google Scholar 

  3. Anderson, R.F., Orey, S.: Small random perturbation of dynamical systems with reflecting boundary. Nagoya Math. J. 60, 189–216 (1976)

    Article  Google Scholar 

  4. Balsamo, S.: Queueing Networks with Blocking: Analysis, Solution Algorithms and Properties, pp. 233–257. Springer, Berlin (2011)

    Google Scholar 

  5. Best, E., Wimmel, H.: Structure Theory of Petri Nets, Transactions on Petri Nets and Other Models of Concurrency VII, pp. 162–224. Springer, Berlin (2013)

    Book  Google Scholar 

  6. Bhulai, S., Koole, G.: A queueing model for call blending in call centers. IEEE Trans. Autom. Control 48(8), 1434–1438 (2003)

    Article  Google Scholar 

  7. Billingsley, P.: Convergence of Probability Measures. Wiley Series in Probability and Statistics: Probability and Statistics. Wiley, New York (1999)

    Book  Google Scholar 

  8. Chen, H., Mandelbaum, A.: Discrete flow networks: bottleneck analysis and fluid approximations. Math. Oper. Res. 16(2), 408–446 (1991)

    Article  Google Scholar 

  9. Cohen, G., Gaubert, S., Quadrat, J.-P.: Asymptotic throughput of continuous timed Petri nets. In: 34th Conference on Decision and Control (New Orleans) (1995)

  10. Dong, J., Perry, O.: Queueing models for patient-flow dynamics in inpatient wards. Available at SSRN 3246641 (2018)

  11. El Karoui, N., Chaleyat-Maurel, M.: Temps locaux, vol. 52–53, ch. Un problème de réflexion et ses applications au tempslocal et aux équations différentielles stochastiques sur \({{\mathbb{R}}}\), pp. 117–144, Société Mathématique de France,1978, Exposés du Séminaire J. Azéma-M. Yor, Paris (1976–1977)

  12. Harrison, J.M., Reiman, M.I.: Reflected Brownian motion on an orthant. Ann. Probab. 9(2), 302–308 (1981)

    Article  Google Scholar 

  13. Kelly, F.P.: Reversibility and Stochastic Networks. Wiley Series in Probability and Mathematical Statistics. Wiley, Chichester (1979)

    Google Scholar 

  14. Kelly, F.P.: Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18, 473–505 (1986)

    Article  Google Scholar 

  15. Kingman, J.F.C.: Poisson Processes, Oxford studies in probability. Oxford Science Publications, The Clarendon Press, Oxford University Press, New York (1993)

    Google Scholar 

  16. Koole, G., Mandelbaum, A.: Queueing models of call centers: an introduction. Ann. Oper. Res. 113(1), 41–59 (2002)

    Article  Google Scholar 

  17. Liggett, T.M.: Ergodic theorems for the asymmetric simple exclusion process. Trans. Am. Math. Soc. 213, 237–261 (1975)

    Article  Google Scholar 

  18. Liggett, T.M.: Interacting Particle Systems. Grundlehrender mathematischen Wissenschaften. Springer, New York (1985)

    Book  Google Scholar 

  19. Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  20. Pang, G., Perry, O.: A logarithmic safety staffing rule for contact centers with call blending. Manag. Sci. 61(1), 73–91 (2015)

    Article  Google Scholar 

  21. Robert, P.: Stochastic Networks and Queues, Stochastic Modelling and Applied Probability Series, vol. 52. Springer, New York (2003)

    Google Scholar 

  22. Skorokhod, A.V.: Stochastic equations for diffusion processes in a bounded region. Theory Probab. Appl. 7, 3–23 (1962)

    Article  Google Scholar 

  23. Watanabe, S.: On discontinuous additive functionals and Lévy measures of a Markov process. Jpn. J. Math. 34, 53–70 (1964)

    Article  Google Scholar 

  24. Yang, R., Bhulai, S., Van der Mei, R.: Optimal resource allocation for multiqueue systems with a shared server pool. Queueing Syst. 68(2), 133–163 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Philippe Robert.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bœuf, V., Robert, P. A stochastic analysis of a network with two levels of service. Queueing Syst 92, 203–232 (2019). https://doi.org/10.1007/s11134-019-09617-y

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-019-09617-y

Keywords

Mathematics Subject Classification

Navigation