• DocumentCode
    507814
  • Title

    An Evolutionary Approach for Survivable Network under SRLG Constraints

  • Author

    Sun, Yueheng ; Sun, Jianyong ; Zhang, Qingfu

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Tianjin Univ., Tianjin, China
  • Volume
    4
  • fYear
    2009
  • fDate
    14-16 Aug. 2009
  • Firstpage
    122
  • Lastpage
    126
  • Abstract
    In this paper, a hierarchical evolutionary approach is proposed for an NP-complete telecommunication problem- all optical WDM mesh network survivability under shared-rish-link-group (SRLG) constraints. A parameterized greedy heuristic is proposed at first to construct solutions of the telecommunication problem. A specific estimation of distribution algorithm (EDA) searches for optimal parameters of the greedy heuristic, and thereafter to construct the optimal solution. Experimental results show that the proposed approach performs significantly better than the best-known evolutionary-based algorithm in 25 out of 30 test instances in terms of solution quality and CPU times.
  • Keywords
    evolutionary computation; greedy algorithms; optimisation; search problems; NP-complete telecommunication problem; SRLG constraints; WDM mesh network survivability; distribution algorithm; evolutionary approach; evolutionary-based algorithm; parameterized greedy heuristic; shared-rish-link-group constraints; survivable network; All-optical networks; Computer networks; Computer science; Electronic design automation and methodology; Mesh networks; Optical computing; Sun; Testing; WDM networks; Wavelength division multiplexing; SRLG constraints; estimation of distribution algorithm; evolutionary algorithm; survivable network;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Natural Computation, 2009. ICNC '09. Fifth International Conference on
  • Conference_Location
    Tianjin
  • Print_ISBN
    978-0-7695-3736-8
  • Type

    conf

  • DOI
    10.1109/ICNC.2009.739
  • Filename
    5363238