Change search
ReferencesLink to record
Permanent link

Direct link
Resource-efficient path-protection schemes and online selection of routes in reliable WDM networks
University of Texas at Dallas.ORCID iD: 0000-0002-5636-9910
The University of Texas at Dallas. (OPNEAR Laboratory)
The University of Texas at Dallas. (OPNEAR Laboratory)
2004 (English)In: Journal of Optical Networking, ISSN 1536-5379, Vol. 3, no 4, 188-203 p.Article in journal (Refereed) Published
Abstract [en]

Feature Issue on Next-Generation WDM Network Design and Routing (WDMN) The optimal choice of routing and wavelength assignment (RWA) for the working and protection path-pair of the newly generated demand request is often a complex problem in reliable wavelength-division-multiplexed (WDM) networks subject to dynamic traffic. The challenge is twofold: how to provide the required reliability level without over-reserving network resources and how to find a good solution of the RWA problem under constrained computational time. Two important contributions are made. First, the shared path protection (SPP) switching scheme is generalized to guarantee the required (differentiated) level of reliability to all arriving demands, while, at the same time, ensuring that they contain the required amount of reserved network resources. This generalization is referred to as SPP-DiR. Second, an approach for choosing the working and protection path-pair routing for the arriving demand is proposed. The approach is based on a matrix of preselected path-pairs: the disjoint path-pair matrix (DPM). Results show that, when the SPP-DiR scheme is applied, a small reduction in demand reliability corresponds to a significant reduction of the required network resources, when compared with the conventional SPP. In turn, the demand blocking probability may be reduced more than one order of magnitude. It is also shown that the DPM approach is suitable for obtaining satisfactory RWA solutions in both SPP-DiR and conventional SPP networks. The use of the DPM is most suited when the time for solving the RWA problem is constrained, e.g., when demand requests must be served swiftly.

Place, publisher, year, edition, pages
2004. Vol. 3, no 4, 188-203 p.
Keyword [en]
Fiber optics and optical communications, Networks, Optical communications
National Category
URN: urn:nbn:se:kth:diva-78651DOI: 10.1364/JON.3.000188OAI: diva2:492722

QC 20120305

Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2016-06-22Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Monti, Paolo
In the same journal
Journal of Optical Networking

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 37 hits
ReferencesLink to record
Permanent link

Direct link