Abstract
A single-server queueing system with bounded buffer, Poisson flow, and gamma service time distribution is studied. Limiting values of certain performance indexes for unboundedly increasing service time variation coefficient are determined and approximate formulas for the performance characteristics of the system for large variation coefficients are derived.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Vishnevskii, V.M., Teoreticheskie osnovy proektirovaniya komp'yuternykh setei (Theoretical Principles of Computing Network Design), Moscow: Tekhnosfera, 2003.
Basharin, G.P., Bocharov, P.P., and Kogan, Ya.A., Analiz ocheredei v vychislitel'nykh setyakh. Teoriya i metody rascheta (Analysis of Queues in Computing Networs. Theory and Methods of Computation), Moscow: Nauka, 1989.
Tenyakshev, A.M. and Osin, A.V., Fraktal'nye protsessy v telekommunikatsiyakh (Fractal Processes in Telecommunication), Shelukhin, O.I., Ed., Moscow: Radiotekhnika, 2003.
Bocharov, P.P. and Pechinkin, A.V., Teoriya massovogo obsluzhivaniya (Queueing Theory), Moscow: Ross. Univ. Druzhby Narodov, 1995.
Bocharov, P.P., D'Apice, C., Pechinkin, A.V., and Salerno, S., Queueing Theory, Utrecht-Boston: VSP, 2004.
Author information
Authors and Affiliations
Additional information
__________
Translated from Avtomatika i Telemekhanika, No. 11, 2005, pp. 89–98.
Original Russian Text Copyright © 2005 by Bocharov.
Rights and permissions
About this article
Cite this article
Bocharov, P.P. A MAP/Γ/1/r System with a Large Service Time Variation Coefficient. Autom Remote Control 66, 1782–1790 (2005). https://doi.org/10.1007/s10513-005-0212-0
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10513-005-0212-0