Dynamic Switch Scheduling for Bearer Traffic Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional scheduling techniques in wireless communications networks, such as those using digital signal processors (DSPs), are inefficient in handling dynamically changing numbers of events, leading to suboptimal processing and potential delays in bearer traffic processing.
Innovation Solution
A dynamic scheduling method that determines the number of active events to be processed and generates a tailored schedule, allowing for real-time modifications in response to changes, minimizing global maximum delay and preserving call continuity without additional resource requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional scheduling techniques are used, then device complexity is reduced, but productivity deteriorates due to inefficient handling of dynamically changing events
Solution Approach 1:
The patent implements dynamic scheduling by continuously monitoring the number of active events and adjusting the schedule accordingly. The scheduler transitions from static conventional techniques to a dynamic approach where the schedule is regenerated when the number of active events changes, allowing the system to adapt to varying workloads and improve processing efficiency.
Solution Approach 2:
The patent changes the scheduling parameters based on the number of active events. When the number of active events changes, the system regenerates the schedule with updated parameters optimized for the current event load, thereby improving productivity without requiring additional hardware resources.
2Loss of time
If conventional scheduling techniques are used, then ease of operation is maintained, but loss of time increases due to delays in bearer traffic processing
Solution Approach 1:
The patent implements a feedback mechanism where the scheduler continuously monitors the number of active events and uses this information to dynamically adjust the schedule. This feedback loop ensures that processing delays are minimized by adapting the schedule to current conditions, while the automated nature of the feedback mechanism maintains ease of operation.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating and storing optimal schedules for different numbers of active events. When the number of active events changes, the system can quickly switch to the pre-computed schedule, reducing processing delays without requiring complex real-time calculations that would complicate operation management.
3Adaptability or versatility
If dynamic scheduling is implemented, then adaptability improves for handling varying event loads, but device complexity increases
Solution Approach 1:
The patent achieves adaptability through dynamic scheduling that responds to changes in the number of active events. The scheduler automatically adjusts the schedule when event counts change, providing high adaptability to varying workloads while using a relatively simple mechanism that monitors event counts and triggers schedule regeneration only when necessary.
Solution Approach 2:
The patent creates a universal scheduling mechanism that can handle different numbers of active events using the same core logic. The scheduler serves multiple functions by adapting to various event loads without requiring separate scheduling algorithms for different scenarios, thereby improving adaptability while controlling complexity through code reuse and unified management.
Data Source
AI summary
A switch that interconnects networks provides a scheduling algorithm that determines a number of active events to be processed by a processor in the switch. The active events involve processing of bearer traffic. A schedule tailored to the number of active events is generated. In response to a change affecting the schedule, the schedule is modified. The active events are processed by the processor according to the modified schedule.