METHOD AND APPARATUS FOR MANAGING A BUFFER IN A COMMUNICATION SYSTEM

• US 20080130670A1
• Filed: 12/05/2007
• Published: 06/05/2008
• Est. Priority Date: 12/05/2006
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: KIM, Han-Seok, KIM, Ki-Back, PARK, Eun-Chan
• Granted Patent: US 7,835,277 B2
• Time in Patent Office: Days
• US Class Current: 370/412
• CPC Class Codes: H04L 65/80 Responding to QoS
• CPC Class Codes: H04W 72/542 using measured or perceived quality
• CPC Class Codes: H04W 72/569 of the traffic information

Abstract

A method and apparatus for managing a buffer of a Radio Access Station (RAS) in a communication system are provided. An available buffer space determiner sets a threshold for each service class for scheduling packet input/output of the buffer according to priority of a service class, estimates and stores, upon receipt of a packet at the buffer, an available space size of the buffer after the packet reception, compares the estimated available space size of the buffer with a first threshold corresponding to a first service class indicative of a service class of the packet, and schedules packet input/output of the buffer according to the comparison result. A processor module schedules packet input/output of the buffer according to an output of the available buffer space determiner. The present invention can improve quality of services through service differentiation based on priorities of service classes and buffer management based on characteristics of the corresponding service traffics.

Claims

1. A method for managing a buffer of a Radio Access Station (RAS) in a communication system, the method comprising:

setting a threshold for each of a plurality of service classes;

upon receipt of a packet at the buffer, estimating a size of an available space of the buffer after the receipt of the packet;

comparing the estimated size with a first threshold corresponding to a first service class indicative of the service of the packet; and

scheduling at least one of a packet input and a packet output of the buffer according to a result of the comparison.

2. The method of claim 1, wherein the scheduling comprises stopping the first service and stopping inflow of the packet if the estimated size is less than the first threshold.

3. The method of claim 2, further comprising:

transmitting a first service stop message indicating a stop of the first service to a processor module;

upon receipt of a first service stop response message from the processor module, stopping the first service; and

upon failure to receive the first service stop response message from the processor module for a preset retransmission time, retransmitting the first service stop message to the processor module.

4. The method of claim 2, wherein the scheduling further comprises restarting the stopped inflow of the packet if the estimated size is greater than or equal to the first threshold.

5. The method of claim 4, further comprising:

transmitting a first service restart message indicating a restart of the first service to a processor module;

upon receipt of a first service restart response message from the processor module, restarting the first service; and

upon failure to receive the first service restart response message from the processor module for a preset retransmission time, retransmitting the first service restart message to the processor module.

6. The method of claim 1, wherein each of the plurality of service classes comprises at least one of a Real-Time (RT) service class susceptible to a time delay, a Non-Real-Time (NRT) service class having high priority regardless of the time delay, and a Best Effort (BE) service class having no service requirement.

7. The method of claim 6, further comprising determining a total size of the buffer for guaranteeing services of the RT service class and the NRT service class.

8. The method of claim 7, further comprising determining a total size of the buffer to maximize utilization efficiency of a wireless channel for the BE service class.

9. The method of claim 1, wherein the scheduling comprises:

determining a second threshold corresponding to a minimum change for determining at least one of a stop time and a start time of the first service; and

stopping the first service and stopping inflow of the packet if the estimated size is less than a difference between the first threshold and the second threshold.

10. The method of claim 9, wherein the scheduling comprises:

restarting the first service and restarting the inflow of the packet if the estimated size is greater than a sum of the first threshold and the second threshold.

11. The method of claim 1, wherein the scheduling comprises:

determining a time interval for determining at least one of a stop time and a restart time of the first service;

starting a timer which is set to the time interval, if the estimated size is less than the first threshold; and

stopping the inflow of the packet if an available space size of the buffer, estimated after expiration of the timer, is less than the first threshold.

12. The method of claim 11, wherein the scheduling further comprises:

determining a time interval for determining at least one of a stop time and a restart time of the first service;

starting a timer which is set to the time interval, if the estimated available space size of the buffer is greater than the first threshold;

restarting the inflow of the packet if an available space size of the buffer, estimated after expiration of the timer, is greater than the first threshold.

13. An apparatus for managing a buffer of a Radio Access Station (RAS) in a communication system, the apparatus comprising:

an available buffer space determiner for setting a threshold for each of a plurality of service classes, for estimating, upon receipt of a packet at the buffer, a size of an available space of the buffer after receipt of the packet, for comparing the estimated size with a first threshold corresponding to a first service class indicative of the service of the packet, and for scheduling packet input/output of the buffer according to the comparison result; and

a processor module for scheduling at least one of packet input and packet output of the buffer according to an output of the available buffer space determiner.

14. The apparatus of claim 13, wherein the available buffer space determiner:

transmits a first service stop message indicating a stop of the first service to the processor module if the estimated size is less than the first threshold;

upon receipt of a first service stop response message from the processor module, recognizes the stop of the first service; and

upon failure to receive the first service stop response message from the processor module for a preset retransmission time, retransmits the first service stop message to the processor module.

15. The apparatus of claim 14, wherein the available buffer space determiner:

transmits a first service restart message indicating a restart of the stopped first service to the processor module, if the estimated size is greater than the first threshold;

upon receipt of a first service restart response message from the processor module, recognizes the restart of the first service; and

upon failure to receive the first service restart response message from the processor module for a preset retransmission time, retransmits the first service restart message to the processor module.

16. The apparatus of claim 13, wherein each of the plurality of service classes comprises at least one of a Real-Time (RT) service class susceptible to a time delay, a Non-Real-Time (NRT) service class having high priority regardless of the time delay, and a Best Effort (BE) service class having no service requirement.

17. The apparatus of claim 16, further comprising a buffer size determiner for determining a total size of the buffer for guaranteeing services of the RT service class and the NRT service class.

18. The apparatus of claim 17, wherein the buffer size determiner further determines a total size of the buffer to maximize utilization efficiency of a wireless channel for the BE service class.

19. The apparatus of claim 13, wherein the available buffer space determiner:

determines a second threshold corresponding to a minimum change for determining a stop/start time of the first service;

transmits a first service stop message to the processor module if the estimated size is less than a difference between the first threshold and the second threshold; and

transmits a first service restart message to the processor module if the estimated size is greater than a sum of the first threshold and the second threshold.

20. The apparatus of claim 13, wherein the available buffer space determiner:

determines a time interval for determining a stop/restart time of the first service;

starts a timer which is set to the time interval, if the estimated size is less than the first threshold; and

transmits a first service stop message to the processor module if an available space size of the buffer, estimated after expiration of the timer, is less than the first threshold.

21. The apparatus of claim 20, wherein the available buffer space determiner:

starts a timer which is set to the time interval, if the estimated size is greater than the first threshold; and

after expiration of the timer, transmits a first service restart message to the processor module if an available space size of the buffer, estimated after expiration of the timer, is greater than the first threshold.