TECHNIQUES FOR THE CONSTRAINED OPTIMIZATION OF COMMUNICATION NETS
Abstract
The synthesis of ordinary linear graph models of communication nets whose elements are constrained in capacity, interconnection, and cost is covered. An optimal synthesis is identified as a minimum-cost realization of arbitrarily specified requirements on terminal capacity and topological structure. In particular, three classes of communication nets are considered. Wire nets, possessing communication links of finite capacity, are characterized by graphs whose branches are weighted to reflect this capacity. A method is given that yields models of this class at minimum cost. Radio nets, with communication centers of finite capacity, are described by graphs whose nodes are correspondingly weighted. A technique is developed that generates models of this class, also at minimum cost. Mixed Nets, composed of communication centers and links, each with limited capacities, are represented by graphs with weighted nodes and branches. A procedure is proposed that leads to minimum-cost realizations for graphs whose node costs are uniform. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 15, 1962
- Accession Number
- AD0276916
Entities
People
- Louis Philip Costa
Organizations
- Air Force Cambridge Research Laboratories