Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computer Networks

CN 2020: Computer Networks pp 141–152Cite as

On Comparison of Multiserver Systems with Exponential-Pareto Mixture Distribution

  • Conference paper
  • First Online:

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

Abstract

Mixture models arise when at least two different distributions of data sets are presented. In this paper, we introduce the upper and lower bounds for the steady-state performance of a multiserver model of the network node, with Exponential-Pareto mixture distribution of service times. We use the failure rate and stochastic comparison techniques together with coupling of random variables to establish some monotonicity properties of the model. These theoretical results are illustrated by numerical simulation of GI/G/N queueing systems.

This research is supported by the Ministry of Science and Higher Education of the Russian Federation (project no. 05.577.21.0293, unique identifier RFMEFI57718X0293). The research is supported by Russian Foundation for Basic Research, projects No. 19-57-45022, 19-07-00303, 18-07-00156, 18-07-00147.

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

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

Learn about institutional subscriptions

References

  1. Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003). https://doi.org/10.1007/b97236. 439 p\({\rm {.}}\)

    Book  MATH  Google Scholar 

  2. Asmussen, S., Glynn, P.: Stochastic Simulation: Algorithms and Analysis. Springer, New York (2007). https://doi.org/10.1007/978-0-387-69033-9. 476 p\({\rm {.}}\)

    Book  MATH  Google Scholar 

  3. Aven, T., Jensen, U.: Stochastic Models in Reliability. Springer, New York (2013). https://doi.org/10.1007/978-1-4614-7894-2. 297 p\({\rm {.}}\)

    Book  MATH  Google Scholar 

  4. Berger, A., Whitt, W.: Comparisons of multi-server queues with finite waiting rooms. Stoch. Models 8(4), 719–732 (1992). https://doi.org/10.1080/15326349208807248

    Article  MathSciNet  MATH  Google Scholar 

  5. Goldie, C., Klüppelberg, C.: Subexponential distributions. In: A Practical Guide to Heavy Tails: Statistical Techniques for Analysing Heavy Tails, pp. 435–459. Birkhäuser, Cambridge (1998)

    Google Scholar 

  6. Al-Hussaini, E.K., Sultan, K.S.: Reliability and hazard based on finite mixture models. In: Advances in Reliability, Handbook of Statistics, vol. 20, pp. 139–183 (2001). https://doi.org/10.1016/S0169-7161(01)20007-8

  7. Mclachlan, G.I., Peel, D.: Finite Mixture Models. Wiley Series in Probability and Statistics. Applied Probability and Statistics Section. Wiley, New York (2001). https://doi.org/10.1002/0471721182

    Book  MATH  Google Scholar 

  8. Marshall, A., Olkin, I.: Life Distributions: Structure of Nonparametric, Semiparametric and Parametric Families. Springer, New York (2007). https://doi.org/10.1007/978-0-387-68477-2. 783 p\(\rm {.}\)

    Book  MATH  Google Scholar 

  9. Morozov, E., Peshkova, I., Rumyantsev, A.: On failure rate comparison of finite multiserver systems. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2019. LNCS, vol. 11965, pp. 419–431. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-36614-8_32

    Chapter  Google Scholar 

  10. Morozov, E., Nekrasova, R., Peshkova, I., Rumyantsev, A.: A regeneration-based estimation of high performance multiserver systems. In: Gaj, P., Kwiecień, A., Stera, P. (eds.) CN 2016. CCIS, vol. 608, pp. 271–282. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39207-3_24

    Chapter  Google Scholar 

  11. Morozov, E., Peshkova, I., Rumyantsev, A.: On regenerative envelopes for cluster model simulation. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2016. CCIS, vol. 678, pp. 222–230. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-51917-3_20

    Chapter  Google Scholar 

  12. Ross, S., Shanthikumar, J.G., Zhu, Z.: On increasing-failure-rate random variables. J. Appl. Probab. 42(3), 797–809 (2005). https://doi.org/10.1239/jap/1127322028

    Article  MathSciNet  MATH  Google Scholar 

  13. Shedler, G.S.: Regeneration and Networks of Queues. Sprigner, New York (1987). https://doi.org/10.1007/978-1-4612-1050-4. 224 p\(\rm {.}\)

    Book  MATH  Google Scholar 

  14. Shedler, G.S.: Regenerative Stochastic Simulation. Academic Press Inc., Burlington (1992). https://www.elsevier.com/books/regenerative-stochastic-simulation/shedler/978-0-08-092572-1. 400 p\(\rm {.}\)

    MATH  Google Scholar 

  15. Sigman, K., Wolff, R.W.: A review of regenerative processes. SIAM Rev. 35(2), 269–288 (1993). https://doi.org/10.1137/1035046

    Article  MathSciNet  MATH  Google Scholar 

  16. Sonderman, D.: Comparing multi-server queues with finite waiting rooms, I: same number of servers. Adv. Appl. Probab. 11(2), 439–447 (1979). https://doi.org/10.2307/1426848

    Article  MathSciNet  MATH  Google Scholar 

  17. Sonderman, D.: Comparing multi-server queues with finite waiting rooms, II: different number of servers. Adv. Appl. Probab. 11(2), 448–455 (1979). https://doi.org/10.2307/1426849

    Article  MathSciNet  MATH  Google Scholar 

  18. Thorisson, H.: Coupling, Stationarity, and Regeneration. Springer, New York (2000)

    Book  Google Scholar 

  19. Whitt, W.: Comparing counting processes and queues. Adv. Appl. Probab. 13(1), 207–220 (1981). https://doi.org/10.2307/1426475

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Petrozavodsk State University, Lenin str. 33, Petrozavodsk, 185910, Russia

    Irina Peshkova, Evsey Morozov & Maria Maltseva

  2. Institute of Applied Mathematical Research of the Karelian research Centre of RAS, Pushkinskaya str. 11, Petrozavodsk, 185910, Russia

    Evsey Morozov

  3. Moscow Center for Fundamental and Applied Mathematics, Moscow State University, Moscow, 119991, Russia

    Evsey Morozov

Authors
  1. Irina Peshkova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evsey Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maria Maltseva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Irina Peshkova , Evsey Morozov or Maria Maltseva .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Gdańsk University of Technology, Gdańsk, Poland

    Wojciech Gumiński

  3. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Peshkova, I., Morozov, E., Maltseva, M. (2020). On Comparison of Multiserver Systems with Exponential-Pareto Mixture Distribution. In: Gaj, P., Gumiński, W., Kwiecień, A. (eds) Computer Networks. CN 2020. Communications in Computer and Information Science, vol 1231. Springer, Cham. https://doi.org/10.1007/978-3-030-50719-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-50719-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-50718-3

  • Online ISBN: 978-3-030-50719-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation