IEEE Journal on Selected Areas in Communications · 1996 · 509 citations · 5 references
EngineeringNetwork PlanningNetwork RoutingNetwork AnalysisLarge Optical NetworksOptical NetworksCombinatorial OptimizationNetwork OptimizationOptical NetworkingPhotonicsComputer EngineeringComputer ScienceNetwork Routing AlgorithmNetwork ScienceGraph TheoryWavelength AssignmentEdge ComputingLarge Rwa ProblemPractical ApproachBusinessRobust Routing
Large optical networks use wavelength‑routing switches to establish WDM lightpaths between node pairs. We propose a practical approach to solve routing and wavelength assignment of lightpaths in such networks. The approach partitions the large RWA problem into independent subproblems, solves each with a multicommodity flow formulation and randomized rounding for routing, and assigns wavelengths using graph‑coloring techniques. Numerical examples demonstrate the accuracy of the algorithms.
We consider large optical networks in which nodes employ wavelength-routing switches which enable the establishment of wavelength-division-multiplexed (WDM) channels, called lightpaths, between node pairs. We propose a practical approach to solve routing and wavelength assignment (RWA) of lightpaths in such networks. A large RWA problem is partitioned into several smaller subproblems, each of which may be solved independently and efficiently using well-known approximation techniques. A multicommodity flow formulation combined with randomized rounding is employed to calculate the routes for lightpaths. Wavelength assignments for lightpaths are performed based on graph-coloring techniques. Representative numerical examples indicate the accuracy of our algorithms.
5
Smallest-last ordering and clustering and graph coloring algorithms
David W. Matula, Leland L. Beck · Journal of the ACM · 1983 · 507 citations · Full text