This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals
July 1978 (vol. 27 no. 7)
pp. 594-604
D.T. Tang, IBM Thomas J. Watson Research Center
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.
Index Terms:
weighted bipartite graphs, Algorithms, communication network optimization, integer programming, plant location, teleprocessing system configuration
Citation:
D.T. Tang, L.S. Woo, L.R. Bahl, "Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals," IEEE Transactions on Computers, vol. 27, no. 7, pp. 594-604, July 1978, doi:10.1109/TC.1978.1675159
Usage of this product signifies your acceptance of the Terms of Use.