Search: onr:"swepub:oai:DiVA.org:kth-79247" >
The disjoint path-p...
The disjoint path-pair matrix approach for online routing in reliable WDM networks
-
- Tacca, Marco (author)
- The University of Texas at Dallas,OPNEAR Laboratory
-
- Monti, Paolo (author)
- The University of Texas at Dallas,OPNEAR Laboratory
-
- Fumagalli, Andrea (author)
- The University of Texas at Dallas,OPNEAR Laboratory
-
(creator_code:org_t)
- 2004
- 2004
- English.
-
In: 2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7. - 0780385330 ; , s. 1187-1191
- Related links:
-
https://urn.kb.se/re...
-
show more...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- 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.
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
Keyword
- 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
Publication and Content Type
- ref (subject category)
- kon (subject category)
Find in a library
To the university's database