Background Traffic Management Using Remaining Time Flexibility
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing techniques for managing background traffic in networks, such as FIFO and LP, often mis-prioritize tasks, leading to performance issues, latency, and QoS violations, especially in heterogeneous and dynamic network environments.
Innovation Solution
The implementation of a Linear Programming-based task scheduling technique (LPST) that sorts tasks by remaining time flexibility, selects prioritized tasks, assigns resources using a linear programming model, and executes tasks until completion, while considering network topology and resource constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If FIFO or EDF treatment is used for traffic management, then implementation is simple, but task prioritization is incorrect leading to performance degradation
Solution Approach 1:
The patent changes the parameter used for task prioritization from simple FIFO/EDF metrics to remaining time flexibility (RTF), which dynamically adjusts prioritization based on task deadlines and current system state, thereby improving task completion efficiency while maintaining manageable complexity
Solution Approach 2:
The patent introduces dynamic prioritization where task priorities are not fixed but change over time based on remaining time flexibility calculations, allowing the system to adapt to heterogeneous and dynamic network conditions rather than using static FIFO or EDF approaches
2Productivity
If linear programming is used to determine transmission solutions, then optimization is attempted, but mis-prioritization occurs in heterogeneous network topologies
Solution Approach 1:
The patent applies local quality by considering specific network topology characteristics and task-specific requirements when calculating remaining time flexibility, rather than applying a uniform linear programming approach, thereby improving prioritization accuracy for heterogeneous network conditions
Solution Approach 2:
The patent performs preliminary calculation of remaining time flexibility for each task before resource allocation, establishing accurate priority rankings in advance that guide subsequent linear programming optimization, preventing mis-prioritization issues
3Device complexity
If improper prioritization and scheduling are applied, then resource allocation is simplified, but QoS and SLA requirements are violated
Solution Approach 1:
The patent performs preliminary sorting of tasks by remaining time flexibility before resource allocation, establishing a priority-ordered queue that guides subsequent resource assignment, thereby ensuring QoS compliance without requiring complex real-time scheduling decisions during resource allocation
Solution Approach 2:
The patent segments the scheduling process into distinct phases: task sorting by RTF, priority selection, resource allocation, and execution, allowing each phase to be handled with appropriate complexity level while collectively ensuring QoS requirements are met
Data Source
AI summary
A traffic management mechanism can employ a two-tiered approach for managing background traffic based on prioritizing tasks by remaining time flexibility then scheduling prioritized tasks using linear programming.