A linear program model for the automation of network management
- 1 May 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 6 (4) , 742-750
- https://doi.org/10.1109/49.1947
Abstract
A linear program model is developed to represent the problem of real-time control of traffic in an overloaded circuit-switched network. Circuit groups and exchanges are modeled approximately as saturating devices. Circuit groups saturate with respect to carried traffic, and exchanges saturate with respect to the rate of attempts served. A linear objective function is chosen. Methods for the size of the linear program model are introduced, and techniques for computing its solution are described. The solution of the linear program is in the form of quotas for all the streams of call attempts entering the network. Detailed call-by-call routing decisions are devolved to individual nodes or regional network management centersKeywords
This publication has 6 references indexed in Scilit:
- On the Decomposition of Large Communication Networks for Hierarchical Control ImplementationIEEE Transactions on Communications, 1986
- Control algorithms for out‐of‐chain routing in a telephone networkElectronics and Communications in Japan (Part I: Communications), 1984
- Servicing and Real-Time Control of Networks With Dynamic RoutingBell System Technical Journal, 1981
- Design and Optimization of Networks With Dynamic RoutingBell System Technical Journal, 1981
- Network Management and Congestion in the U.S. Telecommunications NetworkIEEE Transactions on Communications, 1981
- Application of Learning Automata to Telephone Traffic Routing and ControlIEEE Transactions on Systems, Man, and Cybernetics, 1977