Deadline-Based Data Packet Scheduling for Wireless Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems face challenges in efficiently managing data packet transmission deadlines, particularly in scenarios with jitter and packet delay budgets, which can lead to dropped packets and reduced spectral efficiency.
Innovation Solution
Implementing a method where network nodes and user equipment (UE) communicate using deadline-based data packets, with indications of jitter, packet delay budgets, and absolute times to ensure timely data packet transmission and reception, allowing for improved scheduling and resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional packet scheduling is used without deadline information, then device complexity is reduced, but packet delivery reliability deteriorates due to dropped packets
Solution Approach 1:
The patent applies preliminary action by having the application layer provide deadline information to the network layer before packet transmission. This allows the network to proactively schedule packets based on their deadlines rather than reacting to packet drops, improving reliability while maintaining manageable scheduling complexity through advance planning
Solution Approach 2:
The patent implements feedback mechanisms where deadline information flows from the application layer to the network layer, and scheduling decisions are adjusted based on this feedback. The network monitors packet transmission timing against deadlines and adjusts scheduling to meet delivery requirements, creating a closed-loop system that improves reliability
2Reliability
If packets are prioritized to ensure timely delivery, then packet delivery reliability improves, but spectral efficiency deteriorates due to unnecessary resource allocation
Solution Approach 1:
The patent applies local quality by providing differentiated treatment to packets based on their specific deadline requirements. Instead of uniformly prioritizing all packets, the system allocates resources locally to individual packets according to their unique timing constraints, ensuring reliable delivery only when necessary and avoiding unnecessary resource consumption for packets with flexible deadlines
Solution Approach 2:
The patent changes the scheduling parameter from static priority levels to dynamic deadline-based timing. By using absolute deadline values and relative timing information, the system can adjust resource allocation parameters in real-time based on actual packet requirements, improving reliability while optimizing spectral efficiency through precise parameter control
3Productivity
If deadline-based scheduling is implemented, then spectral efficiency improves by reducing unnecessary transmissions, but device complexity increases due to additional scheduling requirements
Solution Approach 1:
The patent reduces scheduling complexity through preliminary action by having deadlines provided in advance from the application layer. This allows the network to perform scheduling calculations beforehand rather than making complex real-time decisions, improving spectral efficiency through optimized resource allocation while keeping device complexity manageable
Solution Approach 2:
The patent applies self-service by having the application layer generate and provide its own deadline information to the network layer. This self-service approach allows the application to manage its own timing requirements, reducing the burden on the network for complex scheduling decisions while still achieving improved spectral efficiency through deadline-aware resource allocation
Data Source
AI summary
Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a network node may receive an indication of a deadline for transmission of a protocol data unit (PDU) set, the indication of the deadline including one or more of: an indication of a jitter of the PDU set, an indication of a packet delay budget that is based at least in part on the jitter of the PDU set and a nominal PDU set delay budget (PSDB), or an indication of an absolute time of the deadline. The network node may transmit the PDU set at a time that is based at least in part on the indication of the deadline. Numerous other aspects are described.