An nth rank radia-ring network with two centers-poles connected to radial channels with n ring nodes, each of which is connected to the channels of adjacent ring node-is investigated. The probability of failure of channels is arbitrary and their transmission capacitates are integers. An analytical method (of computational complexity dependent on the network rank) for determining the distribution of the maximal flow between pole is developed. The computational complexity is constant if channels of identical purpose have identical parameters. If the capacity of radical channels is a multiple of the capacity of ring channels, an analytical expression for the expectation with error O (n{sub}(-1)) is derived.
展开▼
