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

Probl. Peredachi Inf., 1969 Volume 5, Issue 2, Pages 53–60 (Mi ppi1800)

Servicing Several Flows by Fully Accessible Clusters with Relative Priority of Servicing and Restricted Queueing

V. A. Kokotushkin, D. G. Mikhalev


Abstract: We shall consider the systems $M_k|M|1\leq c<\infty|f_1{}^0$ and $M_k|M|1\leq c<\infty|r<\infty|f_1{}^2$ The priority $f_1{}^0$ denotes relative priority for servicing and an absence of priority for entering the queue; $f_1{}^2$ denotes relative priority for servicing and absolute priority in entering the queue. For the first system recursive relationships are given for the state probabilities in the steady-state regime. For the second system formulas are obtained for the loss probabilities and for the average waiting and residence times in the system.

UDC: 621.395.34

Received: 08.04.1968


 English version:
Problems of Information Transmission, 1969, 5:2, 40–46

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024