scientific article; zbMATH DE number 1421019
An all-optical network can be modeled as a graph \(G= (V,E)\) in which any edge \(xy\in E\) represents a pair of point-to-point unidirectional optical fiber links connecting a pair of nodes \(x\) and \(y\). A dipath \(p\) from \(x\) to \(y\) \((x,y\in V)\) is the unidirected path joining \(x\) to \(y\), in which each edge is considered traversed in the direction from \(x\) to \(y\). Given a graph \(G\) and a set \(P\) of dipaths on \(G\), the problem is to assign a color (wavelength) to each dipath in \(P\) in such a way that two dipaths that share a link must have different color assignments. This paper surveys theoretical results for wavelength-routing in all-optimal networks and presents several open problems. The authors highlight the most important graph-theoretic and algorithmic problems in this area and present some proofs of known results to illustrate the most effective techniques. Since the general problem is NP-hard, they focus on special cases of set \(P\), special structures of graph \(G\) and different modes of routing. For the entire collection see [Zbl 0933.00056].
- Forwarding and optical indices of a graph
- Approximating the traffic grooming problem
- Routing on networks of optical crossbars
- Uniform multi-hop all-to-all optical routings in rings.
- On routing of wavebands for all-to-all communications in all-optical paths and cycles
- Optimal bandwidth utilization of all-optical ring with a converter of degree 4.
- Spanning spiders and light-splitting switches
- Minimizing ADMs on WDM directed fiber trees
- Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem
- Path problems in generalized stars, complete graphs, and brick wall graphs
- Approximable 1-turn routing problems in all-optical mesh networks
- scientific article; zbMATH DE number 1003273 (Why is no real title available?)
- scientific article; zbMATH DE number 5144724 (Why is no real title available?)
- Optical Routing of Uniform Instances in Cayley Graphs
- Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
- An $\Omega(\sqrt{\,\log\log n}\,)$ Lower Bound for Routing in Optical Networks
- Approximating the traffic grooming problem in tree and star networks
- Efficient routing in optical networks
- Decidable properties of graphs of all-optical networks
- scientific article; zbMATH DE number 1862254 (Why is no real title available?)
- The price of anarchy in all-optical networks
- Selfish Routing and Path Coloring in All-Optical Networks
- Maximizing the number of requests in oriented trees with a grooming factor
- Forwarding and optical indices of 4-regular circulant networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946041)