On-line routing in all-optical networks

DOI10.1007/3-540-63165-8_207MaRDI QIDQ4571982zbMATH OpenOpenAlexFDO

Authors Yair Bartal, Stefano Leonardi

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_207

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Recommendations

• On-line routing in all-optical networks
• scientific article; zbMATH DE number 1862254
• scientific article; zbMATH DE number 2080982
• Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
• Optimal on-line colorings for minimizing the number of ADMs in optical networks

Cites work

• scientific article; zbMATH DE number 1003262 (Why is no real title available?)
• scientific article; zbMATH DE number 1003273 (Why is no real title available?)
• scientific article; zbMATH DE number 3769624 (Why is no real title available?)
• scientific article; zbMATH DE number 1261807 (Why is no real title available?)
• scientific article; zbMATH DE number 1306887 (Why is no real title available?)
• scientific article; zbMATH DE number 910915 (Why is no real title available?)
• scientific article; zbMATH DE number 6472619 (Why is no real title available?)
• Constrained bipartite edge coloring with applications to wavelength routing
• Efficient routing in all-optical networks
• Efficient wavelength routing on directed fiber trees
• Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
• On-line competitive algorithms for call admission in optical networks
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• On-line routing in all-optical networks
• Optimal on-line coloring of circular arc graphs

Cited in

(11)

• scientific article; zbMATH DE number 7651175 (Why is no real title available?)
• scientific article; zbMATH DE number 2080982 (Why is no real title available?)
• Approximating call-scheduling makespan in all-optical networks
• scientific article; zbMATH DE number 7525512 (Why is no real title available?)
• Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks
• On-line routing in all-optical networks
• Routing on networks of optical crossbars
• Sparse Semi-Oblivious Routing: Few Random Paths Suffice
• Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks
• Nash equilibria in all-optical networks
• On the fault-tolerance and size of WDM optical networks

This page was built for publication: On-line routing in all-optical networks

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