Finding multiple routing paths in wide-area WDM networks

Weifa Liang, Xiaojun Shen

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Abstract

    In this paper the multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semi-lightpaths from a source to a destination such that the K paths meet some specified optimization objectives if they exist. Two versions of the problem are studied One is to minimize the total cost of the K paths. Another is to minimize the cost of the maximum cost path among the K paths. An efficient algorithm for the first version is proposed, which takes O (kK (kn + m + n log(kn))) time and delivers an exact solution, where n, m, and k are the number of nodes, links and wavelengths in the network. The second version of the problem is shown to be NP-hard, and an approximate algorithm for it is devised, delivering an approximate solution that is K times the optimum, where K ≥ 2.

    Original languageEnglish
    Title of host publicationProceedings - International Conference on Parallel Processing Workshops, ICPPW 2002
    EditorsStephan Olariu
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages199-206
    Number of pages8
    ISBN (Electronic)0769516807
    DOIs
    Publication statusPublished - 2002
    EventInternational Conference on Parallel Processing Workshops, ICPPW 2002 - Vancouver, Canada
    Duration: 18 Aug 200221 Aug 2002

    Publication series

    NameProceedings of the International Conference on Parallel Processing Workshops
    Volume2002-January
    ISSN (Print)1530-2016

    Conference

    ConferenceInternational Conference on Parallel Processing Workshops, ICPPW 2002
    Country/TerritoryCanada
    CityVancouver
    Period18/08/0221/08/02

    Fingerprint

    Dive into the research topics of 'Finding multiple routing paths in wide-area WDM networks'. Together they form a unique fingerprint.

    Cite this