IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements

Listed author(s):
  • Kyungchul Park


    (Telecommunication Network Research Lab., Korea Telecom, Wha-am-dong, Yusong-gu, Taejon, 305-348, Korea)

  • Kyungsik Lee


    (Electronics and Telecommunication Research Institute, 161 Kajong-dong, Yusong-gu, Taejon, 305-350, Korea)

  • Sungsoo Park


    (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Gusong-dong, Yusong-gu, Taejon, 305-701, Korea)

  • Heesang Lee


    (Department of Industrial Engineering, Hankuk University of Foreign Studies, 89 Mohyun-ri, Wangsan-myun Yongin-gun, Kyunggi-do 449-791, Korea)

Registered author(s):

    We consider the node clustering problem that arises in designing a survivable two-level telecommunication network. The problem simultaneously determines an optimal partitioning of the whole network into clusters (local networks) and hub locations in each cluster. Intercluster traffic minimization is chosen as the clustering criterion to improve the service quality. Various constraints on the clustering are considered which reflect both the physical structures of local networks, such as the connectivity requirement, and the node compatibility relations such as community of interest or policy. Additional constraints may be imposed on the hub selection to ensure network survivability. We propose an integer programming formulation of the problem by decomposing the entire problem into a master problem and a number of column generation problems. The master problem is solved by column generation and the column generation problems by branch-and-cut. We develop and use strong cutting-planes for the cluster generation subproblems. Computational results using real data are reported.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: no

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 46 (2000)
    Issue (Month): 3 (March)
    Pages: 363-374

    in new window

    Handle: RePEc:inm:ormnsc:v:46:y:2000:i:3:p:363-374
    Contact details of provider: Postal:
    7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA

    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Web page:

    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    1. Kyungchul Park & Seokhoon Kang & Sungsoo Park, 1996. "An Integer Programming Approach to the Bandwidth Packing Problem," Management Science, INFORMS, vol. 42(9), pages 1277-1291, September.
    2. Lee, Kyungsik & Park, Kyungchul & Park, Sungsoo & Lee, Heesang, 1998. "Economic spare capacity planning for DCS mesh-restorable networks," European Journal of Operational Research, Elsevier, vol. 110(1), pages 63-75, October.
    3. Chung, Sung-hark & Myung, Young-soo & Tcha, Dong-wan, 1992. "Optimal design of a distributed network with a two-level hierarchical structure," European Journal of Operational Research, Elsevier, vol. 62(1), pages 105-115, October.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:46:y:2000:i:3:p:363-374. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.