On-line competitive algorithms for call admission in optical networks
From MaRDI portal
Publication:4595505
DOI10.1007/3-540-61680-2_73zbMath1379.68358MaRDI QIDQ4595505
Baxuch Awerbuch, Adi Rosén, Stefano Leonardi, Amos Fiat, Yossi Azar
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_73
90B18: Communication networks in operations research
68W20: Randomized algorithms
68W27: Online algorithms; streaming algorithms
Related Items
On-line routing in all-optical networks, Colouring paths in directed symmetric trees with applications to WDM routing, The online knapsack problem with incremental capacity, A preemptive algorithm for maximizing disjoint paths on trees, Approximation algorithms for routing and call scheduling in all-optical chains and rings., On-line routing in all-optical networks, A Preemptive Algorithm for Maximizing Disjoint Paths on Trees