scispace - formally typeset
Search or ask a question

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


Journal ArticleDOI
01 Dec 1982-Networks
TL;DR: In this article, formulations are presented for a variety of centralized network design problems such as the minimal spanning tree problem, capacitated and degree constrained minimal spanning Tree problems, The Telpak problem, and, heterogeneousnetwork design problems.
Abstract: In recent years we have evidenced an extensive effort in the development of computer communication networks. One of the important aspects of the network design process is the solution of the topological design questions involved in establishing a communication network. In this article, formulations are presented for a variety of centralized network design problems such as the minimal spanning tree problem, capacitated and degree constrained minimal spanning tree problems, The Telpak problem, and, heterogeneous network design problems. The applicability of these formulations to algorithmic development is demonstrated by developing an efficient algorithm for solving the degree constrained minimal spanning tree problem. Computational results are reported for 630 test problems. A Bender's decomposition procedure is developed and tested for the capacitated minimal spanning tree problem with less favorable results.

260 citations


Journal ArticleDOI
TL;DR: This paper proposes two algorithms for obtaining approximate solutions to the discrete network design problem with much less computational effeort, by approximating the original problem with a new formulation which is easier to solve.
Abstract: The discrete network design problem is one of finding a set of feasible actions (projects) from among a collection of possible actions, that when implemented, optimizes some objective function(s). This is a combinatorial optimization problem that is very expensive to solve exactly. This paper proposes two algorithms for obtaining approximate solutions to the discrete network design problem with much less computational effeort. The computational savings are achieved by approximating the original problem with a new formulation which is easier to solve. The first algorithm proposed solves this approximate problem exactly, while the second is even more efficient, but provides only a near-optimal solution to the approximate problem. Experience with test problems indicates that these approximations can reduce the computational effort by a factor of 3–5, with little loss in solution accuracy.

161 citations


Journal ArticleDOI
TL;DR: In this article, an efficient design procedure is developed to yield resilient designs which handle fluctuations within the condition of maximum energy efficiency, and a control structure and operating policy are developed to adjust flow distributions in the network to meet temperature constraints with minimum utility usage.

97 citations


Proceedings ArticleDOI
01 Apr 1982
TL;DR: A single stage look-ahead scheme for predicting blockage is presented to enhance performance and a different method of adding links is shown that both improves performance and allows the network to tolerate two switching element or two link failures.
Abstract: The Inverse Augmented Data Manipulator (IADM) is a multistage interconnection network based on the Augmented Data Manipulator (ADM) and Feng's data manipulator. It is designed to be used in large-scale parallel/distributed processing systems for communication among processors, memories, and other system devices. Two aspects of IADM network design are discussed: performance and fault tolerance. A single stage look-ahead scheme for predicting blockage is presented to enhance performance. Next, one method of adding some links to the network to enable it to tolerate one link failure is described. Finally, a different method of adding links is shown that both improves performance and allows the network to tolerate two switching element or two link failures. Included is a new routing tag scheme that accommodates the new links.

52 citations


Journal ArticleDOI
TL;DR: In this paper, the authors investigated the relationship between aircraft technology and the structure of air service networks in short haul systems, based on an optimal frequency assignment model that is integrated with a route choice model.
Abstract: The relationship between aircraft technology and the structure of air service networks in short haul systems is investigated. The analysis is based on an optimal frequency assignment model that is integrated with a route choice model. Together these models allow the optimization of aircraft utilization and define an optimal network structure for a given demand pattern and aircraft technology. Large aircraft have a compelling advantage due to the scale economies they enjoy. Small aircraft, on the other hand, can offer level-of-service advantages and an opportunity for reducing the dependence on congested major transfer hubs in the network. A desirable technology development trend would be aimed at eliminating the diseconomies of distance suffered by small aircraft due to their limited payload-range characteristics.

30 citations


Journal ArticleDOI
TL;DR: This work describes the Bell System's special data characteristics and processing requirements in the network planning process and discusses the Kalman filter models, their statistical properties, the model identification process, and certain implementation considerations.
Abstract: The Bell System has recently completed studies that are expected to result in substantially improved forecasts for use in network planning. These improved forecasts are achieved through the use of new forecasting algorithms that employ Kalman filter models. To motivate the selection of Kalman filter forecasting procedures, we describe the Bell System's special data characteristics and processing requirements in the network planning process. We also discuss the Kalman filter models, their statistical properties, the model identification process, and certain implementation considerations.

28 citations


Journal ArticleDOI
Dan Schiller1

15 citations


Journal ArticleDOI
TL;DR: The simulation is intended to help both during the design phase of the network architecture in order to find an optimum design solution and subsequently, after implementation, to investigate trade-offs among various network configurations.

8 citations


Journal ArticleDOI
01 Apr 1982
TL;DR: This paper first examines the traffic conditions under which an open-chain model accurately predicts the mean end-to-end delays of a closed- chain model having the same chain throughputs, and considers the problem of optimally routing a small amount of incremental traffic corresponding to the addition of a new virtual channel to a network.
Abstract: Packet switching networks with flow-controlled virtual channels are naturally modeled as queueing networks with closed chains. Available network design and analysis techniques, however, are mostly based upon an open-chain queueing network model. In this paper, we first examine the traffic conditions under which an open-chain model accurately predicts the mean end-to-end delays of a closed-chain model having the same chain throughputs. We next consider the problem of optimally routing a small amount of incremental traffic corresponding to the addition of a new virtual channel (with a window size of one) to a network. We model the new virtual channel as a closed chain. Existing flows in the network are modeled as open chains. An optimal routing algorithm is then presented. The algorithm solves a constrained optimization problem that is a compromise between problems of unconstrained individual-optimization and unconstrained network-optimization.

6 citations


Journal ArticleDOI
TL;DR: The one-terminal network design problem considered here is to select a subset of the set of potential edges so as to minimize the sum of construction cost plus expected usage cost with discounting.

4 citations


Journal ArticleDOI
TL;DR: A novel algorithm for the computation of total service time in a packet-switched network is presented and analysed, and its adaptability to any network design without necessitating changes in the algorithm makes it a powerful tool for analysis.
Abstract: A novel algorithm for the computation of total service time in a packet-switched network is presented and analysed. Its adaptability to any network design without necessitating changes in the algorithm, in comparison to a simulation which would most likely require changes, perhaps extensive ones, in the program structure for each design, makes it a powerful tool for analysis. Further refinements in the algorithm are then discussed along with an easily constructed graphical representation that points out how they may be achieved. Results can be obtained regardless of the statistical distribution with which the message arrived at the source node. The exact service time is computed by the algorithm presented, as opposed to an approximation that characterizes the usage of the independence assumption in this class of problems. The algorithm uses a true-to-life model in deriving the results reported.

Journal ArticleDOI
TL;DR: A general standard form for feedback-free permutation networks is proposed and used to formulate the problem mathematically, and it is shown that there is evidence to suspect that the problem is in the class NPNP.
Abstract: The problem addressed is: Given a set of permutations of n objects, design a network consisting of 2-state switches which realizes the given permutations, and in which the number of switches is minimal. A general standard form for feedback-free permutation networks is proposed and used to formulate the problem mathematically. The complexity of an algorithm to solve the problem is studied, and it is shown that there is evidence to suspect that the problem is in the class NPNP.



Proceedings ArticleDOI
01 Apr 1982
TL;DR: A network that uses standard links to connect heterogeneous types of node to facilitate interprocess communication among multiple processes is described.
Abstract: This paper describes a network that uses standard links to connect heterogeneous types of node. The network is designed to facilitate interprocess communication among multiple processes. The ISO model is discussed, and the relationship between the network design and the standard is examined.

Journal ArticleDOI
TL;DR: In this paper, a model for computing short-run marginal costs including not only generation but also the interconnection network is developed, and the main problem can be decomposed into smaller subproblems and the optimal size of these sub-problems being the 3 nodes-problem.

Proceedings ArticleDOI
01 Oct 1982
TL;DR: The main contributions of this work are the development of approaches for designing networks that simultaneously satisfy performance requirements for different destruction scenarios and the architecture of a survivable, circuit-switched network.
Abstract: We address the problem of designing a circuit-switched network for voice communications operating in a military environment. The circuit-switched network design problem may be briefly stated as: given the topology, route tables and control discipline, end-to-end offered traffic and performance requirements, determine trunk group sizes such that the requirements are satisfied. One of the key requirements of a design is that the network be survivable, where survivability is based on different destruction scenario conditions. Our objective is to guarantee an acceptable level of performance for every node pair and under each of the different anticipated damage scenarios. The main contributions of our present work are the development of approaches for designing networks that simultaneously satisfy performance requirements for different destruction scenarios. We describe the architecture of a survivable, circuit-switched network. The key characteristics of the survivable network design problem are highlighted and differences with respect to classical trunk sizing problem are pointed out. An important aspect of our work is that the sizing is based on the logical topology of the network rather than its trunk group topology. One design approach, which we have used successfully, is presented in detail.