Showing papers on "Network planning and design published in 1972"

Practical Least pth Optimization of Networks

Abstract: A new and practical approach to computer-aided design optimization is presented. Central to the process is the application of least pth approximation using extremely large values of p, typically 1000 to 1 000 000. It is shown how suitable and reasonably well conditioned objective functions can be formulated, giving particular emphasis to more general approximation problems as, for example, in filter design. It is demonstrated how easily and efficiently extremely near minimax results can be achieved on a discrete set of sample points. Highly efficient gradient methods can be employed and, in network design problems, the use of the adjoint network approach for evaluating gradients results in greater savings in computer effort. A comparison between the Fletcher-Powell method and the more recent Fletcher method is made on the application of least pth approximation, using a range of values of p up to 1 000 000 000 000 on transmission-line transformer problems for which optimal minimax solutions are known. This is followed by filter design examples subject to certain constraints.

A Transform for NAND Network Design

Abstract: A transform that operates on the interconnection topology of a NAND network is presented. The output connecting a designated gate to the network is deleted and is connected instead to a number of other gates in the network. The entire transform may be specified by designating a "transformed gate" and a "modified gate." The new connections are made and the resulting network is then simplified logically by casting out redundancy and merging gates in the network.

The design of large-scale networks

Abstract: The application of computer techniques to difficult large-scale network problems is discussed. The physical characteristics of two types of systems are described--computer-communication networks and cable television distribution systems. Two fundamental algorithms are presented, and applications to routing, reliability, and design of computer networks are given. The detailed engineering decisions that can be made by computer in the design of practical large-scale networks are illustrated by example for cable television systems. These examples are chosen to indicate the richness and difficulty of the problem of applying computers to network design.

Minimum cost-reliable computer communication networks

Abstract: A designer of a computer-communications network must consider the reliability of a given network design as a function of its realization costs. Although there is an abundance of graph theoretic and queuing tools that have generated algorithms for the topological synthesis and analysis of large networks, it is unfortunate that the reliability and cost dimensions of the problem have not been satisfactorily related.

Optimum concentrator location in telecommunications design

Abstract: This paper discusses the problem of the allocation of concentrators in the initial phases of telecommunications design. A model for this problem is presented in which the trade-off between line cost and the number of concentrators can be examined. An approach to obtaining a solution for this formulation involves minimum k-cover configurations, for which an efficient algorithm is presented.

Computer-Aided Traffic/Airway/VOR(TAC) Network Methodologies. Part 1. Techniques of Air Route Network Design (Tasks 1, 2 and 3)

Abstract: : The objectives were the development of a systematic methodology and associated computer programs for the optimal design of a national network of high-altitude RNAV air routes. The report presents various techniques, models, and associated computer programs.