|
Problemy Peredachi Informatsii, 2005, Volume 41, Issue 3, Pages 105–122
(Mi ppi110)
|
|
|
|
This article is cited in 3 scientific papers (total 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].
Received: 30.11.2004 Revised: 17.03.2005
Citation:
B. S. Tsybakov, “Busy Periods in Systems with Heterogeneous Servers or Channels”, Probl. Peredachi Inf., 41:3 (2005), 105–122; Problems Inform. Transmission, 41:3 (2005), 280–295
Linking options:
https://www.mathnet.ru/eng/ppi110 https://www.mathnet.ru/eng/ppi/v41/i3/p105
|
Statistics & downloads: |
Abstract page: | 416 | Full-text PDF : | 164 | References: | 54 | First page: | 2 |
|