Abstract
We investigate single server queueing systems with batch Poisson arrivals and without demands losses under assumption that each demand has some random capacity (generally, each demand is characterized by l-dimensional indication vector). Service time of the demand arbitrary depends on its capacity (indications). The Laplace-Stieltjes transform of total capacities (random vector of sum of indications) of demands that were served during a busy period of the system is determined.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tikhonenko, O.M.: Queueing Models in Computer Systems. Universitetskoe, Minsk (1990) (in Russian)
Tikhonenko, O.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006) (in Polish)
Klimov, G.P.: Stochastic Service Systems. Nauka, Moscow (1966) (in Russian)
Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 2. Wiley, New York (1971)
Yashkov, S.F., Yashkova, A.S.: Processor Sharing. A Survay of the Mathematical Theory. Autom. Remote Control 68(9), 1662–1731 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tikhonenko, O., Kawecka, M. (2012). Busy Period Characteristics for Single Server Queue with Random Capacity Demands. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2012. Communications in Computer and Information Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31217-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-31217-5_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31216-8
Online ISBN: 978-3-642-31217-5
eBook Packages: Computer ScienceComputer Science (R0)