Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Finding multiple routing paths in wide-area WDM networks

Simple item page
dc.contributor.authorLiang, Weifa
dc.contributor.authorShen, Xiaojun
dc.date.accessioned2015-12-13T22:52:07Z
dc.date.issued2005
dc.date.updated2015-12-11T10:49:11Z
dc.description.abstractIn 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 version is proposed, which takes O(kK(kn+m+nlog(kn))) time and delivers an exact solution, where n, m, and k are the number of nodes, links and wavelengths in the network, respectively. The second version of the problem is shown to be NP-hard, instead an approximation algorithm is devised which delivers a solution within K times of the optimum, where K≥2.
dc.identifier.issn0140-3664
dc.identifier.urihttp://hdl.handle.net/1885/81413
dc.publisherElsevier
dc.sourceComputer Communications
dc.subjectKeywords: Algorithms; Approximation theory; Combinatorial mathematics; Optimization; Problem solving; Robustness (control systems); Routers; Theorem proving; Wide area networks; Approximation algorithms; Combinatorial optimization; Multiple routing paths; WDM optic Combinatorial optimization; WDM opticla networks robust routing
dc.titleFinding multiple routing paths in wide-area WDM networks
dc.typeJournal article
local.bibliographicCitation.issue7
local.bibliographicCitation.lastpage818
local.bibliographicCitation.startpage811
local.contributor.affiliationLiang, Weifa, College of Engineering and Computer Science, ANU
local.contributor.affiliationShen, Xiaojun, University of Missouri
local.contributor.authoruidLiang, Weifa, u9404892
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor080799 - Library and Information Studies not elsewhere classified
local.identifier.ariespublicationMigratedxPub9708
local.identifier.citationvolume28
local.identifier.doi10.1016/j.comcom.2005.01.009
local.identifier.scopusID2-s2.0-17644419620
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Liang_Finding_multiple_routing_paths_2005.pdf
Size:
251.52 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS

abcd