RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2001 Volume 37, Issue 1, Pages 78–88 (Mi ppi510)

This article is cited in 16 papers

Communication Network Theory

Analysis of Queuing Systems for Random-Length Arrivals with Limited Cumulative Volume

O. M. Tikhonenko, K. G. Klimovich


Abstract: Two queuing systems for variable-length customers, namely, a processor-sharing system and a multiline system without waiting places, are considered, for which arrivals are completely random, the joint arrival-length and service-time distribution is arbitrary, and the cumulative arrival volume is limited. For these systems, the stationary state probabilities and the arrival loss probability are determined.

UDC: 621.3947:519.872

Received: 12.05.2000


 English version:
Problems of Information Transmission, 2001, 37:1, 70–79

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024