Elastic Scheduling via Hash Mapping for Cellular Interference
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current scheduling methods in wireless networks, particularly in LTE systems, face challenges with high latency and inflexibility, making it difficult to coordinate inter-cell interference and resource allocation efficiently across multiple base stations.
Innovation Solution
A method involving a global scheduler and local schedulers, where the global scheduler, located at the core network, uses hash functions to allocate resources and provide scheduling hints to local schedulers at base stations, allowing for flexible and efficient resource management across multiple radio access networks, reducing latency and improving interference coordination.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If centralized scheduling is implemented at the core network gateway, then interference coordination and resource allocation improve, but latency increases due to communication delays
Solution Approach 1:
The scheduling function is divided into two parts: a global scheduler at the core network gateway that handles inter-cell interference coordination, and local schedulers at base stations that handle real-time resource allocation. This segmentation allows centralized optimization while maintaining local responsiveness.
Solution Approach 2:
Hash functions serve as an intermediary mechanism that enables the global scheduler to provide scheduling hints to local schedulers without requiring direct real-time communication. The hash values encode resource allocation information that local schedulers can interpret and apply autonomously.
2Reliability
If sophisticated ICIC and scheduling capabilities are provided, then network performance improves, but latency increases making real-time scheduling difficult
Solution Approach 1:
The global scheduler performs resource allocation and generates hash values in advance, before real-time scheduling is needed. These pre-computed hash values are then used by local schedulers to quickly make scheduling decisions without requiring complex real-time calculations.
Solution Approach 2:
Complex centralized scheduling calculations are replaced by a hash function-based system. Instead of performing sophisticated interference coordination calculations in real-time, the system uses hash functions to map resource allocations to compact representations that can be quickly processed locally.
3Loss of time
If high-speed fiber-optic backhaul connections are installed to reduce latency, then scheduling latency decreases, but cost increases
Solution Approach 1:
Instead of investing in expensive high-speed fiber-optic backhaul infrastructure, the system uses computationally efficient hash functions that can operate over standard-speed connections. The 'cheap' solution is a software-based algorithm rather than hardware infrastructure.
Solution Approach 2:
Local schedulers at base stations perform self-service by autonomously interpreting hash values and making scheduling decisions without requiring real-time communication with the core network. This eliminates the need for low-latency backhaul connections.
4Productivity
If local schedulers operate autonomously, then scheduling flexibility and speed improve, but interference coordination between cells deteriorates
Solution Approach 1:
The global scheduler provides feedback to local schedulers in the form of hash values that encode resource allocation information. This feedback mechanism enables coordinated scheduling across cells while allowing local schedulers to operate autonomously based on the received guidance.
Solution Approach 2:
The system changes the parameter representation from detailed resource allocation descriptions to compact hash values. This parameter transformation enables efficient communication of scheduling intent while reducing the information processing burden on local schedulers.
Data Source
AI summary
A method for scheduling resources in a network where the scheduling activity is split across two nodes in the network is disclosed, comprising: receiving, from a local scheduler in a first radio access network, access network information at a global scheduler; accessing information regarding a second radio access network allocating, at the global scheduler, resources for secondary allocation by the local scheduler; applying a hash function to map the allocated resources for secondary allocation to a set of hash values; and sending, from the global scheduler, the set of hash values to the local scheduler.


