Skip to main content

Two Way Communication Retrial Queues with Balanced Call Blending

  • Conference paper
Analytical and Stochastic Modeling Techniques and Applications (ASMTA 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7314))

Abstract

In call centers, call blending consists in the mixing of incoming and outgoing call activity. Artalejo and Phung-Duc recently provided an apt model for such a setting, with a two way communication retrial queue. However, by assuming a classical (proportional) retrial rate for the incoming calls, the outgoing call activity is largely blocked when many incoming calls are in orbit, which may be unwanted, especially when outgoing calls are vital to the service offered.

In this paper, we assume a balanced way of call blending, through a retrial queue with constant retrial rate for incoming calls. For the single server case (one operator), a generating functions approach enables deriving explicit formulas for the joint stationary distribution of the number of incoming calls and the system state, and also for the factorial moments. This is complemented with a stability analysis, expressions for performance measures, and also recursive formulas, allowing reliable numerical calculation. For the multiserver case (multiple operators), we provide a quasi-birth-and-death process formulation, enabling deriving a sufficient and necessary condition for stability in this case, as well as a numerical recipe to obtain the stationary distribution.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Falin, G.I., Templeton, J.G.C.: Retrial Queues. Chapman and Hall, Boca Raton (1997)

    MATH  Google Scholar 

  2. Artalejo, J.R., Gomez-Córral, A.: Retrial Queueing Systems: A Computational Approach. Springer, Berlin (2008)

    Book  MATH  Google Scholar 

  3. Phung-Duc, T., Masuyama, H., Kasahara, S., Takahashi, Y.: State-dependent M/M/c/c+r retrial queues with bernoulli abandonment. Journal of Industrial and Management Optimization 6(3), 517–540 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Koole, G., Mandelbaum, A.: Queueing models of call centers: an introduction. Annals of Operations Research 113(1), 41–59 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bhulai, S., Koole, G.: A queueing model for call blending in call centers. IEEE Transactions on Automatic Control 48, 1434–1438 (2003)

    Article  MathSciNet  Google Scholar 

  6. Artalejo, J.R., Phung-Duc, T.: Markovian single server retrial queues with two way communication. In: Proceedings of the 6th International Conference on Queueing Theory and Network Applications, QTNA 2011, pp. 1–7. ACM, New York (2011)

    Google Scholar 

  7. Bernett, H.G., Fischer, M.J., Masi, D.M.B.: Blended call center performance analysis. IT Professional 4, 33–38 (2002)

    Article  Google Scholar 

  8. Deslauriers, A., L’Ecuyer, P., Pichitlamken, J., Ingolfsson, A., Avramidis, A.N.: Markov chain models of a telephone call center with call blending. Computers & Operations Research 34, 1616–1645 (2007)

    Article  MATH  Google Scholar 

  9. Atencia, I., Moreno, P.: A single-server retrial queue with general retrial times and Bernoulli schedule. Applied Mathematics and Computation 162(2), 855–880 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Atencia, I., Fortes, I., Moreno, P., Sánchez, S.: An M/G/1 retrial queue with active breakdowns and Bernoulli schedule in the server. Information and Management Sciences 17(1), 1–17 (2006)

    MathSciNet  MATH  Google Scholar 

  11. Fayolle, G.: A simple telephone exchange with delayed feedbacks. In: Proc. of the International Seminar on Teletraffic Analysis and Computer Performance Evaluation, pp. 245–253. North-Holland Publishing Co., Amsterdam (1986)

    Google Scholar 

  12. Farahmand, K.: Single line queue with repeated demands. Queueing Systems 6, 223–228 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  13. Martin, M., Artalejo, J.R.: Analysis of an M/G/1 queue with two types of impatient units. Advances in Applied Probability 27(3), 840–861 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  14. Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modelling. SIAM, Philadelphia (1999)

    Book  Google Scholar 

  15. Phung-Duc, T., Masuyama, H., Kasahara, S., Takahashi, Y.: A simple algorithm for the rate matrices of level-dependent QBD processes. In: Proceedings of the 5th International Conference on Queueing Theory and Network Applications, QTNA 2010, pp. 46–52. ACM, New York (2010)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phung-Duc, T., Rogiest, W. (2012). Two Way Communication Retrial Queues with Balanced Call Blending. In: Al-Begain, K., Fiems, D., Vincent, JM. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2012. Lecture Notes in Computer Science, vol 7314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30782-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30782-9_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30781-2

  • Online ISBN: 978-3-642-30782-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics