Telecommunication node clustering with node compatibility and network survivability requirements

Management Science

Volumn 46, Issue 3, 2000, Pages 363-374

  Park, Kyungchul ^a   Lee, Kyungsik ^a   Park, Sungsoo ^a   Lee, Heesang ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; ELECTRIC NETWORK TOPOLOGY; INTEGER PROGRAMMING; RESOURCE ALLOCATION; TELECOMMUNICATION TRAFFIC;

BRANCH AND CUT; COLUMN GENERATION; NETWORK SURVIVABILITY REQUIREMENTS; NODE COMPATIBILITY; TELECOMMUNICATION NODE CLUSTERING;

TELECOMMUNICATION NETWORKS;

EID: 0033873682     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.46.3.363.12066     Document Type: Article

References (26)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ.
2. Barnhart, C., E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, P. H. Vance. 1994. Branch-and-price: Column generation for solving huge integer programs. J. R. Birge, K. G. Murty, eds. Mathematical Programming: State of the Art. University of Michigan, Ann Arbor, MI.
3. Chung S. H., Y. S. Myung, D. W. Tcha. 1992. Optimal design of a distributed network with a two-level hierarchical structure. European J. of Oper. Res. 62 105-115.
4. Coan, R. A., W. E. Leland, M. P. Vecchi, A. Weinrib, T. U. Wu. 1991. Using distributed topology update and preplanned configurations to achieve trunk network survivabiliry. IEEE Trans. Reliability 40 404-416.
5. Conforti, M., M. R. Rao, A. Sassano. 1990a. The equipartition polytope I: Formulations, dimension, and basic facets. Math. Programming 49 49-70.
6. _ 1990b. The equipartition polytope II: Formulations, valid inequalities and facets. Math. Programming 49 71-90.
7. Flanagan, T. 1991. Fiber network survivability. IEEE Communications Magazine (June), 46-53.
8. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability. W. H. Freeman and Company, San Francisco, CA.
9. Gavish, B., H. Pirkul. 1986. Computer and database location in distributed computer systems. IEEE Trans. Comput. C-35 583-590.
10. Gilmore, P. C., R. E. Gomory. 1961. A linear programming approach to the cutting-stock problem. Oper. Res. 9 849-859.
11. Grover, W. D. 1987. The self-healing network: A fast distributed restoration technique for networks using digital crossconnect machines. Proceedings on IEEE Global Telecommunication Conference, Tokyo, Japan.
12. Helme, M. P., T. L. Magnanti. 1989. Designing satellite communication networks by zero-one quadratic programming. Networks 19 427-450.
13. Johnson, E. L., A. Mehrotra, G. L. Nemhauser. 1993. Min-cut clustering. Math. Programming 62 133-152.
14. Kim, J. G., D. W. Tcha. 1992. Optimal design of a two-level hierarchical network with tree-star configuration. Comput. I.E. 22 273-281.
15. Laguna, M. Clustering for the design of SONET rings in interoffice telecommunications. Management Sci. 40 1533-1541.
16. Lee, C. H., H. Y. Ro, D. W. Tcha. 1993. Topological design of a two-level network with ring-star configuration. Comput. Oper. Res. 20 625-637.
17. Lee, K., K. Park, S. Park, H. Lee. 1998. Economic spare capacity planning for DCS mesh-restorable networks. European J. Oper. Res. 110 63-75.
18. _, _, _ 1996a. Design of capacitated networks with tree configurations. Telecommunication Systems 6 1-19.
19. Lee, Y., B. H. Lim, J. S. Park. 1996b. A hub location problem in designing digital data service networks: Lagrangian relaxation approach Location Sci. 4 185-194.
20. Mirzaian, A. 1985. Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds Networks 15 1-20.
21. Padberg, M. 1989. The Boolean quadric polytope: Some characteristics, facets and relatives. Math. Programming (Series B) 45 139-172.
22. _, G. Rinaldi. 1991. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33 60-100.
23. Park, K., S. Kang, S. Park. 1996a. An integer programming approach to the bandwidth packing problem. Management Sci. 42 1277-1291.
24. _, K. Lee, S. Park. 1996b. An extended formulation approach to the edge-weighted maximal clique problem. European J. Oper. Res. 95 671-682.
25. _, _, _. 1994. Polyhedral results on the extended node packing polytope. Working paper KAIST, Taejon, Korea.
26. Wu, T-H. 1992. Fiber Network Service Survivability. Artech House Inc., Norwood, MA.