Efficient routing in all-optical networks

DOI10.1145/195058.195119zbMath1345.90038OpenAlexW2012729006MaRDI QIDQ2817603

Prabhakar Raghavan, Eli Upfal

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195119

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Related Items (41)

Minimizing ADMs on WDM directed fiber trees ⋮ Methods and problems of communication in usual networks ⋮ Coloring all directed paths in a symmetric tree, with an application to optical networks ⋮ Colouring paths in directed symmetric trees with applications to WDM routing ⋮ Approximating call-scheduling makespan in all-optical networks ⋮ Efficient delay routing ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ The permutation-path coloring problem on trees. ⋮ Scheduling multicasts on unit-capacity trees and meshes. ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Path multicoloring in spider graphs with even color multiplicity ⋮ A Refined Analysis of Online Path Coloring in Trees ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ On-line routing in all-optical networks ⋮ Optimal wavelength routing on directed fiber trees ⋮ The maximum edge-disjoint paths problem in complete graphs ⋮ Multicolor routing in the undirected hypercube ⋮ Inapproximability and approximability of minimal tree routing and coloring ⋮ Path multicoloring with fewer colors in spiders and caterpillars ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm ⋮ Path problems in generalized stars, complete graphs, and brick wall graphs ⋮ The complexity of path coloring and call scheduling ⋮ 1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings ⋮ Short length Menger's theorem and reliable optical routing ⋮ Wavelength assignment in multifiber star networks ⋮ Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ Forwarding and optical indices of a graph ⋮ Selfish Routing and Path Coloring in All-Optical Networks ⋮ Approximations for the disjoint paths problem in high-diameter planar networks ⋮ Efficient algorithms for wavelength assignment on trees of rings ⋮ Efficient collective communciation in optical networks ⋮ Nash equilibria in all-optical networks ⋮ On-line routing in all-optical networks ⋮ Approximation algorithms for routing and call scheduling in all-optical chains and rings. ⋮ Randomized path coloring on binary trees. ⋮ Minimizing maximum fiber requirement in optical networks ⋮ Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs ⋮ Routing and path multicoloring ⋮ Maximizing profits of routing in WDM networks ⋮ Wavelength routing in optical networks of diameter two

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