Flexible Grid Spectrum Assignment via Service Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional Spectrum Assignment (SA) techniques in optical networks face challenges with high computational complexity and scalability issues due to their sequential processing nature, leading to inefficient resource allocation and increased processing time, especially in flexible grid networks where each signal requires optimized spectral width based on bit rate and modulation schemes.
Innovation Solution
A heuristic method that partitions services into disjoint groups based on link occupancy, standard deviation, and spectrum width, determining a sequence that minimizes useless spectrum slots, allowing for efficient spectrum assignment and reducing computational resources required.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional ILP methods are used for spectrum assignment, then optimality is improved, but processing time increases significantly
Solution Approach 1:
The patent segments the set of services into multiple disjoint groups based on link occupancy patterns. Each group contains services that can be assigned spectrum independently without conflicting with other groups. This segmentation transforms the single large optimization problem into multiple smaller sub-problems that can be solved more efficiently while achieving near-optimal results (93-96% of ILP optimality) with dramatically reduced processing time.
Solution Approach 2:
The patent performs preliminary actions by pre-sorting services according to their link occupancy characteristics before the actual spectrum assignment. Services are sorted based on metrics such as fill ratio, standard deviation of spectrum width, and number of links occupied. This preliminary ordering optimizes the assignment sequence to minimize spectrum fragmentation and reduce processing complexity, achieving fast near-optimal results without requiring exhaustive ILP computation.
2Manufacturing precision
If sequential processing is used for spectrum assignment, then resource allocation is optimized for each request, but scalability deteriorates
Solution Approach 1:
By segmenting services into disjoint groups that can be processed independently, the patent enables parallel processing of multiple service groups simultaneously. This maintains the quality of resource allocation within each group while dramatically improving overall scalability and throughput, as the system can handle multiple groups in parallel rather than strictly sequentially.
Solution Approach 2:
The patent applies a heuristic approach that performs partial optimization rather than exhaustive optimization for every single service request. By using sorting criteria based on key metrics (fill, standard deviation, link occupancy) and assigning groups in a predetermined optimal sequence, the system achieves 93-96% of the optimal ILP solution while scaling much better to large numbers of services and network elements.
3Measurement precision
If services are assigned sequentially one at a time, then local optimization is achieved, but spectrum fragmentation increases
Solution Approach 1:
The patent segments services into groups that are disjoint in terms of link occupancy, meaning services in each group use different sets of network links. This segmentation allows the system to assign spectrum to entire groups simultaneously rather than one service at a time, reducing spectrum fragmentation and minimizing the creation of useless spectrum slots while maintaining local optimization within each group.
Solution Approach 2:
The patent merges multiple services into disjoint groups that can be assigned spectrum together as a unit. By combining services with similar link occupancy patterns into the same group and assigning them collectively, the system reduces spectrum fragmentation and minimizes useless spectrum. The grouping strategy ensures that merged services can share spectrum resources efficiently without conflicting with services in other groups.
4Reliability
If branch and bound technique is used, then systematic solution is achieved, but computational complexity increases
Solution Approach 1:
The patent segments the complex optimization problem into multiple smaller sub-problems by dividing services into disjoint groups. Each group can be optimized independently with simpler computational methods, avoiding the need for complex branch and bound techniques on the entire set of services. This segmentation maintains systematic solution quality while dramatically reducing computational complexity and memory requirements.
Data Source
AI summary
Spectrum assignment systems and methods include, for an optical network with a plurality of links with optical spectrum on each of the plurality of links managed utilizing a flexible grid, obtaining a set of S services which require spectrum assignment on various links in the optical network; partitioning the set of S services into a plurality of groups G, wherein each group has one or more of the S services that are disjoint from one another based on occupancy of links, and wherein the plurality of groups G are selected based on fill which is a number of links occupied of the plurality of links, standard deviation, and width of spectrum; determining a sequence of the plurality of groups that minimizes useless spectrum, the useless spectrum being slots of spectrum unavailable for new channels; and assigning spectrum to the set of S services based on the determined sequence.