Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
The disjoint path-pair matrix approach for online routing in reliable WDM networks
The University of Texas at Dallas. (OPNEAR Laboratory)
The University of Texas at Dallas. (OPNEAR Laboratory)ORCID iD: 0000-0002-5636-9910
The University of Texas at Dallas. (OPNEAR Laboratory)
2004 (English)In: 2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, Vol. 2, 1187-1191 p.Conference paper, Published paper (Refereed)
Abstract [en]

In reliable wavelength division multiplexed (WDM) networks, the optimal choice of routing and wavelength assignment (RWA) for the working and protection path-pair is often a complex problem to solve. To cope with such problem complexity, this paper presents the disjoint path-pair matrix (DPM) approach. With the DPM approach, the RWA problem complexity - i.e., the size of the solution space - can be significantly reduced by limiting the number of candidate path-pairs considered in the optimization. Simulation results are collected using the DPM approach to solve the online RWA problem in a network based on the shared path protection switching scheme with differentiated reliability. When compared to the conventional k-shortest paths approach, the DPM approach requires up to one order of magnitude less candidate path-pairs. In addition, the DPM approach finds solutions with reduced hop length of both the working and protection paths by up to 3% and 14%, respectively.

Place, publisher, year, edition, pages
2004. Vol. 2, 1187-1191 p.
Keyword [en]
RWA problem complexity; disjoint path-pair matrix approach; k-shortest paths approach; online routing; protection path-pair; reliable WDM networks; routing and wavelength assignment; shared path protection switching scheme; wavelength division multiplexed networks; computational complexity; optical fibre networks; telecommunication network reliability; telecommunication network routing; telecommunication switching; wavelength division multiplexing;
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-79247DOI: 10.1109/ICC.2004.1312687ISI: 000223459600234Scopus ID: 2-s2.0-4143135518ISBN: 0-7803-8533-0 (print)OAI: oai:DiVA.org:kth-79247DiVA: diva2:495282
Conference
IEEE International Conference on Communications (ICC 2004). Paris, FRANCE. JUN 20-24, 2004
Note

QC 20120228

Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2016-05-12Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Monti, Paolo

Search in DiVA

By author/editor
Monti, Paolo
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 19 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf