Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A wavelength sharing and assignment heuristic to minimize the number of wavelength converters in resilient WDM networks
The University of Texas at Dallas.
The University of Texas at Dallas.
The University of Texas at Dallas.
The University of Texas at Dallas.
Visa övriga samt affilieringar
2009 (Engelska)Ingår i: Proceedings of the 2009 7th International Workshop on the Design of Reliable Communication Networks, DRCN 2009 / [ed] Medhi, D; Tipper, D; Doucette, J, 2009, s. 319-326Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

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.

Ort, förlag, år, upplaga, sidor
2009. s. 319-326
Nyckelord [en]
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;
Nationell ämneskategori
Telekommunikation
Identifikatorer
URN: urn:nbn:se:kth:diva-79017DOI: 10.1109/DRCN.2009.5339989ISI: 000292860600042Scopus ID: 2-s2.0-71749113036ISBN: 978-1-4244-5047-3 (tryckt)OAI: oai:DiVA.org:kth-79017DiVA, id: diva2:494497
Konferens
7th International Workshop on the Design of Reliable Communication Networks. Washington, DC. OCT 25-28, 2009
Anmärkning

QC 20150707

Tillgänglig från: 2012-02-08 Skapad: 2012-02-08 Senast uppdaterad: 2015-07-07Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Monti, Paolo

Sök vidare i DiVA

Av författaren/redaktören
Monti, Paolo
Av organisationen
Fotonik (Stängd 20120101)
Telekommunikation

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 278 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf