Routing to reduce the cost of wavelength conversion

DOI10.1016/J.DAM.2007.12.001zbMATH Open1169.05379OpenAlexW2006027686MaRDI QIDQ1005233FDOQ1005233

Authors: Stamatis Stefanakos, Thomas Erlebach 

Publication date: 9 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.12.001

Recommendations

• Wavelength conversion in all-optical networks with shortest-path routing
• Algorithms and Computation
• scientific article; zbMATH DE number 1962808
• scientific article; zbMATH DE number 1303778
• Sparse and limited wavelength conversion in all-optical tree networks

zbMATH Keywords

graph algorithmsoptical networkssufficient setwavelength conversionpath coloringwavelength assignment

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cites Work

• Optimization, approximation, and complexity classes
• Some APX-completeness results for cubic graphs
• Algorithmic graph theory and perfect graphs
• On the hardness of approximating minimum vertex cover
• Title not available (Why is that?)
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Algorithms for routing around a rectangle
• Wavelength conversion in optical networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sparse and limited wavelength conversion in all-optical tree networks
• Wavelength conversion in all-optical networks with shortest-path routing

Cited In (2)

• Algorithms and Computation
• Title not available (Why is that?)

This page was built for publication: Routing to reduce the cost of wavelength conversion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005233)