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

Network design for the estimation of areal mean of rainfall events

Abstract: This work recognizes rainfall as a multidimensional stochastic process. By using the knowledge of such processes and of multivariate estimation theory a procedure for designing an optimal network to obtain the areal mean precipitation of an event over a fixed area is developed. The methodology used in this problem allows consideration of the following aspects of network design: (1) spatial uncertainty and correlation of process, (2) errors in measurement techniques and their correlation, and (3) non-homogeneous sampling costs. Optimal networks are given in terms of the number and location of stations together with the resulting cost and mean square error of rainfall estimation.

An Analysis and Comparison of Behavioral Assumptions in Traffic Assignment

Abstract: This paper compares modeling of traffic flow on networks in such a manner that total user cost is minimized with the modeling of flow so that an equilibrium is achieved. A detailed comparison of the output from these two models is presented for a 76 arc, 24 node sketch planning network used to model the city of Sioux Falls, South Dakota. The results indicate that the difference between the two sets of flows is small enough to justify the simplifying assumption that total user cost is minimized. Such an assumption is often made in network design or link addition models to achieve computational ease, particularly in the context of multiple objectives.

Centralized teleprocessing network design

Abstract: The problem considered is that of finding an optimal (minimum cost) design for a centralized processing network given a set of locations, traffic magnitudes between these locations, and a single common source or destination. Several heuristics, which are efficient (in terms of their execution time and memory requirements on a digital computer) and which produce seemingly good results, have already been developed and are currently accepted techniques. Some work has also been done on finding optimal solutions to this problem both as a design tool and as a means of verifying the effectiveness of proposed heuristics. We focus on this latter area. Currently known techniques for the optimal solution of this problem via integer programming have fallen short of the desired objectives as they require too much memory and running time to be able to treat problems of realistic size and complexity. We develop an improved technique which is capable of handling more realistic problems.

Design and Optimization of Ground-Water Monitoring Networks for Pollution Studiesa

Abstract: The successful design and operation of a ground-water monitoring and surveillance system are based on a stepwide process of obtaining hydrogeologic information Because of the inherent uncertainty and inhomogeneity of natural hydrogeological systems, the true monitoring network cannot be specified before some basic knowledge about system configuration and dynamics is known Forethought, planning and incorporation of design criteria as part of the initial phase of project management establishes the monitoring network strategy Optimization of the monitoring network takes place through the completion of the following five phases: (1) preliminary network design and information gathering, (2) initial installation and testing, (3) completion and verification, (4) operational, and (5) project termination Experience gained from monitoring the conditions at the University of Minnesota's chemical and special waste disposal site resulted in the design and optimization procedure Concern for possible ground-water contamination led to analysis of surface and subsurface, physical and chemical conditions Subsequently a monitoring system was established to meet project objectives No degradation of the ground water was found during the five-year study

A communications system simulation for a network displaying circuit-switching, message-switching, and packet service

Abstract: This paper describes a computer based simulation which models a network comprised of switching nodes capable of supporting circuit-switching, message-switching and packet-switching. The paper contains three major elements: description of the variable parameters which can be exercised to give insight into the simulated network performance, and some conclusions of the simulation.The specific model is structured into three elements: (1) Traffic Generator,(2) Network Simulator, and(3) Statistics Report.The Simulation model, written in GPSS can represent an hierarchical network or, alternately, a non-hierarchical network. Each model is comprised of all nodes serving as circuit-switches, with a small number of arbitrarily selected nodes acting as message-switch facilities and/or packet-switch facilities. Traffic introduced is comprised of voice calls, message traffic, and packet traffic. Signalling and supervision, and routing plans are evaluated as part of the simulation analysis. Insight into network control information, throttling points, relative queue lengths, and call/message connect - delivery times are derived.

A heuristic teleprocessing network design technique

Abstract: A technique is presented for designing teleprocessing networks on the basis of weighted heuristic partitions of the network nodes. The partitions group the nodes on the basis of common internodal design characteristics related to traffic flow, geographical location, delay and reliability requirements. Weights incorporated into the partition selection process permit adaptive adjustment of the design system based on actual experience gained in designing networks.

The perturbation matrix and its applications in network design

Abstract: If a perturbed network or system is described by the sum of the matrix describing the original network and a perturbation matrix, then the shifts in the natural frequencies can be conveniently calculated and studied. In this paper the method of calculating the shifts in the eigenvalues of a perturbed matrix is given and the perturbation matrices of same types of perturbations are derived. The method is then used to formulate a set of simultaneous equations relating the eigenvalue shifts to the variations in the network elements. These equations form the basis of an efficient computer programme that is used in various network esign problems.