Telecommunications Node Packet Prioritization via Segmented Queues
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In telecommunications, particularly in cellular radio systems using High Speed Downlink Packet Access (HSDPA), there is a challenge with delayed data transmission due to lower priority data buffering at radio base stations, leading to inefficient use of resources and unnecessary retransmissions, as existing solutions like classic HS-DSCH flow control and Distributed Active Queue Management (D-AQM) take longer to convey data and result in wasted bandwidth.
Innovation Solution
Implementing a method where priority packets are expedited by storing them in a separate queue or subsection of the queue structure, ensuring they are read out before ordinary packets, using predetermined bits in frames to identify priority packets and allocate resources accordingly, thus bypassing buffered ordinary data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If data packets are stored in a single queue structure in order of arrival, then the queue management is simple, but time-critical packets experience excessive delay due to buffering behind lower priority data
Solution Approach 1:
The patent divides the single queue structure into multiple priority-based queues (first priority queue, second priority queue, third priority queue) to segment packet storage based on priority level. This allows time-critical packets to be stored separately and transmitted without delay, while maintaining relatively simple queue management through priority-based scheduling. The segmentation resolves the contradiction by enabling faster packet transmission without requiring complex packet inspection or routing mechanisms.
Solution Approach 2:
The patent implements preliminary action by pre-establishing multiple priority queues with predetermined priorities before packet arrival. When packets arrive, they are directly routed to the appropriate pre-configured queue based on their priority level, avoiding the need for complex real-time decision-making. This preliminary setup enables time-critical packets to be immediately placed in the highest priority queue, reducing transmission delay without adding operational complexity.
2Reliability
If priority packets are identified using predetermined bits in frames, then packet prioritization is achieved, but frame structure complexity increases
Solution Approach 1:
The patent applies local quality by adding priority indication bits only at specific locations within the frame structure where they provide the most effective prioritization functionality. Rather than fundamentally redesigning the entire frame structure, the priority bits are locally integrated into existing frame fields, maintaining compatibility while enabling reliable packet identification. This approach achieves accurate priority packet identification without substantially increasing overall frame structure complexity.
3Productivity
If existing flow control solutions like D-AQM are used, then data transmission is managed, but unnecessary retransmissions occur and bandwidth is wasted
Solution Approach 1:
The patent implements feedback mechanisms where the network node monitors packet transmission status and adjusts queue management accordingly. By tracking which packets have been successfully transmitted and which require retransmission, the system can prevent unnecessary retransmissions of priority packets that are already in the highest priority queue. This feedback loop improves data transmission efficiency by avoiding redundant transmissions and reduces bandwidth waste by prioritizing only packets that genuinely need retransmission.
Data Source
AI summary
A method of operating a telecommunications node (28) through which packets of differing priority are conveyed comprises receiving plural data packets from a source external (26) to the node, the plural data packets including both ordinary packets and a priority packet; and storing the plural data packets in a queue structure (36) in order of arrival so that the priority packet is read out of the queue structure before the ordinary packets are read out of the queue structure (36), thereby expediting output of the priority packet from the node relative to the ordinary packets.