• DocumentCode
    459481
  • Title

    Logical Topology Design for WDM Networks Using Survivable Routing

  • Author

    Jaekel, A. ; Bandyopadhyay, S. ; Aneja, Y.

  • Author_Institution
    University of Windsor, Windsor, Canada N9B 3P4. arunita@uwindsor.ca
  • Volume
    6
  • fYear
    2006
  • fDate
    38869
  • Firstpage
    2471
  • Lastpage
    2476
  • Abstract
    Survivable routing of a logical topology ensures that the lightpaths are routed in such a way that a single link failure does not disconnect the network. However, even if the network remains connected after a failure, there is no guarantee that the resulting logical topology will be able to support the required traffic. In this paper, we introduce a new approach that integrates the logical topology design and survivable routing problems. When a topology is generated using our approach, it is guaranteed to have a survivable routing. We further ensure that the topology is able to handle the entire traffic demand, for any single link failure. We have formulated an ILP that optimally designs a survivable logical topology, and also proposed a fast heuristic which can be used for large networks.
  • Keywords
    NP-complete problem; Network topology; Partitioning algorithms; Protection; Sufficient conditions; Telecommunication traffic; WDM networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing; WDM networks; logical topology design; survivable routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2006. ICC '06. IEEE International Conference on
  • Conference_Location
    Istanbul
  • ISSN
    8164-9547
  • Print_ISBN
    1-4244-0355-3
  • Electronic_ISBN
    8164-9547
  • Type

    conf

  • DOI
    10.1109/ICC.2006.255150
  • Filename
    4024546