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

Probl. Peredachi Inf., 2005 Volume 41, Issue 3, Pages 105–122 (Mi ppi110)

This article is cited in 3 papers

Communication Network Theory

Busy Periods in Systems with Heterogeneous Servers or Channels

B. S. Tsybakovab

a Institute for Information Transmission Problems, Russian Academy of Sciences
b Qualcomm Inc.

Abstract: We consider a multiple communication channel system having channels with different transmission rates. We give a solution for the problem (of interest for such a system) of finding the probability densities and probability distribution functions of the $N$-busy period length. A solution in the case of identical channels (servers) was given in [1].

UDC: 621.394.74:519.2

Received: 30.11.2004
Revised: 17.03.2005


 English version:
Problems of Information Transmission, 2005, 41:3, 280–295

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026