Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
In the paper, we investigate multi-server closed queueing systems with identical servers and a finite number of terminals. Requests from each terminal are characterized by a random space requirement (volume), the request service time doesn’t depend on its volume and has an exponential distribution. The total requests capacity in the system is limited by a positive value (buffer space memory volume) V. For such systems, stationary requests number distribution and loss probability are determined. The analogous results for open multi-server systems are obtained as a limit case. Some numerical results are attached as well.
Rocznik
Tom
Strony
117--125
Opis fizyczny
Bibliogr. 6 poz., rys.
Twórcy
autor
- Faculty of Mathematics and Natural Sciences, College of Sciences Cardinal Stefan Wyszyński University in Warsaw Warsaw, Poland
autor
- Faculty of Mathematics and Natural Sciences, College of Sciences Cardinal Stefan Wyszyński University in Warsaw Warsaw, Poland
Bibliografia
- [1] Tikhonenko O., Probability Methods of Information System Analysis, Akademicka Oficyna Wydawnicza EXIT, Warsaw 2006 (in Polish).
- [2] Tikhonenko O.M., Queueing Models in Information Systems, Universitrtskoe, Minsk 1990 (in Russian).
- [3] Bocharov P.P., D’Apice C., Pechinkin A.V., Salerno S., Queueing Theory, VSP, Utrecht-Boston 2004.
- [4] Gnedenko B. V., Kovalenko I. N., Introduction to Queueing Theory, Birkhäuser, Boston 1989.
- [5] Breuer L., Baum D., An Introduction to Queueing Theory and Matrix-Analytic Methods, Springer, 2005.
- [6] Feller W., An Introduction to Probability Theory and its Applications. Vol. 2. Wiley, New York 1971.
Uwagi
Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-44ace8a2-82d2-4832-afbd-28431969d3d6