A large hierarchical network star - star topology design algorithm

The hierarchical communication network design includes solving problems like the concentrator quantity problem, the concentrator location problem and the assignment problem. Many algorithms have been proposed to solve these particular problems. The two latter problems are NP—hard and no optimal solution of these problems has been found for large networks. In this paper we present a high complexity algorithm for star—star network topology design which solves all three problems for several hierarchy levels simultaneously and finds a superior solution in a reasonable time even for large networks with a few thousand terminals due to a new and quick assignment algorithm. The computational results showed that our assignment algorithm is superior to “Simulated annealing” and “Tabu search”.

[1]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[2]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[3]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[4]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[5]  Subhash Suri,et al.  Designing Minimum Cost Nonblocking Communication Networks , 1996 .

[6]  Fred W. Glover,et al.  Tabu search for graph partitioning , 1996, Ann. Oper. Res..

[7]  Hasan Pirkul,et al.  Locating concentrators for primary and secondary coverage in a computer communications network , 1988, IEEE Trans. Commun..

[8]  Hong-Chan Chang,et al.  Network reconfiguration in distribution systems using simulated annealing , 1994 .

[9]  Eugenio Costamagna,et al.  Heuristic algorithms for reliable multiplexed network design , 1997, Eur. Trans. Telecommun..

[10]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[11]  Fred W. Glover,et al.  Using tabu search to solve the Steiner tree-star problem in telecommunications network design , 1996, Telecommun. Syst..

[12]  Roshan Lal Sharma.  Network Topology Optimization , 1990 .

[13]  P. McGregor,et al.  Network Design: An Algorithm for the Access Facility Location Problem , 1977, IEEE Trans. Commun..

[14]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .

[15]  B. M. Khumawala,et al.  An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem , 1977 .

[16]  G. Michael Schneider,et al.  An Algorithm for the Design of Multilevel Concentrator Networks , 1982, Comput. Networks.

[17]  Chi-Chun Lo,et al.  A two-phase algorithm and performance bounds for the star-star concentrator location problem , 1989, IEEE Trans. Commun..

[18]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[19]  Andranik Mirzaian,et al.  Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds , 1985, Networks.

[20]  Richard T. Wong,et al.  A constrained Steiner tree problem , 1995 .