Maximizing profits of routing in WDM networks

DOI10.1007/S10878-005-2263-0zbMATH Open1093.90071OpenAlexW1985134401MaRDI QIDQ813327FDOQ813327

Authors: Jianping Li, Kang Li, Lusheng Wang, Hao Zhao 

Publication date: 8 February 2006

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-2263-0

Recommendations

• Wavelength management in WDM rings to maximize the number of connections
• Wavelength Management in WDM Rings to Maximize the Number of Connections
• An experimental study of maximum profit wavelength assignment in WDM rings
• scientific article; zbMATH DE number 1303573
• STACS 2004

zbMATH Keywords

approximation algorithmroutingpath coloringminimum-cost flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the \(k\)-coloring of intervals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Ring Loading Problem
• Efficient routing in all-optical networks
• Satisfying a maximum number of pre-routed requests in all-optical rings.
• Title not available (Why is that?)

Cited In (5)

• Wavelength Management in WDM Rings to Maximize the Number of Connections
• On packing and coloring hyperedges in a cycle
• An experimental study of maximum profit wavelength assignment in WDM rings
• Computing and Combinatorics
• Wavelength management in WDM rings to maximize the number of connections

This page was built for publication: Maximizing profits of routing in WDM networks

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