SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-79017"
 

Search: onr:"swepub:oai:DiVA.org:kth-79017" > A wavelength sharin...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

A wavelength sharing and assignment heuristic to minimize the number of wavelength converters in resilient WDM networks

Billenahalli, Shreejith (author)
The University of Texas at Dallas
Razo, Miguel (author)
The University of Texas at Dallas
Huang, Wanjun (author)
The University of Texas at Dallas
show more...
Sivasankaran, Arularasi (author)
The University of Texas at Dallas
Tang, Limin (author)
The University of Texas at Dallas
Vardhan, Hars (author)
The University of Texas at Dallas
Monti, Paolo (author)
KTH,Fotonik,NEGONET
Tacca, Marco (author)
The University of Texas at Dallas,OPNEAR Laboratory
Fumagalli, Andrea (author)
The University of Texas at Dallas,OPNEAR Laboratory
show less...
 (creator_code:org_t)
2009
2009
English.
In: Proceedings of the 2009 7th International Workshop on the Design of Reliable Communication Networks, DRCN 2009. - 9781424450473 ; , s. 319-326
  • Conference paper (peer-reviewed)
Abstract Subject headings
Close  
  • With the successful introduction of reconfigurable optical add-drop multiplexers (ROADMs) and related technologies, WDM networks are now growing in the number of optical nodes, wavelengths, and lambda services supported. In addition, shared path protection mechanisms - whereby lambda services are allowed to share protection wavelength channels - are possible at the optical (WDM) layer. Efficient strategies must be devised to both determine the set of services that must share a common protection wavelength channel and assign wavelengths to every service. One objective of these strategies is to minimize the total number of wavelength converters (WCs), which are required every time the wavelength continuity constraint cannot be met. This paper presents a scalable and efficient heuristic, whose goal is to minimize the number of WCs in resilient WDM networks supporting static sets of shared path protection lambda services. The heuristic comprises a set of polynomial algorithms that are executed sequentially to obtain a sub-optimal solution. In small size instances of the problem, the heuristic is compared against the optimal solution obtained from ILP formulation. For large size instances - tens of thousands of lambda services and hundreds of nodes - the heuristic yields an average number of WCs that is close to be linear in the number of services, despite the fact that the wavelength sharing factor increases.

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)

Keyword

ILP formulation;ROADM;lambda service;polynomial algorithm;protection wavelength channel;reconfigurable optical add-drop multiplexer;resilient WDM network;shared path protection mechanism;wavelength assignment heuristic;wavelength converter;wavelength sharing heuristic;channel allocation;integer programming;linear programming;multiplexing equipment;optical fibre networks;optical wavelength conversion;wavelength assignment;wavelength division multiplexing

Publication and Content Type

ref (subject category)
kon (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view