Topological design of telecommunication networkslocal access design methods
 Bezalel Gavish
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Computer communication networks and telecommunication systems are growing at an explosive rate. Some of the major factors influencing this phenomenal growth rate have been technology driven, deregulation of the telecommunication industry and the breakup of AT&T, product and service introductions and competition, new application areas, price reductions and improved services. Corporations have discovered how to use telecommunicationbased systems and computer networks as a strategic competitive weapon. Modern computer networks consist of backbone networks which serve as major highways to transfer large volumes of communication traffic, and local access networks which feed traffic between the backbone network and end user nodes. The design of the local access network is a complex process which builds on many difficult combinatorial optimization problems. This paper surveys many of the problems, presents the state of the art in solving them, and demonstrates a variety of solution procedures. The paper concludes with a list of open problems and areas open for further investigation.
 K. Altinkemer, Parallel savings heuristic for designing multicenter tree networks,Proc. HICSS22 (1989), pp.762–769.
 K. Altinkemer and B. Gavish, Parallel savings heuristic for the delivery problem, Oper. Res., in print.
 Altinkemer, K., Gavish, B. (1987) Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. 6: pp. 149158
 Altinkemer, K., Gavish, B. (1988) Heuristics with constant error guarantees for the design of tree networks. Manag. Sci. 34: pp. 331341
 K. Altinkemer and B. Gavish, Heuristics for equal weight delivery problems with constant error guarantees, Transp. Sci., in print.
 Beasley, J.E. (1983) Route firstcomponent second methods for vehicle routing. Omega 11: pp. 403408
 Boorstyn, R.R., Frank, H. (1977) Large scale network topological optimization. IEEE Trans. Comm. COM25: pp. 2947
 Camerini, P.M., Galbiati, G., Maffioli, F. (1980) Complexity of spanning tree problems: Part 1. Eur. J. Oper. Res. 5: pp. 346352
 Camerini, P.M., Galbiati, G., Maffioli, F. (1983) On the complexity of finding multiconstrained spanning trees. Discr. Appl. Math. 5: pp. 3950
 Chandy, K.M., Lo, T. (1973) The capacitated minimum tree. Networks 3: pp. 173182
 Chandy, K.M., Russell, K.M. (1972) The design of multipoint linkages in a teleprocessing tree network. IEEE Trans. Comm. COM21: pp. 10621066
 N. Christofides, Worstcase analysis of a new heuristic for the traveling salesman problem, Report No. 388, Graduate School of Industrial Administration, CarnegieMellon University (Feb. 1976).
 Christofides, N., Mingozzi, A., Toth, P. (1979) The vehicle routing problem. Combinatorial Optimization. Wiley, New York
 Christofides, N., Mingozzi, A., Toth, P. (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Progr. 20: pp. 255282
 Eilon, S., Christofides, N. (1971) The loading problem. Manag. Sci. 17: pp. 259268
 Elias, D., Ferguson, M.J. (1974) Topological design of multipoint teleprocessing networks. IEEE Trans. Comm. COM22: pp. 17531762
 Esau, L.R., Williams, K.C. (1966) On teleprocessing system design. IBM Syst. J. 5: pp. 142147
 Gavish, B. (1982) Topological design of centralized computer networks — formulations and algorithms. Networks 12: pp. 355377
 Gavish, B. (1983) Formulations and algorithms for the capacitated minimal directed tree. J. ACM 30: pp. 118132
 B. Gavish, The delivery problem — new cutting plane procedures,TIMS 26th Int. Meeting, Copenhagen (1984).
 Gavish, B. (1985) Augmented Lagrangian based algorithms for centralized network design. IEEE Trans. Comm. COM33: pp. 12471257
 B. Gavish, Topological design of computer communication networks — the overall design problem, Eur. J. Oper. Res., to be published.
 B. Gavish, Topological design and capacity assignment in computer communication networks, Working Paper, Owen Graduate School of Management (1990).
 B. Gavish and K. Altinkemer, A parallel savings heuristic for the topological design of local access tree networks,Proc. IEEEINFOCOM'86 (1986), pp. 130–139.
 B. Gavish, C.L. Li and D. SimchiLevi, Analysis of heuristics for the design of tree networks, Ann. of Oper. Res., to be published.
 Goldstein, M.C. (1973) Design of longdistance telecommunication networks — the Telepak problem. IEEE Trans. Circuit Theory CT20: pp. 186192
 Haimovich, M., Rinnooy Kan, A. (1985) Bounds and heuristics for capacitated routing problems. Math. Oper. Res. 10: pp. 527542
 E. Hansler, A heuristic configuration procedure for cost minimal communication networks, IBM Research Report RZ666 (1974).
 Johnson, D.B. (1977) Shortest paths in dense networks. J. ACM 24: pp. 113
 Karnaugh, M. (1976) A new class of algorithms for multipoint network optimization. IEEE Trans. Comm. COM24: pp. 500505
 Kershenbaum, A., Chou, W. (1974) A unified algorithm for designing multidrop teleprocessing networks. IEEE Trans. Comm. COM22: pp. 17621772
 Kershenbaum, A., Boorstyn, R., Oppenheim, R. (1980) Second order greedy algorithms for centralized teleprocessing network design. IEEE Trans. Comm. COM28: pp. 18351838
 Kershenbaum, A., Boorstyn, R. (1983) Centralized teleprocessing network design. Networks 13: pp. 279293
 Kruskal, J.B. (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc. 7: pp. 4850
 Li, C.L., SimchiLevi, D. (1989) Analysis of heuristcs for the multidepot capacitated vehicle routing problems. Department of Industrial Engineering and Operations Research, Columbia University, New York
 McGregor, P.M., Shen, D. (1977) Network design: An algorithm for access facility location problems. IEEE Trans. Comm. COM25: pp. 6173
 Mirzaian, A. (1985) Lagrangian relaxation for the starstar concentrator location problem: Approximation algorithm and bounds. Networks 15: pp. 120
 Mole, R.H., Johnson, D.G., Wells, K. (1983) Combinatorial analysis for route firstcomponent second vehicle routing. Omega 11: pp. 507512
 Papadimitriou, C.H. (1978) The complexity of the capacitated tree problem. Networks 8: pp. 217230
 Pirkul, H. (1987) Efficient algorithms for the capacitated concentrator location problem. Comp. Oper. Res. 14: pp. 197208
 Pirkul, H., Narasimhan, S., De, R. (1988) Locating concentrators for primary and secondary coverage in a computer communication network. IEEE Trans. Comm. COM36: pp. 450458
 Prim, R.C. (1957) Shortest connection networks and some generalizations. Bell. Syst. Tech. J. 36: pp. 13891401
 Rosenkrantz, D., Sterns, R., Lewis, P. (1977) An analysis of several heuristics for the traveling salesman problem. SIAM J. Comp. 6: pp. 563581
 Rothfarb, B., Goldstein, M.C. (1971) The oneterminal Telepak problem. Oper. Res. 19: pp. 156169
 Schneider, G.M., Zastrow, M.N. (1982) An algorithm for the design of multilevel concentrator networks. Comp. Networks 6: pp. 111
 Sharma, R.L. (1983) Design of an economical multidrop network topology with capacity constraints. IEEE Trans. Comm. COM31: pp. 590591
 Title
 Topological design of telecommunication networkslocal access design methods
 Journal

Annals of Operations Research
Volume 33, Issue 1 , pp 1771
 Cover Date
 19910101
 DOI
 10.1007/BF02061657
 Print ISSN
 02545330
 Online ISSN
 15729338
 Publisher
 Baltzer Science Publishers, Baarn/Kluwer Academic Publishers
 Additional Links
 Topics
 Industry Sectors
 Authors

 Bezalel Gavish ^{(1)}
 Author Affiliations

 1. Owen Graduate School of Management, Vanderbilt University, 37203, Nashville, TN, USA