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

DOI10.1016/J.JDA.2009.02.006MaRDI QIDQ972358zbMATH OpenOpenAlexFDO

Authors Mordechai Shalom, Shmuel Zaks, 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)

Recommendations

• Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
• On minimizing the number of ADMs in a general topology optical network
• On Minimizing the Number of ADMs in a General Topology Optical Network
• scientific article; zbMATH DE number 5990404
• On-line maximum matching in complete multi-partite graphs with an application to optical networks
• STACS 2004
• On the complexity of approximation and online scheduling problems with applications to optical networks
• On-line competitive algorithms for call admission in optical networks
• On-line competitive algorithms for call admission in optical networks
• Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Approximation and Online Algorithms
• On Minimizing the Number of ADMs in a General Topology Optical Network
• Traffic partition in WDM/SONET rings to minimize SONET ADMs

Cited in

(12)

• On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
• scientific article; zbMATH DE number 5990404 (Why is no real title available?)
• On-line routing in all-optical networks
• On the complexity of approximation and online scheduling problems with applications to optical networks
• On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing
• On Minimizing the Number of ADMs in a General Topology Optical Network
• Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
• On-line routing in all-optical networks
• On-line maximum matching in complete multi-partite graphs with an application to optical networks
• Approximation and Online Algorithms
• On minimizing the number of ADMs in a general topology optical network
• Scheduling light-trails on WDM rings

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

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