Telecommunication Systems

, Volume 14, Issue 1–4, pp 197–217 | Cite as

Design of local networks using USHRs

  • Donghan Kang
  • Kyungsik Lee
  • Sungsoo Park
  • Kyungchul Park
  • Sang‐Baeg Kim


We consider the problem of designing a local network in a two‐level telecommunication network. Given one or two hub nodes, central offices (COs) and conduits, the problem is to find a set of unidirectional self‐healing rings (USHRs) which covers all COs and satisfies all demands at minimum cost. The solution approach used is the decomposition and column generation. Master problem and subproblem are modeled as integer programming models. After the optimal solution to linear programming relaxation of the master problem is obtained, a branch‐and‐bound algorithm is used to get an integer solution. A set of valid inequalities for a subproblem is given and a branch‐and‐cut algorithm is used to find an optimal solution to the subproblem. Computational results using real data are reported.


Travel Salesman Problem Travel Salesman Problem Local Network Column Generation Master Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    E. Balas, The prize collecting traveling salesman problem, Networks 19 (1989) 621–636.Google Scholar
  2. [2]
    E. Balas, The prize collecting traveling salesman problem: II. Polyhedral results, Networks 25 (1995) 199–216.Google Scholar
  3. [3]
    C. Barnhart, Johnson, G.L. Nemhauser, M.W.P. Savelsbergh and P.H. Vance, Branch-and-price: Column generation for solving huge integer programs, in: Mathematical Programming: State of the Art, eds. J.R. Birge and K.G. Murty (1994) pp. 186–207.Google Scholar
  4. [4]
    S. Cosares, D.L. Deutsch, I. Saniee and O.J. Wasem, SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks, Interfaces 25(1) (1995) 20–40.Google Scholar
  5. [5]
    S. Cosares and I. Saniee, An optimization problem related to balancing loads on SONET rings, Telecommunication Systems 3 (1994) 165–181.CrossRefGoogle Scholar
  6. [6]
    M. Fischetti, J.J.S. González and P. Toth, The symmetric generalized traveling salesman polytope, Networks 26 (1995) 113–123.Google Scholar
  7. [7]
    D. Gusfield, Very simple method for all pairs network flow analysis, SIAM Journal on Computing 19 (1990) 143–155.CrossRefGoogle Scholar
  8. [8]
    E.L. Johnson, A. Mehrotra and G.L. Nemhauser, Min-cut clustering, Mathematical Programming 62 (1993) 133–151.CrossRefGoogle Scholar
  9. [9]
    M. Laguna, Clustering for the design of SONET rings in interoffice telecommunication, Management Science 40 (1994) 1533–1541.CrossRefGoogle Scholar
  10. [10]
    K. Lee, K. Park and S. Park, Ring loading problem with integer demand splitting, Technical Report # 96-003, Dept. of I.E., KAIST (1996).Google Scholar
  11. [11]
    G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).Google Scholar
  12. [12]
    K. Park, K. Lee, S. Park and H. Lee, Telecommunication node clustering with node compatibility and network survivability requirements, Management Science 46 (2000) 363–374.CrossRefGoogle Scholar
  13. [13]
    M. Pedberg and G. Renaldi, A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problem, SIAM Review 33 (1991) 60–100.CrossRefGoogle Scholar
  14. [14]
    J.B. Slevinsky, W.D. Grover and M.H. MacGregor, An algorithm for survivable network design employing multiple self-healing rings, in: IEEE GLOBECOM-93 (1993) pp. 1568–1573.Google Scholar
  15. [15]
    J. Suurballe and R. Tarjan, A quick method of finding shortest pairs of disjoint paths, Networks 14 (1984) 325–336.Google Scholar
  16. [16]
    O.J. Wasem, An algorithm for designing rings in survivable fiber networks, IEEE Transactions on Reliability 40 (1991) 428–432.CrossRefGoogle Scholar
  17. [17]
    T.H. Wu, Fiber Network Service Survivability (Artech House, 1992).Google Scholar
  18. [18]
    T.H. Wu and R.C. Lau, A class of self-healing ring architectures for SONET network applications, in: IEEE GLOBECOM-90 (1990) pp. 403.2.1–403.2.8.Google Scholar

Copyright information

© Kluwer Academic Publishers 2000

Authors and Affiliations

  • Donghan Kang
    • 1
  • Kyungsik Lee
    • 2
  • Sungsoo Park
    • 1
  • Kyungchul Park
    • 3
  • Sang‐Baeg Kim
    • 4
  1. 1.Department of Industrial EngineeringKorea Advanced Institute of Science and TechnologyTaejonKorea
  2. 2.ETRITaejonKorea
  3. 3.Telecommunication Network LabKorea TelecomTaejonKorea
  4. 4.Telecommunication Network LabKorea TelecomTaejonKorea

Personalised recommendations