A method of managing a data packet queue in a buffer associated with the radio layers of a wireless network, the buffer storing packets prior to their transmission over the radio interface. The method comprises defining minimum and maximum threshold levels for the packet queue, and for a data packet received by the buffer 1) performing a congestion avoidance procedure if the buffer queue exceeds said maximum threshold level, or 2) not performing said procedure if the buffer queue is less than said minimum threshold level, or 3) if the buffer queue lies between said maximum and minimum thresholds, performing said congestion avoidance procedure for said packet, and not performing the procedure for at least one or more subsequent packets.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A method of managing a data packet queue at a radio link layer forming part of a packet transmission link, the method comprising: measuring or estimating the round trip transmission time over said link, excluding a delay introduced by said queue; setting a threshold value based upon the measured or estimated round trip transmission time; for packets at the head of the queue, comparing a time spent in the queue with said threshold value; and in the event that the time spent in the queue exceeds said threshold value, implementing a congestion or delay avoidance procedure.
2. A method according to claim 1 , wherein said link is a WCDMA, WCDMA2000, or GPRS radio link.
3. A method according to claim 1 , wherein said link comprises the Internet.
4. A method according to claim 1 , wherein said data packets are TCP or UDP data packets.
5. A method according to claim 1 , wherein said congestion or delay avoidance procedure comprises dropping the packet at the head of the queue or another packet in the queue.
6. A method according to claim 5 , wherein said congestion or delay avoidance procedure comprises dropping one or more subsequent packets from the queue regardless of the time spent by these packets in the queue.
7. A method according to claim 5 and comprising defining a minimum queue threshold, T min , in terms of data volume or number of packets, and for one or more subsequent packets, accepting and sending the packet regardless of the queue size and packet delay, and for the following packet, determining whether the queue size exceeds the minimum threshold and the packet delay in the queue exceeds said threshold value, and if so, repeating the congestion avoidance procedure, otherwise terminating the implemented congestion avoidance procedure.
8. A method according to claim 7 , wherein n subsequent packets are accepted regardless of the queue size and packet delay, where n is an integer.
9. A method according to claim 1 and comprising defining a maximum queue threshold, T max , in terms of data volume or number of packets, and for each packet arriving at the queue, comparing the queue size with said maximum threshold and if the queue size exceeds said maximum threshold, dropping the arriving packet or another packet from the queue.
10. Apparatus for managing a data packet queue forming part of a packet transmission link, the apparatus comprising: means for storing and/or measuring or estimating the round trip transmission time over said link, excluding a delay introduced by said queue; means for defining a threshold value based on said stored, measured, or estimated round trip transmission time; processing means arranged, for packets at the head of the queue, to compare a time spent in the queue with said threshold value and, in the event that the time spent in the queue exceeds said threshold value, to implement a congestion or delay avoidance procedure.
11. An apparatus according to claim 10 , wherein said data packets are TCP or UDP data packets.
12. An apparatus according to claim 10 , wherein said congestion or delay avoidance procedure comprises dropping the packet at the head of the queue or another packet in the queue.
13. An apparatus according to claim 10 , wherein said congestion or delay avoidance procedure comprises dropping one or more subsequent packets from the queue regardless of the time spent by these packets in the queue.
14. An apparatus according to claim 10 , wherein for a minimum queue threshold, T min , defined in terms of data volume or number of packets and for one or more subsequent packets, the apparatus further comprises: means for accepting and sending the packet regardless of the queue size and packet delay, and means for determining, for a following packet, whether the queue size exceeds the minimum threshold and the packet delay in the queue exceeds said threshold value, and if so, repeating the congestion avoidance procedure, and otherwise terminating the implemented congestion avoidance procedure.
15. An apparatus according to claim 14 , wherein n subsequent packets are accepted regardless of the queue size and packet delay, where n is an integer.
16. A method according to claim 10 , wherein for a maximum queue threshold, T max , defined in terms of data volume or number of packets and for each packet arriving at the queue, the apparatus further comprises: means for comparing the queue size with said maximum threshold, and if the queue size exceeds said maximum threshold, for dropping the arriving packet or another packet from the queue.
17. A communications node comprising: a data packet queue forming part of a packet transmission link, and electronic circuitry configured to: store and/or measure or estimate the round trip transmission time over the packet transmission link excluding a delay introduced by the data packet queue; define a threshold value based on said stored, measured, or estimated round trip transmission time; and for packets at the head of the queue, compare a time spent in the queue with said threshold value and, in the event that the time spent in the queue exceeds said threshold value, implement a congestion or delay avoidance procedure.
18. A communications node according to claim 17 , wherein said congestion or delay avoidance procedure comprises dropping the packet at the head of the queue or another packet in the queue.
19. A communications node according to claim 17 , wherein said congestion or delay avoidance procedure comprises dropping one or more subsequent packets from the queue regardless of the time spent by these packets in the queue.
20. A communications node according to claim 17 , wherein for a minimum queue threshold, T min , defined in terms of data volume or number of packets and for one or more subsequent packets, the electronic circuitry is configured to: accept and send the packet regardless of the queue size and packet delay, and determine, for a following packet, whether the queue size exceeds the minimum threshold and the packet delay in the queue exceeds said threshold value, and if so, repeat the congestion avoidance procedure, and otherwise terminate the implemented congestion avoidance procedure.
21. A communications node according to claim 20 , wherein n subsequent packets are accepted regardless of the queue size and packet delay, where n is an integer.
22. A communications node according to claim 17 , wherein for a maximum queue threshold, T max , defined in terms of data volume or number of packets and for each packet arriving at the queue, the electronic circuitry is configured to compare the queue size with said maximum threshold, and if the queue size exceeds said maximum threshold, drop the arriving packet or another packet from the queue.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
October 19, 2009
January 31, 2012
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.