Multiwavelength optical networks with limited wavelength conversion
IEEE/ACM Transactions on Networking (TON)
All-to-all routing and coloring in weighted trees of rings
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
IEEE/ACM Transactions on Networking (TON)
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
All-to-all optical routing in optimal chordal rings of degree four
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Fault-Tolerant Routing in Multihop Optical WDM Networks
IEEE Transactions on Parallel and Distributed Systems
Worst-case analysis of dynamic wavelength allocation in optical networks
IEEE/ACM Transactions on Networking (TON)
Journal of Experimental Algorithmics (JEA)
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
Theoretical Computer Science
An efficient algorithm for reducing the number of add-drop Multiplexers in SONET/WDM rings
Journal of High Speed Networks
Randomized path coloring on binary trees
Theoretical Computer Science
Wavelength assignment and generalized interval graph coloring
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Bandwidth allocation in WDM tree networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Edge Coloring of Bipartite Graphs with Constraints
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Optical Routing of Uniform Instances in Tori
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Maximizing the Number of Connections in Optical Tree Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Randomized path coloring on binary trees
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Approximate Constrained Bipartite Edge Coloring
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Wide-Sense Nonblocking WDM Cross-Connects
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Multicasting in Optical Networks
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Decidable Properties of Graphs of All-Optical Networks
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Recent Advances in Wavelength Routing
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Multihop All-to-All Broadcast on WDM Optical Networks
IEEE Transactions on Parallel and Distributed Systems
Satisfying a maximum number of pre-routed requests in all-optical rings
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Multiwavelength Optical Networks with Limited Wavelength Conversion
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
Journal of Algorithms
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics
Tight Bounds for Wavelength Assignment on Trees of Rings
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Path decomposition under a new cost measure with applications to optical network design
ACM Transactions on Algorithms (TALG)
Batch Coloring Flat Graphs and Thin
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Efficient algorithms for wavelength assignment on trees of rings
Discrete Applied Mathematics
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Information Processing Letters
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences
Routing and wavelength assignment in generalized WDM tree networks of bounded degree
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Wavelength routing of uniform instances in all-optical rings
Discrete Optimization
Hi-index | 0.00 |
We address efficient access to bandwidth in WDM (wavelength division multiplexing) optical networks. We consider tree topologies, ring topologies, as well as trees of rings. These are topologies of concrete practical relevance for which undirected underlying graph models have been studied before by P. Raghavan and E. Upfal (1993). As opposed to previous studies (A. Aggarwal et al., 1993; R. Pankaj, 1992; P. Raghavan and E. Upfal, 1993), we consider directed graph models. Directedness of fiber links is dictated by physical directedness of optical amplifiers. For trees, we give a polynomial time routing algorithm that satisfies requests of maximum load L/sub max/ per fiber link using no more than 15L/sub max//8/spl les/15OPT/8 optical wavelengths. This improves a 2L/sub max/ scheme that is implicit by P. Raghavan and E. Upfal by extending their undirected methods to our directed model. Alternatively stated, for fixed W wavelength technology, we can load the network up to L,, 8W/15 rather than W/2. In engineering terms, this is a so called "6.66% increase of bandwidth" and it is considered substantial. For rings, the approximation factor is 2OPT. For trees of rings, the approximation factor is 15OPT/4. Technically, optical routing requirements give rise to novel coloring paradigms. Our algorithms involve matchings and multicolored alternating cycles, combined with detailed potential and averaging analysis.