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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Berger, A.W., Kogan, Y.: Dimensioning bandwidth for elastic traffic in high-speed data networks. IEEE/ACM Trans. Netw. 8(5), 643–654 (2000)
Bonald, T., Massouli, L.: Impact of fairness on Internet performance. In: Proceeedings of SIGMETRICS 2001, pp. 82–91 (2001)
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)
Chen, N., Jordan, S.: Throughput in processor-sharing queues. IEEE Trans. Autom. Contr. 52(2), 299–305 (2007)
Coffman, J.E.G., Muntz, R.R., Trotter, H.: Waiting time distributions for processor-sharing systems. J. ACM 17(1), 123–130 (1970)
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)
Knessl, C.: On the sojourn time distribution in a finite capacity processor shared queue. J. ACM 40(5), 1238–1301 (1993)
Ott, T.J.: The sojourn-time distribution in the \(M/G/1\) queue with processor sharing. J. Appl. Prob. 21, 360–378 (1984)
Schassberger, R.: A new approach to the \(M/G/1\) processor-sharing queue. Adv. Appl. Prob. 16, 202–213 (1984)
Yashkov, S.F.: Analysis of Computer Queues. Radio i Svyaz, Moscow (1989). [in Russian]
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)
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)
Yashkov, S.F., Yashkova, A.S.: Processor sharing: a survey of the mathematical theory. Autom. Remote Control. 68(9), 1662–1731 (2007)
Tikhonenko, O.M.: Queuing systems with processor sharing and limited resources. Autom. Remote Control. 71(5), 803–815 (2010)
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)
Lakatos, L., Szeidl, L., Telek, M.: Introduction to Queueing Systems with Telecommunication Applications. Springer, New York (2010)
Tikhonenko, O.M.: Queueing Models in Information Systems. Universitetskoe, Minsk (1990). [in Russian]
Tikhonenko, O.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006). [in Polish]
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)