Skip to main content
SpringerLink
Log in

Egalitarian Processor Sharing System with Demands of Random Space Requirement

  • Conference paper
  • First Online:
Book cover Computer Networks (CN 2015)

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

Included in the following conference series:

  • 1597 Accesses

Abstract

We investigate processor sharing systems with demands having some random space requirements (volumes) and demands lengths depending on their volumes. For such systems we determine non-stationary total demands capacity distribution in terms of Laplace and Laplace-Stieltjes transforms.

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

Access this chapter

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

Institutional subscriptions

References

  1. Berger, A.W., Kogan, Y.: Dimensioning bandwidth for elastic traffic in high-speed data networks. IEEE/ACM Trans. Netw. 8(5), 643–654 (2000)

    Article  Google Scholar 

  2. Bonald, T., Massouli, L.: Impact of fairness on Internet performance. In: Proceeedings of SIGMETRICS 2001, pp. 82–91 (2001)

    Google Scholar 

  3. Bonald, T., May, M., Bolot, J.-C.: Analytic evaluation of RED performance. In: Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1415–1424 (2000)

    Google Scholar 

  4. Chen, N., Jordan, S.: Throughput in processor-sharing queues. IEEE Trans. Autom. Contr. 52(2), 299–305 (2007)

    Article  MathSciNet  Google Scholar 

  5. Coffman, J.E.G., Muntz, R.R., Trotter, H.: Waiting time distributions for processor-sharing systems. J. ACM 17(1), 123–130 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  6. Morrison, J.A.: Asymptotic analysis of the waiting-time distribution for a large closed processor-sharing system. SIAM J. Appl. Math. 46, 140–170 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  7. Knessl, C.: On the sojourn time distribution in a finite capacity processor shared queue. J. ACM 40(5), 1238–1301 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Ott, T.J.: The sojourn-time distribution in the \(M/G/1\) queue with processor sharing. J. Appl. Prob. 21, 360–378 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  9. Schassberger, R.: A new approach to the \(M/G/1\) processor-sharing queue. Adv. Appl. Prob. 16, 202–213 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  10. Yashkov, S.F.: Analysis of Computer Queues. Radio i Svyaz, Moscow (1989). [in Russian]

    Google Scholar 

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

    Article  MATH  Google Scholar 

  12. Yashkov, S.F.: A derivation of response time distribution for a \(M/G/1\) processor sharing queue. Probl. Contr. Info. Theor. 12, 133–148 (1983)

    MATH  MathSciNet  Google Scholar 

  13. Yashkov, S.F., Yashkova, A.S.: Processor sharing: a survey of the mathematical theory. Autom. Remote Control. 68(9), 1662–1731 (2007)

    Article  MATH  Google Scholar 

  14. Tikhonenko, O.M.: Queuing systems with processor sharing and limited resources. Autom. Remote Control. 71(5), 803–815 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  15. Sengupta, B.: The spatial requirement of M/G/1 queue or: how to design for buffer space. In: Baccelli, F., Fayolle, G. (eds.) Modeling and Performance Evaluation Methodology. LNCIS, vol. 60, pp. 545–562. Springer, Berlin (1984)

    Chapter  Google Scholar 

  16. Lakatos, L., Szeidl, L., Telek, M.: Introduction to Queueing Systems with Telecommunication Applications. Springer, New York (2010)

    Google Scholar 

  17. Tikhonenko, O.M.: Queueing Models in Information Systems. Universitetskoe, Minsk (1990). [in Russian]

    MATH  Google Scholar 

  18. Tikhonenko, O.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006). [in Polish]

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Czestochowa University of Technology, Al. Armii Krajowej 21, 42-200, Czestochowa, Poland

    Oleg Tikhonenko

Authors
  1. Oleg Tikhonenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Oleg Tikhonenko .

Editor information

Editors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Piotr Gaj

  2. Silesian University of Technology, Gliwice, Poland

    Andrzej Kwiecień

  3. Silesian University of Technology, Gliwice, Poland

    Piotr Stera

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Tikhonenko, O. (2015). Egalitarian Processor Sharing System with Demands of Random Space Requirement. In: Gaj, P., Kwiecień, A., Stera, P. (eds) Computer Networks. CN 2015. Communications in Computer and Information Science, vol 522. Springer, Cham. https://doi.org/10.1007/978-3-319-19419-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19419-6_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19418-9

  • Online ISBN: 978-3-319-19419-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation