Iterative Wireless Scheduling and Wired Routing Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional radio access networks optimize wireless and wired links separately, leading to sub-optimal combined paths for uplink traffic flows, lacking efficient integration of wireless and wired network optimizations.
Innovation Solution
The method involves iteratively executing scheduling and routing processes, where data rates for wireless links are computed and shared to optimize wired link allocations, and aggregate data rates for services are passed between processes to synchronize wireless and wired network optimizations using Alternating Direction Method of Multipliers (ADMM) techniques.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If separate scheduling and routing optimization algorithms are used, then each link type can be optimized independently, but the combined wireless and wired path becomes sub-optimal
Solution Approach 1:
The patent segments the optimization problem into separate scheduling and routing processes that operate independently but iteratively interact through information exchange. The scheduling process handles wireless link allocation while the routing process handles wired network path selection, with each process receiving feedback from the other to converge on an optimal combined solution.
Solution Approach 2:
The patent implements feedback mechanisms where the scheduling process passes allocated data rates to the routing process, and the routing process passes aggregate data rate information back to the scheduling process. This iterative feedback loop enables both processes to adjust their allocations based on the other's constraints and objectives, achieving optimal combined performance.
2Device complexity
If wireless and wired network optimizations are treated as separate problems, then computational complexity is reduced, but the integrated performance deteriorates
Solution Approach 1:
The patent divides the complex optimization problem into two manageable segments: wireless scheduling and wired routing. Each segment can be solved using appropriate algorithms for its domain, reducing overall computational complexity while maintaining the ability to optimize the integrated path through iterative coordination.
Solution Approach 2:
The patent introduces dynamic interaction between the scheduling and routing processes through iterative information exchange. The processes start with initial allocations and progressively refine their solutions based on feedback from the other process, converging toward an optimal integrated solution that balances wireless and wired network performance.
Data Source
AI summary
A method includes iteratively executing, by a computer, a scheduling process computing an allocation of wireless access network data rate to each link between an Access point and a User Equipment within a coverage area of the Access Point, and a routing process computing an allocation of wired network resources to each wired link between the Access Point and nodes of a wired network. The scheduling and routing processes are independent of each other. At each iteration, information of the allocated wireless access network data rate is passed to the routing process; and information of the aggregate allocated data rate for each service at the Access Point is passed to the scheduling process.