Abstract
Topological design of centralized computer communication networks is a complex problem that is generally solved in two phases. The first phase of the design process involves dividing network nodes (terminals or clusters of terminals) into groups, and selecting a concentrator location for each group so that all the nodes in a group are assigned to the same concentrator. The next phase determines topology of links that connect network nodes to concentrators and concentrators to each other and to the central computer. The design problem studied in this paper contains some aspects of both phases. In this problem locations of concentrators, assignments of user nodes to concentrators and the topology of the links connecting concentrators to the central computer are jointly determined. The proposed design method is built around the well known sweep heuristic which is used to partition the node space into sectors. Each of these sectors contain a “backbone” path connecting concentrators to the central computer.
Similar content being viewed by others
References
V. Ahuja,Design and Analysis of Computer Communication Networks (McGraw-Hill, New York, 1982).
J. Barcelo and J. Casanovas, A heuristic Lagrangian algorithm for the capacitated plant location problem, Europ. J. Oper. Res. 15 (1984) 212–226.
M.S. Bazaara and J.J. Goode, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, Europ. J. Oper. Res. 3 (1979) 322–338.
R.R. Boorstyn and H. Frank, Large-scale network topological optimization, IEEE Trans. Commun. COM-25 (1977) 29–46.
J.R. Current, C. Revelle and J.L. Cohon, The hierarchical network design problem, Europ. J. Oper. Res. 27 (1986) 57–66.
J.R. Current, C. Revelle and J.L. Cohon, The median shortest path problem: a multiobjective approach to analyze cost vs. accessibility in the design of transportation networks, Transp. Sci. 3 (1987) 188–197.
J.R. Current and H. Pirkul, The hierarchical network design problem with transshipment facilities, Europ. J. Oper. Res. 52 (1991) 338–347.
E.W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269–271.
H.G. Dysart and N.D. Georganas, NEWCLUST: an algorithm for the topological design of two-level, multidrop teleprocessing networks, IEEE Trans. Commun. COM-26 (1978) 55–61.
D. Erlenkotter, A dual based procedure for uncapacitated facility location, Oper. Res. 26 (1978) 992–1009.
E. Feldman, F.A. Lehrer and T.L. Ray, Warehouse location under continuous economies of scale, Manag. Sci. 12 (1966) 670–684.
M.L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11 (1981) 109–124.
M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Manag. Sci. 27 (1981) 1–18.
R.W. Floyd, Algorithm 97: shortest path, Commun. ACM 5 (1962) 345.
R.L. Francis and P. Mirchandani,Discrete Location Theory (Wiley, 1990).
B. Gavish, Topological design of centralized computer networks — formulations and algorithms, Networks 12 (1982) 355–377.
B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Commun. COM-33 (1985) 1247–1257.
B. Gavish and H. Pirkul, Computer and database location in distributed computer systems, IEEE Trans. Comput. C-35 (1986) 583–590.
A.M. Geoffrion and R. McBride, Lagrangian relaxation applied to capacitated facility location problems, AIIE Trans. 10 (1978) 40–47.
B.E. Gillett and L.R. Miller, A heuristic algorithm for the vehicle dispatch problem, Oper. Res. 22 (1974) 340–349.
B. Golden, L. Bodin, T. Doyle and W. Stewart, Jr., Approximate travelling salesman algorithms, Oper. Res. 28 (1980) 694–711.
M. Held and R.M. Karp, The travelling salesman problem and minimum spanning trees, Oper. Res. 18 (1970) 1138–1162.
M. Held, P. Wolfe and H.P. Crowder, Validation of subgradient optimization, Math. Progr. 6 (1974) 62–88.
J.G. Klincewicz and H. Luss, A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints, J. Oper. Res. Soc. 37 (1986) 495–500.
A.A. Kuehn and M.J. Hamburger, A heuristic program for locating warehouses, Manag. Sci. 9 (1963) 643–666.
P. McGregor and D. Shen, Network design: an algorithm for access facility location problem, IEEE Trans. Commun. COM-25 (1977) 61–73.
A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: approximation algorithm and bounds, Networks 15 (1985) 1–20.
A.W. Neebe and M.R. Rao, An algorithm for the fixed-charge assigning users to sources problem, J. Oper. Res. Soc. 34 (1983) 1107–1113.
H. Pirkul, an integer programming model for the allocation of databases in a distributed computer system, Europ. J. Oper. Res. 26 (1986) 3.
H. Pirkul, Efficient algorithms for the capacitated concentrator location problem, Comput. Oper. Res. 14 (1987) 197–208.
H. Pirkul, S. Narasimhan and P. De, Locating concentrators for primary and secondary coverage in a computer communication network, IEEE Trans. Commun. COM-36 (1988) 450–458.
H. Pirkul, J.R. Current and V. Nagarajan, The hierarchical network design problem: a new formulation and solution procedures, Transp. Sci. 25 (1991) 175–182.
H. Pirkul and S. Narasimhan, Hierarchical concentrator location problem, Comp. Commun. (1991) forthcoming.
G.M. Schneider and M.N. Zastrow, An algorithm for the design of multilevel concentrator networks, Comput. Networks 6 (1982) 1–11.
R.L. Sharma and M.T. El-Baradi, Suboptimal communication network synthesis, in:Proc. Int. Conf. on Communications (1970) pp. 19.11–19.16.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pirkul, H., Nagarajan, V. Locating concentrators in centralized computer networks. Ann Oper Res 36, 247–261 (1992). https://doi.org/10.1007/BF02094332
Issue Date:
DOI: https://doi.org/10.1007/BF02094332