Skip navigation
Skip navigation

Finding multiple routing paths in wide-area WDM networks

Liang, Weifa; Shen, Xiaojun

Description

In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpaths from a source to a destination, if they exist, such that they meet some specified optimization objective. Two versions of the problem are studied. One is to minimize the total cost of the K paths, and the other is to minimize the cost of the maximum cost one among the K paths. An efficient algorithm for the first...[Show more]

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
URI: http://hdl.handle.net/1885/81413
Source: Computer Communications
DOI: 10.1016/j.comcom.2005.01.009

Download

File Description SizeFormat Image
01_Liang_Finding_multiple_routing_paths_2005.pdf251.52 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator