Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals

1 July 1978

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-27 (7), 594-604
https://doi.org/10.1109/tc.1978.1675159

Abstract

In this paper we consider the optimization of teleprocessing (TP) networks with concentrators. Each terminal may in general have multiple connections to several concentrators. The first part of the paper is concerned with the optimal assignment of terminals to a given set of concentrators. A sequential assignment algorithm is presented with its efficiency and optimality established. The second part of the paper is concerned with the optimal number and location of the concentrators to be installed. A generalized "ADD" algorithm is suggested. It is shown that the total cost function is convex with respect to the nwnber of concentrators installed in such an algorithm.

Keywords

This publication has 10 references indexed in Scilit:

An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
Management Science, 1972
The Transportation-Location Problem
Operations Research, 1972
Optimum concentrator location in telecommunications design
Published by Association for Computing Machinery (ACM) ,1972
Optimal design of centralized computer networks
Networks, 1971
A Graph-Theoretic Approach to a Class of Integer-Programming Problems
Operations Research, 1969
A branch‐bound algorithm for the capacitated facilities location problem
Naval Research Logistics Quarterly, 1969
Algorithms for the Simple Plant-Location Problem with Some Side Conditions
Operations Research, 1969
Warehouse Location Under Continuous Economies of Scale
Management Science, 1966
A Heuristic Program for Locating Warehouses
Management Science, 1963
A primal‐dual algorithm for the capacitated Hitchcock problem
Naval Research Logistics Quarterly, 1957

Cited by 16 articles