Skip to main content

Abstract

In this communication, we use the strong stability method to approximate the characteristics of the M 2/G/1 queue with preemptive resume priority by those of the M/G/1 one. For this, we first prove the stability fact and next obtain quantitative stability estimates with an exact computation of constants.

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 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Aissani, D., Kartashov, N.V.: Ergodicity and stability of Markov chains with respects of operator topology in the space of transition kernels. Dokl. Akad. Nauk. Ukr. S.S.R, Ser. A 11, 3–5 (1983)

    Google Scholar 

  2. Anisimo, V.V.: Estimates for the deviations of the transition characteristics of non-homogeneous Markov processes. Ukrainian Math. Journal 40, 588–592 (1986)

    Article  Google Scholar 

  3. Borovkov, A.A.: Asymptotic methods in queueing theory. Wiley, New York (1984)

    MATH  Google Scholar 

  4. Franken., P.: Ein stetigkeitssatz fur verlustsysteme. Operations-Forschung und Math., Stat. 11, 1–23 (1995)

    MATH  Google Scholar 

  5. Gnedenko, B.V., Klimov, G.P., Danelian, E.: Priority queueing systems. Moskow University, Moskow (1973)

    Google Scholar 

  6. Ipsen, C.F., Meyer, D.: Uniform stablity of Markov chains. SIAM Journal on Matrix Analysis and Applications 15(4), 1061–1074 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jaiswal, N.K.: Priority Queues. Academic Press, New York (1968)

    MATH  Google Scholar 

  8. Kalashinkov, V.V.: Quantitative estimates in queueing theory. CRC Press, Inc., Boca Raton (1996)

    Google Scholar 

  9. Kartashov, N.V.: Strong stable Markovs chains. VSP Utrecht (1996)

    Google Scholar 

  10. Kennedy, D.P.: The continuity of single server queue. Journal of Applied Probability 09, 370–381 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  11. Rachev, S.: T The problem of stability in queueing theory. Queueing Systems 4, 287–318 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  12. Rosseberg, H.J.: Uber die verteilung von watereiten. Mathematische Nachrichten 30, 1–16 (1965)

    Article  MathSciNet  Google Scholar 

  13. Stoyan, D.: Ein stetigkeitssatz fur einlinge wartemodelle eer bedienungsheorie. Maths Operations forschu. Statist. (3), 103–111 (1977)

    Google Scholar 

  14. Zolotariev, V.M.: On the continuity of stochastic sequences generated by recurrent processes. Theory of Probabilities and its Applications 20, 819–832 (1975)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamadouche, N., Aissani, D. (2008). Performance Evaluation in a Queueing System M 2/G/1. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87477-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-87476-8

  • Online ISBN: 978-3-540-87477-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics