|
Problemy Peredachi Informatsii, 1995, Volume 31, Issue 1, Pages 99–111
(Mi ppi269)
|
|
|
|
Communication Network Theory
Recurrence Method for Teletraffic Evaluation in Serial-Parallel Telecommunication Nets
A. V. Klimov, S. A. Kolbasyuk, V. I. Neiman
Abstract:
The paper discusses serial-parallel telecommunication nets formed by pooling several collective channels into a bundle of channels. Each channel in the bundle can be independently used and reused in various spatial sections. An exact recurrence method for calculating state probabilities of the system is developed. Using these probabilities one can obtain an explicit expression for the capacity of a bundle of channels as a function of given blocking probabilities. The peculiarities of the method for a single channel and for a bundle of channels as well as for subscriber and trunk channels are described.
Received: 11.04.1994
Citation:
A. V. Klimov, S. A. Kolbasyuk, V. I. Neiman, “Recurrence Method for Teletraffic Evaluation in Serial-Parallel Telecommunication Nets”, Probl. Peredachi Inf., 31:1 (1995), 99–111; Problems Inform. Transmission, 31:1 (1995), 86–97
Linking options:
https://www.mathnet.ru/eng/ppi269 https://www.mathnet.ru/eng/ppi/v31/i1/p99
|
Statistics & downloads: |
Abstract page: | 378 | Full-text PDF : | 142 |
|