Optimizing bandwidth allocation in elastic optical networks with application to scheduling

DOI10.1016/j.jda.2017.07.001zbMath1423.90046OpenAlexW2735411542MaRDI QIDQ2407946

Ariella Voloshin, Hadas Shachnai, Shmuel Zaks

Publication date: 6 October 2017

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

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

zbMATH Keywords

schedulingresource allocationnetwork designapproximation algorithmselastic optical networksall-optical networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Flexible resource allocation to interval jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resource allocation in bounded degree trees
• A polynomial time approximation algorithm for dynamic storage allocation
• Profit Maximization in Flex-Grid All-Optical Networks
• Multicommodity demand flow in a tree and packing integer programs
• The Linearity of First-Fit Coloring of Interval Graphs
• Speed is as powerful as clairvoyance
• Approximation algorithms for dynamic storage allocation
• OPTVersusLOADin Dynamic Storage Allocation
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Optimizing bandwidth allocation in elastic optical networks with application to scheduling