Optimal on-line colorings for minimizing the number of ADMs in optical networks

DOI10.1016/j.jda.2009.02.006zbMath1186.90120OpenAlexW2043278341MaRDI QIDQ972358

Shmuel Zaks, Mordechai Shalom, Prudence W. H. Wong

Publication date: 25 May 2010

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2009.02.006

zbMATH Keywords

on-line algorithmsoptical networksadd-drop multiplexer (ADM)wavelength division multiplexing (WDM)wavelength assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

On-line maximum matching in complete multi-partite graphs with an application to optical networks ⋮ On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks

Cites Work

• Unnamed Item
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• On Minimizing the Number of ADMs in a General Topology Optical Network
• Approximation and Online Algorithms

This page was built for publication: Optimal on-line colorings for minimizing the number of ADMs in optical networks