scispace - formally typeset
Search or ask a question

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



Journal ArticleDOI
TL;DR: A route selection algorithm is presented far designing transportation networks that balances fixed construction costs and variable user costs in a network having a fixed set of nodes and a known demand, for internode service.
Abstract: A route selection algorithm is presented far designing transportation networks. The algorithm balances fixed construction costs and variable user costs in a network having a fixed set of nodes and a known demand, for internode service. The problem solved is a special case of the fixed-cost, multicommodity transshipment problem in which each commodity has a single, unique source node. The route selection algorithm alternatively applies link elimination and link insertion criteria that converge to a local optimum. Upper and lower bounds on the fixed and variable portions of the globally optimum solution are determined and the sensitivity of the solution is estimated. Unique rules are formulated for identifying links that must or must not appear in the globally optimum solution. The solution procedure has been coded for a digital computer and demonstrated using a representation of Minneapolis-St. Paul having 68 nodes and 476 potential oneway links.

91 citations



Proceedings ArticleDOI
01 Jan 1973
TL;DR: The inadequacy of traditional adaptive policies in handling particular traffic situations is pointed out, and a new centralized adaptive policy is proposed, which combines the positive features of both deterministic and adaptive routing.
Abstract: Efficient routing policies are required for both design and operation of distributed, packet-switched computer networks. In the network design process, deterministic policies, which are time invariant, easy to analyze and simple to represent, are generally used. For the routing of packets in a real network, on the other hand, adaptive policies, which can adjust to traffic fluctuations and component failures are implemented. Therefore, a computer network is typically optimized with respect to a deterministic policy and then operated with an adaptive policy.In the first part of this paper the two policies are compared using analytical and simulation methods, and it is shown that, in uniform traffic situations, the flow patterns generated are very similar. This result justifies the use of deterministic policy in the design phase.In the second part of the paper, the inadequacy of traditional adaptive policies in handling particular traffic situations is pointed out. As a solution, a new centralized adaptive policy is proposed, which combines the positive features of both deterministic and adaptive routing. The feasibility of such centralized policy implementation on a real network, and its efficiency with respect to the traditional implementation is discussed.

42 citations


Proceedings ArticleDOI
M. Siddiquee1
01 Dec 1973
TL;DR: An outline of a computer program that systematically computes the various attributes of a route network is presented and enables a designer to compare quantitatively the various network design alternatives.
Abstract: Some simple mathematical models relating to various attributes of a route network are presented. These models include number and duration of potential conflicts, intersection and air route capacity, flight and route mileage, and intersection density. Using these models enables a designer to compare quantitatively the various network design alternatives. An outline of a computer program that systematically computes the various attributes is presented.

11 citations


Journal ArticleDOI
TL;DR: When operational networks are being designed, full consideration must be given to the legal, economic, social, and management factors as well as those that are purely technical.
Abstract: Computer networks and their communications support no longer present major technical problems. Today, many organizations are planning major networks in a very matter-of-fact way; often, however, giving little or no consideration to non-technical issues during the design phase. When operational networks are being designed, full consideration must be given to the legal, economic, social, and management factors as well as those that are purely technical.

10 citations


Proceedings ArticleDOI
01 Jan 1973
TL;DR: The computer system described in this paper aids the telecommunications manager in the management and design of voice and data networks built upon a relational data base comprised of sets of data describing the network terminals, communication channels, and traffics.
Abstract: The computer system described in this paper aids the telecommunications manager in the management and design of voice and data networks. It is built upon a relational data base comprised of sets of data describing the network terminals, communication channels, and traffics. A variety of standard reports, maps, charts, cost tables can easily be prepared from information in the data base. A hierarchy of processing programs access the data either in batch mode or interactively. At every step in the network design or management, manual interaction is possible to take full advantage of the manager's experience and intuition. The combination of computer calculation and manual guidance are illustrated with an example involving a large TELPAK network.

2 citations