Single-Step Routing and Wavelength Assignment in DWDM Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing algorithms for service routing and wavelength assignment in DWDM networks are computationally complex, requiring multiple passes and reconfiguration of existing services, making them unsuitable for real-time automated provisioning and not considering transponder availability or regeneration node computations.
Innovation Solution
A single-step routing and wavelength assignment method that computes an ordered list of shortest candidate routes, iterates to assign resources, and uses hierarchical pair-wise common channel set algorithms to select optimal OEO regeneration nodes and wavelengths, minimizing reconfiguration and equipment costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple transformed network graphs are used for computation of route and wavelength assignment, then wavelength utilization is optimized, but computational complexity increases and multiple passes are required
Solution Approach 1:
The patent segments the complex RWA problem into two independent sub-problems: routing computation (using shortest path algorithms) and wavelength assignment (using available channel sets). This segmentation eliminates the need to generate multiple transformed network graphs, reducing computational complexity while maintaining optimization effectiveness.
Solution Approach 2:
The patent performs preliminary computation of available channel sets for all possible routes before the actual RWA decision. This pre-computation stores wavelength availability information in advance, eliminating the need for iterative graph transformations during service provisioning and significantly reducing real-time computational complexity.
2Productivity
If static RWA algorithms are used to globally optimize wavelength assignments, then network service capacity is maximized, but reconfiguration of existing services is required
Solution Approach 1:
The patent applies partial optimization by focusing only on the specific route and wavelength assignment for the new service request, rather than globally re-optimizing all services. This partial action approach maximizes the capacity for the current service without requiring reconfiguration of existing services, making the system easier to operate.
Solution Approach 2:
The system performs self-service by automatically computing the optimal route and wavelength assignment for new services using pre-computed available channel sets, without requiring manual intervention or reconfiguration of existing services. This maintains network capacity while simplifying operations.
3Reliability
If iterative shortest path computations are performed for each wavelength, then routing optimization is achieved, but processing time increases
Solution Approach 1:
The patent performs preliminary computation of available channel sets for all routes in advance, storing the results for quick retrieval. This eliminates the need for iterative shortest path computations for each wavelength during service provisioning, significantly reducing processing time while maintaining routing optimization.
Solution Approach 2:
The patent creates copies of available channel set information for different route scenarios and stores them in a lookup structure. This allows the system to quickly retrieve pre-computed routing information without performing iterative computations in real-time, reducing processing time while preserving routing optimization quality.
Data Source
AI summary
A single step routing and wavelength assignment method and system for automated provisioning of services on DWDM networks is presented. This novel single step solution automates design and assignment of services in DWDM networks. For an automated provisioning platform that can handle the routing and wavelength assignment in a single step, the solution avoids reconfiguration of existing services. It also takes into consideration practical aspects of DWDM transponder availability at termination sites and regeneration sites along the selected route. The methodology includes iterative computation of common channel sets to avoid multiple shortest path computations for each of the wavelengths.