Resource allocation problems in multifiber WDM tree networks.

DOI10.1007/B93953MaRDI QIDQ5902523zbMATH OpenFDO

Authors Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos

Publication date 12 January 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B93953

Mathematics Subject Classification ID

Approximation algorithms (68W25) Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)

Recommendations

• Wavelength allocation on trees of rings
• Optimal wavelength routing on directed fiber trees
• Efficient wavelength routing on directed fiber trees
• scientific article; zbMATH DE number 1820026
• Algorithms for multicast routing and wavelength assignment in all-optical networks under some special topologies

Cited in

(14)

• Minimum multiplicity edge coloring via orientation
• Path multicoloring in spider graphs with even color multiplicity
• On spectrum assignment in elastic optical tree-networks
• Minimizing ADMs on WDM directed fiber trees
• Path multicoloring with fewer colors in spiders and caterpillars
• The k-edge intersection graphs of paths in a tree
• Representing edge intersection graphs of paths on degree 4 trees
• Minimizing maximum fiber requirement in optical networks
• scientific article; zbMATH DE number 1670869 (Why is no real title available?)
• An experimental study of maximum profit wavelength assignment in WDM rings
• Wavelength assignment in multifiber star networks
• scientific article; zbMATH DE number 1985301 (Why is no real title available?)
• scientific article; zbMATH DE number 1787336 (Why is no real title available?)
• Clique coloring EPT graphs on bounded degree trees

This page was built for publication: Resource allocation problems in multifiber WDM tree networks.

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