Parametric synthesis of statistical communication nets
- 1 April 1969
- journal article
- Published by American Mathematical Society (AMS) in Quarterly of Applied Mathematics
- Vol. 27 (1) , 105-120
- https://doi.org/10.1090/qam/256777
Abstract
The traffic within the branches of a communication network is often a random variable with an approximate multivariate normal distribution. The analysis of such systems has been discussed in a previous paper. In this paper, we consider the optimum synthesis problem. Nonlinear and linear programming is used to guarantee that a given flow rate probability between a specified pair of terminals is achieved. In particular, a Uniformly Most Powerful Statistical Test provides the basis for an optimum synthesis procedure that appears to be very efficient. The procedure is formulated as a concave program with quadratic and linear constraints.Keywords
This publication has 6 references indexed in Scilit:
- Parametric analysis of statistical communication netsQuarterly of Applied Mathematics, 1968
- On the optimum synthesis of statistical communication Nets-Pseudo parametric techniquesJournal of the Franklin Institute, 1967
- Minimum Cost Increase of the Terminal Capacities of a Communication NetworkIEEE Transactions on Communications, 1966
- Probabilistic Flows Through a Communication NetworkIEEE Transactions on Circuit Theory, 1965
- Optimization of communication nets with switchingJournal of the Franklin Institute, 1963
- The Greatest of a Finite Set of Random VariablesOperations Research, 1961