Minimum Cost Design for Circuit Switched Networks.

Abstract

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.

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1973
Accession Number
ADA014101

Entities

People

  • J. E. Knepley

Organizations

  • Defense Information Systems Agency

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Switching

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.
  • Regression Analysis.
  • Tactical Satellite Communications Systems Engineering.