HARQ Packet Reordering via Dynamic Timer Adaptation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional reordering methods in HARQ-based mobile telecommunication systems are inefficient due to their reliance on a fixed timer, which fails to consider the varying conditions of missing packets, leading to excessive waiting times and delayed transmission of important upper layer packets.
Innovation Solution
A method and apparatus that utilize a reordering timer adapted to measure a variable length of time based on the HARQ processing time of missing packets, allowing for dynamic waiting periods to reorder packets efficiently, thereby reducing delays and improving communication efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a fixed timer is used for reordering packets, then the reordering process is simple to implement, but the waiting time becomes excessive and packet transmission is delayed
Solution Approach 1:
The patent applies the dynamics principle by transforming the fixed timer into a dynamic timer that adapts its duration based on HARQ processing time. The timer is no longer static but adjusts according to the actual processing requirements of each packet, allowing the system to optimize waiting time dynamically rather than using a one-size-fits-all fixed duration.
Solution Approach 2:
The patent implements parameter changes by modifying the timer duration parameter based on HARQ processing time measurements. Instead of using a constant timer value, the system varies the timer parameter according to the actual processing time required for each packet, enabling more precise control over the reordering process and reducing unnecessary waiting time.
2Device complexity
If a fixed timer is used for reordering packets, then the system complexity remains low, but the buffer capacity requirements increase
Solution Approach 1:
The dynamic timer adjusts the waiting period based on actual HARQ processing time, which prevents packets from being held in buffers longer than necessary. This dynamic adjustment reduces the amount of data that needs to be stored in buffers, thereby lowering buffer capacity requirements while maintaining system reliability.
Solution Approach 2:
The system uses measured HARQ processing time from actual operations to automatically adjust timer durations, eliminating the need for conservative over-provisioning of buffer capacity. The system serves itself by using its own operational data to optimize timing parameters, reducing resource requirements without external intervention.
3Ease of operation
If a fixed timer is used for reordering packets, then the processing procedure is straightforward, but the packet processing rate decreases
Solution Approach 1:
By changing the timer parameter from a fixed value to a dynamic value based on HARQ processing time, the system optimizes the waiting period for each packet. This parameter adjustment reduces unnecessary delays in the packet processing pipeline, thereby increasing the overall packet processing rate while maintaining procedural simplicity.
Solution Approach 2:
The system performs preliminary measurement of HARQ processing time before setting the timer duration for reordering. This preliminary action allows the system to prepare the optimal timer value in advance, avoiding delays during the actual reordering process and improving the overall processing rate.
Data Source
AI summary
Disclosed is a method and an apparatus for reordering received packets in a mobile telecommunication system supporting HARQ so that the problem of order change is solved. The method includes receiving from a receiving-side HARQ entity an input of a packet and processing time spent by the packet going through an HARQ operation; determining if a gap corresponding to at least one missing packet among received packets is detected based on the input packet belonging to the received packets and, when the gap is detected, waiting for the missing packet belonging to the gap to be received for a period of time obtained by subtracting the processing time from a predetermined maximum waiting value; and outputting the received packets to an upper layer in an order when the missing packet belonging to the gap fails to be received before the expiration of the period of time.