On the optimum synthesis of statistical communication Nets-Pseudo parametric techniques
✍ Scribed by H. Frank; S.L. Hakimi
- Publisher
- Elsevier Science
- Year
- 1967
- Tongue
- English
- Weight
- 743 KB
- Volume
- 284
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
✦ Synopsis
In a communication network, the existing trafic within the branches is not deterministic. As part of the synthesis problem, it is necessary to determine the probability that a particular flow rate can be attained between a given pair of stations. If this probability is inadequate, we must improve the net with minimum cost. This paper o$ers an approach based on the assumption that the branch flows are observable but their probability distributiolzs are unknown. An analysis technique that uses statistical hypothesis testing is developed.
Following the statistical analysis procedure, a synthesis technique is presented which is optimum in the sense that the net is improved at minimum cost while the statistical errors in the procedure are controlled. The synthesis procedure utilizes linear integer programming and seems to be feasible for reasonably "large" communication networks.