Periodic Scheduling of Shared Network Resource
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Network devices face inefficiencies in scheduling shared resources due to the need for periodic access with fixed time intervals by some packet flows, which results in empty time slots that are not utilized by non-periodic flows, leading to inefficiencies in resource allocation.
Innovation Solution
A method and apparatus for determining a periodic schedule that allocates a shared resource to packet flows with fixed time intervals, incorporating empty time slots, and granting access to non-periodic flows during these slots, thereby minimizing inefficiencies and optimizing resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If periodic scheduling with fixed time intervals is implemented for packet flows, then quality of service for periodic flows is improved, but resource utilization efficiency deteriorates due to empty time slots
Solution Approach 1:
The patent merges periodic and non-periodic packet flows into a unified scheduling framework. Non-periodic flows are allowed to access the shared resource during empty time slots that would otherwise remain unused, combining the resource allocation for both flow types in a coordinated manner to improve overall utilization while maintaining periodic flow QoS requirements
Solution Approach 2:
The scheduling system dynamically adapts by allowing flexible access for non-periodic flows during available empty slots while preserving the fixed periodic structure for periodic flows. This dynamic allocation enables the system to respond to varying traffic demands without compromising the deterministic timing requirements of periodic traffic
2Manufacturing precision
If empty time slots are left unused to maintain fixed time intervals for periodic flows, then timing precision for periodic flows is improved, but resource allocation efficiency deteriorates
Solution Approach 1:
The patent ensures continuous useful action by filling empty time slots with non-periodic packet flows. Instead of leaving slots idle to maintain periodic timing precision, the system continuously utilizes available capacity by scheduling non-periodic traffic during gaps, thereby eliminating wasted resources while preserving the timing integrity of periodic flows
Solution Approach 2:
The empty time slots, which were originally harmful to resource utilization efficiency, are converted into beneficial opportunities for transmitting non-periodic traffic. What was previously wasted capacity becomes productive resource allocation, transforming the timing constraint requirement into an opportunity for improved overall system efficiency
Data Source
AI summary
Packets received by a network device are assigned to packet flows defined by shared packet characteristics. The packet flows belong to a first category containing packet flows that are to be granted access to the shared resource periodically and with a fixed time interval between subsequent grants of access to the shared resource, or a second category containing packet flows not included in the first category. A periodic schedule that allocates the shared resource to the packet flows in the first category is determined. The periodic schedule includes one or more empty time slots during which the shared resource is not granted to any packet flow in the first category. Access to the shared resource is granted to packet flows in the first category according to the periodic schedule, and is granted packet flows in the second category during the empty time slots in the periodic schedule.