Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Analyzing the Models of Systems with Heterogeneous Servers

  • 1 Accesses

Abstract

The mathematical model of a queueing system with heterogeneous servers, without queues, and with two types of requests is investigated. High-priority requests are processed in fast servers while low-priority calls are processed in slow servers. If all servers in some group are busy, then reassigning of requests to another group is allowed. Reassigning is based on random schemes and reassignment probability depends on the number of busy servers in appropriate group. Exact and approximate methods are developed for the analysis of characteristics of the system. Explicit approximate formulas to calculate the approximate values of characteristics are proposed.

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

References

  1. 1.

    H. Gumbel, “Waiting lines with heterogeneous servers,” Operations Research, Vol. 8, Iss. 4, 504–511 (1960).

  2. 2.

    V. S. Singh, “Two-server Markovian queues with balking: Heterogeneous vs homogeneous servers,” Operations Research, Vol. 18, Iss 1, 145–159 (1970).

  3. 3.

    V. S. Singh, “Markovian queues with three servers,” IIE Trans., Vol. 3, Iss. 1, 45–48 (1971).

  4. 4.

    D. Fakinos, “The M G k / / blocking system with heterogeneous servers,” J. of Operations Research Society, Vol. 31, Iss. 10, 919–927 (1980).

  5. 5.

    D. Fakinos, “The generalized M G k / / blocking system with heterogeneous servers,” J. of Operations Research Society, Vol. 33, Iss. 9, 801–809 (1982).

  6. 6.

    G. Nath and E. Enns, “Optimal service rates in the multi-server loss system with heterogeneous servers,” J. of Applied Probability, Vol. 18, Iss. 3, 776–781 (1981).

  7. 7.

    F. Alpaslan and A. Shahbazov, “An analysis and optimization of stochastic service with heterogeneous channels and Poisson arrivals,” Pure and Apllied Mathematics Science, Vol. 43, 15–20 (1996).

  8. 8.

    B. W. Lin and E. A. Elsayed, “A general solution for multichannel queueing systems with ordered entry,” Computers & Operations Research, Vol. 5, Iss. 4, 219–225 (1978).

  9. 9.

    E. A. Elsayed, “Multichannel queueing systems with ordered entry and finite source,” Computers & Operations Research, Vol. 10, Iss. 3, 213–222 (1983).

  10. 10.

    D. D. Yao, “The arrangement of servers in an ordered-entry system,” Operations Research, Vol. 35, Iss. 5, 759–763 (1987).

  11. 11.

    B. Pourbabai and D. Sonderman, “Server utilization factors in queueing loss systems with ordered entry and heterogeneous servers,” J. of Applied Probability, Vol. 23, Iss. 1, 236–242 (1986).

  12. 12.

    B. Pourbabai, “Markovian queueing systems with retrials and heterogeneous servers,” Computers & Mathematics with Applications, Vol. 13, Iss. 12, 917–923 (1987).

  13. 13.

    W. M. Nawijn, “On a two-server finite queuing system with ordered entry and deterministic arrivals,” Europ. J. of Operations Research, Vol. 18, Iss. 3, 388–395. (1984).

  14. 14.

    W. M. Nawijn, “A note on many-server queueing systems with ordered entry with an application to conveyor theory,” J. of Applied Probability, Vol. 20, 144–152 (1983).

  15. 15.

    D. D. Yao, “Convexity properties of the overflow in an ordered-entry system with heterogeneous servers,” Operations Research Letters, Vol. 5, Iss. 3, 145–147 (1986).

  16. 16.

    H. O. Isguder and U. U. Kocer, “Analysis of GI M / n / n / queueing system with ordered entry and no waiting line,” Applied Mathematical Modelling, Vol. 38, Iss. 3, 1024–1032 (2014).

  17. 17.

    R. L. Larsen and A. K. Agrawala, “Control of heterogeneous two-server exponential queueing system,” IEEE Trans. on Software Engineering, Vol. SE-9, Iss. 4, 522–526 (1983).

  18. 18.

    G. Koole, “A simple proof of the optimality of a threshold policy in a two-server queueing system,” Systems & Control Letter, Vol. 26, Iss. 5, 301–303 (1995).

  19. 19.

    W. Lin and P. R. Kumar, “Optimal control of queueing system with two heterogeneous servers,” IEEE Trans. on Automatic Control, Vol. 29, Iss. 8, 696–703 (1984).

  20. 20.

    H. P. Luh and I. Viniotis, “Threshold control policies for heterogeneous servers systems,” Mathematical Methods in Operational Research, Vol. 55, Iss. 1, 121–142 (2002).

  21. 21.

    R. Weber, “On a conjecture about assigning jobs to processors of different speeds,” IEEE Trans. on Automatic Control, Vol. 38, Iss. 1, 166–170 (1993).

  22. 22.

    D. Efrosinin and J. Sztrik, “Optimal control of a two-server heterogeneous queueing system with breakdowns and constant retrials,” in: A. Dudin, A. Gortsev, A. Nazarov, and R. Yakupov (eds.), Information Technologies and Mathematical Modelling. Queueing Theory and Applications, ITMM 2016, Communications in Computer and Information Science, Vol. 638 (2016), pp. 57–72.

  23. 23.

    D. Efrosinin, J. Sztrik, M. Farkhadov, and N. Stepanova, “Reliability analysis of two-server heterogeneous queueing system with threshold control policy,” in: A. Dudin, A. Nazarov, and A. Kirpichnikov (eds.), Information Technologies and Mathematical Modelling. Queueing Theory and Applications, ITMM 2017, Communications in Computer and Information Science, Vol. 800 (2017), pp. 13–27.

  24. 24.

    I. Viniotis and A. Ephremides, “Extension of the optimality of a threshold policy in heterogeneous multi-server queueing systems,” IEEE Trans. on Automatic Control, Vol. 33, Iss. 1, 104–109 (1988).

  25. 25.

    Z. Rosberg and A. M. Makowski, “Optimal routing to parallel heterogeneous servers — Small arrival rates,” IEEE Trans. on Automatic Control, Vol. 35, Iss. 7, 789–796 (1990).

  26. 26.

    V. V. Rykov, “Monotone control of queueing systems with heterogeneous servers,” Queueing Systems, Vol. 37, 391–403 (2001).

  27. 27.

    V. V. Rykov and D. Efrosinin, “On the slow server problem,” Automation and Remote Control, Vol. 70, Iss. 12, 2013–2023 (2009).

  28. 28.

    M. F. Neuts, “Matrix-geometric solutions in stochastic models: An algorithmic approach,” John Hopkins University Press, Baltimore (1981).

  29. 29.

    I. Mitrani and R. Chakka, “Spectral expansion solution for a class of Markov models: Application and comparison with the matrix-geometric method,” Performance Evaluation, Vol. 23, Iss. 3, 241–260 (1995).

  30. 30.

    R. Chakka, “Spectral expansion solution for some finite capacity queues,” Annals of Operations Research, Vol. 79, 27–44 (1998).

  31. 31.

    A. Z. Ìelikov, L. A. Ponomarenko, and A. M. Rustamov, “Hierarchical space merging algorithm to analysis of open tandem queueing networks,” Cybern. Syst. Analysis, Vol. 52, No. 6, 867–877 (2016).

  32. 32.

    A. Z. Melikov, L. A. Ponomarenko, and C. S. Kim, Performance Analysis and Optimization of Multi-Traffic on Communication Networks, Springer, Berlin (2010).

Download references

Author information

Correspondence to A. Z. Melikov.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 1, January–February, 2020, pp. 106–117.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Melikov, A.Z., Ponomarenko, L.A. & Mekhbaliyeva, E.V. Analyzing the Models of Systems with Heterogeneous Servers. Cybern Syst Anal (2020). https://doi.org/10.1007/s10559-020-00224-x

Download citation

Keywords

  • heterogeneous server
  • queueing system
  • priorities
  • requests of different types
  • optimization