• DocumentCode
    2389483
  • Title

    Load balancing heuristics for dynamic establishment of restorable lightpaths

  • Author

    Luo, Haibo ; Ruan, Lu

  • Author_Institution
    Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA
  • fYear
    2002
  • fDate
    14-16 Oct. 2002
  • Firstpage
    472
  • Lastpage
    477
  • Abstract
    Efficient lightpath provisioning for dynamic traffic is an important issue in WDM optical networks. Meanwhile, in order for a lightpath to survive a network failure, both a primary lightpath and a backup lightpath need to be found for each demand. A demand is blocked if either cannot be provided. We identify 2 blocking types, and then three heuristic ideas are proposed to exploit the wavelength usage information and to use link channels more evenly across the network, leading to a lower blocking probability. Simulation shows that the load balancing routing algorithm (LBA), with our heuristic cost functions for primary path selection and backup path selection, achieves performance comparable to that of the centralized algorithm (CA). However, LBA asks for much less information to be disseminated, and therefore is more scalable.
  • Keywords
    optical fibre networks; probability; telecommunication network routing; telecommunication traffic; wavelength division multiplexing; WDM networks; WDM optical networks; blocking probability; centralized algorithm; dynamic lightpath establishment; heuristic cost functions; link channels; load balancing algorithm; network failure; restorable lightpaths; routing algorithm; wavelength usage information; Computer science; Cost function; Load management; Optical fiber communication; Optical fiber networks; Protection; Routing; Telecommunication traffic; WDM networks; Wavelength division multiplexing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communications and Networks, 2002. Proceedings. Eleventh International Conference on
  • ISSN
    1095-2055
  • Print_ISBN
    0-7803-7553-X
  • Type

    conf

  • DOI
    10.1109/ICCCN.2002.1043108
  • Filename
    1043108