Minimum Cost Design for Circuit Switched Networks.

摘要

A computer algorithm is developed to design near-minimum-cost, nonhierarchical switched communications networks. The algorithm assumes that the network busy hour traffic model, network tariff structures, and other related cost data are available, and that locations for all candidate switching centers are known. A method is discussed for selecting the most-effective locations for switching centers. Computer implementation details, applications, and results are provided.