AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT

DOI10.15807/JORSJ.46.251zbMATH Open1065.90011OpenAlexW2160945410MaRDI QIDQ4444094FDOQ4444094

Authors:

Publication date: 2003

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.46.251

Recommendations

• A traffic-grooming algorithm for wavelength-routed optical networks
• A network flow approach for static and dynamic traffic grooming in WDM networks
• Traffic grooming in bidirectional WDM ring networks
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• Approximation algorithms for grooming in optical network design

zbMATH Keywords

heuristic algorithmmixed integer programming problemlarge-scale networks

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Communication networks in operations research (90B18)

Cited In (9)

• Title not available (Why is that?)
• Cost-effective single-hub WDM ring networks: A proposal and analysis
• A fast heuristic method for minimizing traffic congestion on reconfigurable ring topologies
• On minimum congestion routing in rearrangeable multihop lightwave networks
• Title not available (Why is that?)
• Rerouting schemes for dynamic traffic grooming in optical WDM networks
• A traffic-grooming algorithm for wavelength-routed optical networks
• An efficient heuristic to dimension large-scale hybrid optoelectronic networks
• A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks

This page was built for publication: AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT

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