Abstract
We investigate queueing systems of different types with demands having some random space requirements connected via common limited buffer space. For such systems combination we determine steady-state loss probability and distribution of number of demands present in each system from the combination.
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)
Alexandrov, A.M., Katz, B.A.: Non-Homogeneous Demands Flows Service. Izvestiya AN SSSR. Tekhnicheskaya Kibernetika (2), 47–53 (1973) (in Russian)
Tikhonenko, O.M.: Destricted Capacity Queueing Systems: Determination of their Characteristics. Autom. Remote Control 58(6), 969–972 (1997)
Tikhonenko, O.M., Klimovich, K.G.: Queuing Systems for Random-Length Arrivals with Limited Cumulative Volume. Problems of Information Transmission 37(1), 70–79 (2001)
Tikhonenko, O.M.: Generalized Erlang Problem for Service Systems with Finite Total Capacity. Problems of Information Transmission 41(3), 243–253 (2005)
Tikhonenko, O.M.: Queuing Systems with Processor Sharing and Limited Resources. Autom. Remote Control 71(5), 803–815 (2010)
Tikhonenko, O.: General Approach to Determination of Total Capacity for Queueing Systems with Non-Homogeneous Customers. In: Probability Theory, Mathematical Statistics and their Applications. The Collection of Scientific Papers (Proceedings of the International Conference in honor of 75 years Jubilee of Professor Gennady Medvedev. Minsk) RIVS, Minsk, pp. 338–343 (February 22–25, 2010)
Gaver, D.P.: Observing Stochastic Processes, and Approximate Transform Inversion. Operation Research 14(3), 444–459 (1966)
Stehfest, H.: Algorithm 368: Numeric Inversion of Laplace Transform. Communications of ACM 13(1), 47–49 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tikhonenko, O. (2011). Queueing Systems with Common Buffer: A Theoretical Treatment. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2011. Communications in Computer and Information Science, vol 160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21771-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-21771-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21770-8
Online ISBN: 978-3-642-21771-5
eBook Packages: Computer ScienceComputer Science (R0)