• DocumentCode
    117261
  • Title

    Genetic algorithm for solving Survivable Network Design Problem with Extending-Cycle-Based Protected Working Capacity Envelope

  • Author

    Khac Tuan Le ; Thi Thanh Binh Huynh

  • Author_Institution
    Sch. of Inf. & Commun. Technol., Hanoi Univ. of Sci. & Technol., Hanoi, Vietnam
  • fYear
    2014
  • fDate
    July 30 2014-Aug. 1 2014
  • Firstpage
    250
  • Lastpage
    255
  • Abstract
    The study of protection and prevention against failures is an important problem in communication networks due to the growth of capacity demands for data transmission, especially in the Internet traffic. In this paper, we consider the Survivable Network Design Problem (SNDP) with Protected Working Capacity Envelope (PWCE) called capacity SNDP (ca-SNDP) in which a network topology is modeled by a weighted and undirected graph. The weight of each edge is maximum capacity bandwidth of this edge. A working network (Wn) and a backup network (Bn) will be constructed from this topology. Design survivable network with maximum total bandwith in Wn is objective of ca-SNDP. This paper proposes Extending Cycle (EC) model and genetic algorithm for solving ca-SNDP. We experimented and evaluated the effectiveness of proposed aprroach for solving survivable network design problem.
  • Keywords
    Internet; genetic algorithms; graph theory; telecommunication network topology; telecommunication traffic; Bn; EC model; Internet traffic; PWCE; SNDP; Wn; backup network; communication networks; data transmission; extending cycle; genetic algorithm; network topology; protected working capacity envelope; solving survivable network design problem; undirected graph; weighted graph; working network; Bandwidth; Bellows; Network topology; Topology; Extending Cycle; Genetic Algorithm; Survivable Network Design Problem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Nature and Biologically Inspired Computing (NaBIC), 2014 Sixth World Congress on
  • Conference_Location
    Porto
  • Print_ISBN
    978-1-4799-5936-5
  • Type

    conf

  • DOI
    10.1109/NaBIC.2014.6921887
  • Filename
    6921887