Minimizing number of wavelengths in multicast routing trees in WDM networks

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200007)35:4<260::AID-NET4>3.0.CO;2-P" /><260::AID-NET4>3.0.CO;2-P 10.1002/1097-0037(200007)35:4<260::AID-NET4>3.0.CO;2-PzbMath0968.90022OpenAlexW1983325934MaRDI QIDQ4506266

Xiao-Hua Jia, Xiao-Dong Hu, Lu Ruan, Xiufeng Du, Deying Li

Publication date: 14 September 2000

Full work available at URL: https://doi.org/10.1002/1097-0037(200007)35:4<260::aid-net4>3.0.co;2-p

zbMATH Keywords

routingmulticast communicationwavelength conversionwavelength assignmentWDM networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80)

Related Items (1)

Broadcast routing with minimum wavelength conversion in WDM optical networks

Cites Work

• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• On the hardness of approximating minimization problems

This page was built for publication: Minimizing number of wavelengths in multicast routing trees in WDM networks