Skip to main content

Refined Approximate Algorithm for Steady-State Probabilities of the Large Scale Queuing Systems with Instantaneous and Delayed Feedback

  • Conference paper
  • First Online:
Information Technologies and Mathematical Modelling. Queueing Theory and Applications (ITMM 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1109))

Abstract

Mathematical models of the multichannel queueing systems with both instantaneous and delayed feedbacks are proposed. Probabilities of leaving the system, instantaneous returning to channels and entering to orbit depend on the number of calls in orbit. Both models with finite and infinite size of orbit are investigated. Refined approximate algorithms to calculate the steady-state probabilities as well as quality of service (QoS) metrics of the system are developed. Execution time of the proposed algorithms is negligible. Results of numerical experiments are given.

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 EPUB and 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

References

  1. Takacs, L.: A single-server queue with feedback. Bell Syst. Tech. J. 42, 505–519 (1963)

    Article  MathSciNet  Google Scholar 

  2. Takacs, L.: A queueing model with feedback. Oper. Res. 11(4), 345–354 (1977)

    Article  Google Scholar 

  3. Wortman, M.A., Disney, R.L., Kiessler, P.C.: The M/GI/1 Bernoulli feedback queue with vacations. Queueing Syst. 9(4), 353–363 (1991)

    Article  MathSciNet  Google Scholar 

  4. D’Avignon, G.R., Disney, R.L.: Queues with instantaneous feedback. Manag. Sci. 24(2), 168–180 (1977)

    Article  MathSciNet  Google Scholar 

  5. Berg, J.L., Boxma, O.J.: The M/G/1 queue with processor sharing and its relation to feedback queue. Queueing Syst. 9(4), 365–402 (1991)

    Article  MathSciNet  Google Scholar 

  6. Hunter, J.J.: Sojourn time problems in feedback queue. Queueing Syst. 5(1–3), 55–76 (1989)

    Article  MathSciNet  Google Scholar 

  7. Dudin, A.N., Kazimirsky, A.V., Klimenok, V.I., Breuer, L., Krieger, U.: The queuing model MAP/PH/1/N with feedback operating in a Markovian random environment. Austrian J. Stat. 34(2), 101–110 (2005)

    Article  Google Scholar 

  8. Melikov, A.Z., Ponomarenko, L.A., Kuliyeva, K.N.: Calculation of the characteristics of multichannel queuing system with pure losses and feedback. J. Autom. Inf. Sci. 47(5), 19–29 (2015)

    Article  Google Scholar 

  9. Pekoz, E.A., Joglekar, N.: Poisson traffic flow in a general feedback. J. Appl. Probab. 39(3), 630–636 (2002)

    Article  MathSciNet  Google Scholar 

  10. Lee, H.W., Seo, D.W.: Design of a production system with feedback buffer. Queueing Syst. 26(1), 187–2002 (1997)

    Article  MathSciNet  Google Scholar 

  11. Lee, H.W., Ahn, B.Y.: Analysis of a production system with feedback buffer and general dispatching time. Math. Probl. Eng. 5, 421–439 (2000)

    Article  Google Scholar 

  12. Foley, R.D., Disney, R.L.: Queues with delayed feedback. Adv. Appl. Probab. 15(1), 162–182 (1983)

    Article  MathSciNet  Google Scholar 

  13. Philippe, B., Saad, Y., Stewart, W.J.: Numerical methods in Markov chains modeling. Oper. Res. 40(6), 1156–1179 (1992)

    Article  Google Scholar 

  14. Melikov, A.Z., Ponomarenko, L.A., Kuliyeva, K.N.: Numerical analysis of the queuing system with feedback. Cybern. Syst. Anal. 51(2), 566–573 (2015)

    Article  Google Scholar 

  15. Kumar, B.K., Rukmani, R., Thangaraj, V.: On multi-server feedback retrial queue with finite buffer. Appl. Math. Model. 33(4), 2062–2083 (2009)

    Article  MathSciNet  Google Scholar 

  16. Do, T.V.: An efficient computation algorithm for a multi-server feedback retrial queue with a large queuing capacity. Appl. Math. Model. 34(8), 2272–2278 (2010)

    Article  Google Scholar 

  17. Gemikonakli, O., Ever, E., Kocyigit, A.: Approximate solution for two stage open networks with Markov-modulated queues minimizing the state space explosion problem. J. Comput. Appl. Math. 223(1), 519–533 (2009)

    Article  MathSciNet  Google Scholar 

  18. Kirsal, Y., Gemikonakli, E., Ever, E., Mapp, G., Gemikonakli, O.: An analytical approach for performance analysis of handoffs in the next generation integral cellular networks and WLANs. In: Proceedings of 19th IEEE International Conference on Computer Communications and Networks, pp. 1–6, Zurich, August 2–5, 2010. https://doi.org/10.1109/ICCCN.2010.5560093

  19. Ever, E., Gemikonakli, O., Kocyigit, A., Gemikonakli, E.: A hybrid approach to minimize state explosion problem for the solution of two stage tandem queues. J. Netw. Comput. Appl. 36, 908–926 (2013)

    Article  Google Scholar 

  20. Kirsal, Y., Ever, E., Kocyigit, A., Gemikonakli, O., Mapp, G.: A generic analytical modeling approach for performance evaluation of the handover schemes in heterogeneous environments. Wirel. Pers. Commun. 79, 1247–1276 (2014)

    Article  Google Scholar 

  21. Kirsal, Y., Ever, E., Kocyigit, A., Gemikonakli, O., Mapp, G.: Modeling and analysis of vertical handover in highly mobile environments. J. Supercomputing. 71, 4352–4380 (2015)

    Article  Google Scholar 

  22. Kim, C., Klimenok, V.I., Dudin, A.N.: Priority tandem queueing system with retrials and reservation of channels as a model of call center. Comput. Ind. Eng. 96, 61–71 (2016)

    Article  Google Scholar 

  23. Melikov, A.Z., Ponomarenko, L.A., Rustamov, A.Ì.: Methods for the analysis of queueing models with instantaneous and delayed feedbacks. Commun. Comput. Inf. Sci. 564, 185–199 (2015)

    Google Scholar 

  24. Koroliuk, V.S., Melikov, A.Z., Ponomarenko, L.A., Rustamov, A.M.: Methods for the analysis of multi-channel queueing models with instantaneous and delayed feedbacks. Cybern. Syst. Anal. 52(1), 58–70 (2016)

    Article  Google Scholar 

  25. Melikov, A.Z., Ponomarenko, L.A., Rustamov, A.M.: Hierarchical space merging algorithm to analysis of open tandem queuing networks. Cybern. Syst. Anal. 52(6), 867–877 (2016)

    Article  Google Scholar 

  26. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, p. 332. John Hopkins University Press, Baltimore (1981)

    MATH  Google Scholar 

  27. Mitrani, I., Chakka, R.: Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method. Perform. Eval. 23, 241–260 (1995)

    Article  Google Scholar 

  28. Chakka, R.: Spectral expansion solution for some finite capacity queues. Ann. Oper. Res. 79, 27–44 (1998)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Melikov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Melikov, A., Aliyeva, S. (2019). Refined Approximate Algorithm for Steady-State Probabilities of the Large Scale Queuing Systems with Instantaneous and Delayed Feedback. In: Dudin, A., Nazarov, A., Moiseev, A. (eds) Information Technologies and Mathematical Modelling. Queueing Theory and Applications. ITMM 2019. Communications in Computer and Information Science, vol 1109. Springer, Cham. https://doi.org/10.1007/978-3-030-33388-1_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33388-1_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33387-4

  • Online ISBN: 978-3-030-33388-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics