METHODS FOR TRANSMITTING BUFFER SIZE INFORMATION

• US 20080120445A1
• Filed: 03/15/2007
• Published: 05/22/2008
• Est. Priority Date: 11/06/2006
• Status: Active Grant

• Current Assignee: Samsung Electronics Co. Ltd.
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Jeong, Kyeong-In, Choi, Sung Ho, Kim, Soeng Hun, Jang, Kyung Hun
• Granted Patent: US 8,452,902 B2
• Time in Patent Office: Days
• US Class Current: 710/52
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/26 using explicit feedback to the source, e.g. choke packets
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04W 8/20 Transfer of user or subscriber data

Abstract

A method of transmitting information about a buffer size includes transmitting a bit string comprising a first bit string and a second bit string when the buffer size is greater than or equal to a first value, the first bit string indicating a quotient which is acquired by dividing the buffer size by a second value, and the second bit string indicating a value corresponding to a remainder which is acquired by dividing the buffer size by the second value.

Claims

1. A communication apparatus comprising:

a module to transmit a bit string comprising a first bit string and a second bit string,

wherein, when a buffer size of the communication apparatus is greater than or equal to a first value, the first bit string indicates a quotient of the buffer size divided by a second value and the second bit string indicates a value corresponding to a remainder of the buffer size divided by the second value.

2. The communication apparatus of claim 1, wherein, when the buffer size is less than the first value, the first bit string indicates the exact buffer size and the second bit string is set to a third value.

3. The communication apparatus of claim 2, wherein, when the buffer size is greater than or equal to the first value, the second bit string is not set to the third value.

4. The communication apparatus of claim 3, wherein the first bit string comprises N bits and the first value is 2^N.

5. The communication apparatus of claim 4, wherein the second bit string comprises M bits and M is an integer greater than or equal to 2.

6. The communication apparatus of claim 5, wherein, when the buffer size is greater than or equal to the first value, the ranges of values corresponding to each value of the second bit string are nearly identical.

7. The communication apparatus of claim 1, wherein the first bit string comprises N bits and the first value is 2^N.

8. The communication apparatus of claim 7, wherein N is the minimum integer for which 2^2N−

1 is greater than or equal to a maximum buffer size.

9. The communication apparatus of claim 7, wherein N is 7.

10. The communication apparatus of claim 1, wherein the second bit string comprises M bits and M is an integer greater than or equal to 2.

11. The communication apparatus of claim 1, wherein the second value is identical to the first value.

12. The communication apparatus of claim 11, wherein the second value is 2^N.

13. A communication apparatus comprising:

a module to transmit a bit string comprising an N bit first bit string and an M bit second bit string,

wherein N is the minimum integer for which 2^2N−

1 is greater than or equal to a maximum buffer size and M is an integer greater than or equal to 2.

14. The communication apparatus of claim 13, wherein:

the first bit string indicates a quotient of the buffer size divided by 2^N; and

the second bit string indicates a value corresponding to a remainder of the buffer size divided by 2^N, when the buffer size of the communication apparatus is greater than or equal to 2^N.

15. The communication apparatus of claim 14, wherein, when the buffer size is greater than or equal to 2^N, a difference between sizes of ranges of remainders corresponding to each value of the second bit string is less than or equal to 1.

16. The communication apparatus of claim 13, wherein, when the buffer size is less than 2^N, the first bit string precisely indicates the buffer size and the second string is set to a third value.

17. The communication apparatus of claim 16, wherein, when the buffer size is greater than or equal to 2^N, the second bit string is not the third value.

18. A communication apparatus comprising:

an extractor to extract an N bit first bit string and an M bit second bit string from a bit string that includes buffer size information received from another communication apparatus;

wherein, when the second bit string is a certain value, the first bit string is interpreted as a buffer size of the other communication apparatus.

19. The communication apparatus of claim 18, wherein a result value is interpreted as the buffer size of the other communication apparatus when the second bit string is not the certain value, the result value being acquired by multiplying the first bit string by a first value and summing the result of the multiplication and a value determined according to the second bit string.

20. The communication apparatus of claim 18, wherein the first value is 2^N.

21. A method of transmitting information about a buffer size, the method comprising:

transmitting a bit string comprising a first bit string and a second bit string when the buffer size is greater than or equal to a first value, the first bit string indicating a quotient of the buffer size divided by a second value and the second bit string indicating a value corresponding to a remainder of the buffer size divided by the second value.

22. The method of claim 21, wherein, when the buffer size is less than the first value, the first bit string precisely indicates the buffer size and the second bit string is set to a third value.

23. The method of claim 22, wherein, when the buffer size is greater than or equal to the first value, the second bit string is not set to the third value.

24. The method of claim 21, wherein the first bit string comprises N bits and the first value is 2^N.

25. The method of claim 24, wherein N is the minimum integer for which 2^2N−

1 is greater than or equal to a maximum buffer size.

26. The method of claim 21, wherein the second bit string comprises M bits and M is an integer greater than or equal to 2.

27. The method of claim 26, wherein the first value and the second value are 2^N.

28. A method of transmitting information about a buffer size, the method comprising:

transmitting a bit string comprising an N bit first bit string and an M bit second bit string, N being the minimum integer for which 2^2N−

1 is greater than or equal to a maximum buffer size, and M being an integer greater than or equal to 2.

29. The method of claim 28, wherein, when the buffer size is greater than or equal to 2^N, the first bit string indicates a quotient of the buffer size divided by 2^N and the second bit string indicates a value corresponding to a remainder of the buffer size divided by 2^N.

30. The method of claim 29, wherein, when the buffer size is greater than or equal to 2^N, a difference between sizes of ranges of remainder values corresponding to each value of the second bit string is less than or equal to 1.

31. The method of claim 28, wherein, when the buffer size is less than 2^N, the first bit string precisely indicates the buffer size and the second string is set to a third value.

32. The method of claim 31, wherein, when the buffer size is greater than or equal to 2^N, the second bit string is not set to the third value.

33. A method of receiving buffer size information, the method comprising:

receiving buffer size information from a communication apparatus;

extracting an N bit first bit string and an M bit second bit string from a bit string included in the buffer size information; and

interpreting the first bit string as a buffer size of the communication apparatus when the second bit string is a certain value.

34. The method of claim 33, further comprising, when the second bit string is not the certain value:

acquiring a result value by multiplying the first bit string by a first value and summing the result of the multiplication and a second value determined according to the second bit string; and

interpreting the result value as the buffer size of the communication apparatus.

35. The method of claim 34, wherein the first value is 2^N.

36. A computer readable recording medium storing a program for implementing a method of transmitting information about a buffer size, comprising:

transmitting a bit string comprising a first bit string and a second bit string when the buffer size is greater than or equal to a first value, the first bit string indicating a quotient of the buffer size divided by a second value and the second bit string indicating a value corresponding to a remainder of the buffer size divided by the second value.

37. A method of transmitting a buffer size, the method comprising:

transmitting a buffer status report comprising a plurality of resource blocks, wherein each resource block includes a resource block ID and a buffer size;

wherein the buffer size is a bit string corresponding to an approximation of the size of a buffer of a mobile terminal and the error of the approximation does not increase in proportion to an increase in the buffer size.

38. A method of transmitting a buffer size, the method comprising:

transmitting a bit string corresponding to an approximation of a size of a buffer of a mobile terminal, wherein the error of the approximation does not increase in proportion to an increase in the buffer size.