Wavelength Rerouting in Survivable WDM Networks
dc.contributor.author | Liang, Weifa | |
dc.contributor.author | Wan, Yingyu | |
dc.coverage.spatial | Waterloo Canada | |
dc.date.accessioned | 2015-12-13T23:01:48Z | |
dc.date.available | 2015-12-13T23:01:48Z | |
dc.date.created | May 2-6 2005 | |
dc.date.issued | 2005 | |
dc.date.updated | 2015-12-12T07:42:45Z | |
dc.description.abstract | One limitation of all-optical WDM networks is the wavelength continuity constraint imposed by all-optical cross-connect switches that requires the same wavelength be used on all the links along a path. With random arrivals and departures of connection requests, it happens quite often that a new request has to be blocked due to the fact that there are not enough available resources (e.g. wavelength) to accommodate the request. Wavelength rerouting, a viable and cost-effective method, which rearranges the wavelengths on certain existing routes to free a wavelength continuous route for the new request, has been proposed to improve the blocking probability. In this paper, we study a wavelength rerouting problem in survivable WDM networks as follows. Given a connection request, the problem is to find two link-disjoint paths from the source node to the destination node with an objective to minimize the number of existing routes that have to be wavelength-rerouted. We show that the problem is NP-hard if different wavelengths are assigned to the link-disjoint paths. Otherwise, a polynomial time algorithm is proposed. | |
dc.identifier.isbn | 0302-9743 | |
dc.identifier.uri | http://hdl.handle.net/1885/84592 | |
dc.publisher | Springer | |
dc.relation.ispartofseries | International IFIP-TC6 Networking Conference 2005 | |
dc.source | NETWORKING 2005: 4th International IFIP-TC6 Networking Conference, Waterloo, Canada, May 2-6, 2005. Proceedings | |
dc.subject | Keywords: Algorithms; Computational complexity; Cost effectiveness; Optical communication; Optical switches; Polynomials; Problem solving; Telecommunication networks; Wavelength division multiplexing; Cross-connect switches; Polynomial time algorithm; Wavelength re | |
dc.title | Wavelength Rerouting in Survivable WDM Networks | |
dc.type | Conference paper | |
local.bibliographicCitation.lastpage | 442 | |
local.bibliographicCitation.startpage | 431 | |
local.contributor.affiliation | Liang, Weifa, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Wan, Yingyu, College of Engineering and Computer Science, ANU | |
local.contributor.authoremail | u9404892@anu.edu.au | |
local.contributor.authoruid | Liang, Weifa, u9404892 | |
local.contributor.authoruid | Wan, Yingyu, u4105173 | |
local.description.notes | Imported from ARIES | |
local.description.refereed | Yes | |
local.identifier.absfor | 080799 - Library and Information Studies not elsewhere classified | |
local.identifier.ariespublication | MigratedxPub12871 | |
local.identifier.scopusID | 2-s2.0-24944476266 | |
local.identifier.uidSubmittedBy | Migrated | |
local.type.status | Published Version |