• DocumentCode
    1358780
  • Title

    Highly Available Path Routing in Mesh Networks Under Multiple Link Failures

  • Author

    Yuan, Shengli ; Wang, Bin

  • Author_Institution
    Dept. of Comput. & Math. Sci., Univ. of Houston, Houston, TX, USA
  • Volume
    60
  • Issue
    4
  • fYear
    2011
  • Firstpage
    823
  • Lastpage
    832
  • Abstract
    We study the problem of maximizing path availability in mesh networks against simultaneous failures of multiple links without using protection schemes. The links belong to shared risk link groups (SRLGs) that have arbitrary failure probabilities. This problem is NP-hard, so we propose heuristic algorithms for networks with large numbers of SRLGs, as well as optimal solutions for networks with smaller numbers of SRLGs. The solutions are evaluated through simulations.
  • Keywords
    optimisation; telecommunication network routing; NP-hard problem; failure probabilities; heuristic algorithm; mesh networks; multiple link failures; path availability; path routing; protection schemes; shared risk link groups; Arrays; Availability; Heuristic algorithms; Mesh networks; Routing; Wavelength division multiplexing; Lightpath; mesh network; multiple failures; path availability; shared risk link group (SRLG);
  • fLanguage
    English
  • Journal_Title
    Reliability, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9529
  • Type

    jour

  • DOI
    10.1109/TR.2011.2171097
  • Filename
    6058640
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1358780