• DocumentCode
    422477
  • Title

    A new heuristic for finding the shortest path with a disjoint counterpart

  • Author

    Xu, Dahai ; Chen, Yang ; Qiao, Chunming

  • Author_Institution
    Dept. of Comput. Sci. & Eng., State Univ. of New York, USA
  • Volume
    2
  • fYear
    2004
  • fDate
    23-27 Feb. 2004
  • Abstract
    We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.
  • Keywords
    IP networks; heuristic programming; optical fibre networks; telecommunication network routing; wavelength division multiplexing; IP networks; Min-Min problem; WDM networks; disjoint backup path; heuristic algorithm; shared path protection; shortest active path;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Optical Fiber Communication Conference, 2004. OFC 2004
  • Conference_Location
    Los Angeles, CA, USA
  • Print_ISBN
    1-55752-772-5
  • Type

    conf

  • Filename
    1362091
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=422477