Combination of Queueing Systems of Different Types with Common Buffer: A Theoretical Treatment
In the paper, we investigate a combination of two following different queueing systems connected via common limited buffer space: (1) the system of M / G / 1-type, in which service time does not depend on demand volume; (2) the processor-sharing system, in which demand length arbitrarily depends on its volume. For such combination, we determine the steady-state loss probability and distribution of number of demands present in each system of the combination.
KeywordsQueueing system Demand volume Total demands capacity Buffer space capacity Processor-sharing system
- 1.Tikhonenko, O.M.: Queueing Models in Computer Systems. Universitetskoe, Minsk (1990, in Russian)Google Scholar
- 2.Tikhonenko, O.: Computer Systems Probability Analysis. Akademicka Oficyna Wydawnicza EXIT, Warsaw (2006, in Polish)Google Scholar
- 3.Alexandrov, A.M., Katz, B.A.: Non-homogeneous Demands Flows Service. Izvestiya AN SSSR. Tekhnicheskaya Kibernetika, No. 2, 47–53 (1973, in Russian)Google Scholar
- 10.Bocharov, P.P., D’Apice, C., Pechinkin A.V., Salerno, S.: Queueing Theory. VSP, Utrecht-Boston (2004)Google Scholar