Performance of data transmission using adaptive technique

• US 20040190451A1
• Filed: 03/26/2003
• Published: 09/30/2004
• Est. Priority Date: 03/26/2003
• Status: Active Grant

• Current Assignee: Sony Corporation (Sony Group Corp.), Sony Electronics Inc. (Sony Group Corp.)
• Original Assignee: Sony Corporation (Sony Group Corp.), Sony Electronics Inc. (Sony Group Corp.)
• Inventors: Dacosta, Behram M.
• Granted Patent: US 6,912,198 B2
• Time in Patent Office: Days
• US Class Current: 370/230
• CPC Class Codes: H04L 1/0003 by switching between different modulation schemes
• CPC Class Codes: H04L 1/0007 by modifying the frame length
• CPC Class Codes: H04L 1/0017 where the mode-switching is based on Quality of Service requirement
• CPC Class Codes: H04L 1/16 in which the return channel carries supervisory signals, e.g. repetition request signals
• CPC Class Codes: Y02D 30/50 in wire-line communication networks, e.g. low power modes or reduced link rate

Abstract

An embodiment of the present invention is a technique to adaptively generate a parameter value for data transmission. Queue entries in a queue are updated. The queue is indexed by a parameter according to a transmission status of a current packet in a data stream. The current packet is transmitted using a current value of the parameter. A plurality of performance scores are calculated based on the queue entries. A best value of the parameter that corresponds to a best score in the plurality of performance scores is selected.

Claims

1. A method comprising:

updating queue entries in a queue indexed by a parameter according to a transmission status of a current packet in a data stream, the current packet being transmitted using a current value of the parameter;

calculating a plurality of performance scores based on the queue entries; and

selecting a best value of the parameter that corresponds to a best score in the plurality of performance scores.

2. The method of claim 1 further comprising:

transmitting a next packet in the data stream using the best value.

3. The method of claim 1 wherein updating comprises:

updating a counter corresponding to a history window of transmitted packets;

removing an oldest entry in the queue if the counter exceeds a maximum window size;

inserting a new entry in the queue indicating the transmission status of the current packet.

4. The method of claim 1 wherein calculating comprises:

determining success rates of transmitted packets using the updated queue entries, the transmitted packets being at least ones of actual data packets and probe packets; and

applying a function to the success rates and theoretical values of the parameter, the applied function generating the performance scores.

5. The method of claim 4 wherein applying comprises:

multiplying the success rates with the theoretical values of the parameter.

6. The method of claim 4 wherein applying comprises:

applying the function to the success rates with the theoretical values of the parameter using the current value, a higher value, and a lower value.

7. The method of claim 1 wherein updating comprises:

updating the queue entries in the queue indexed by the parameter, the parameter being one of a modulation method, a packet size, and a transmit power.

8. The method of claim 1 further comprising:

applying a hysteresis to the queue entries.

9. The method of claim 7 wherein the modulation method is one of a binary phase shift keying (BPSK), a quadrature phase shift keying (QPSK), a 16-quadrature amplitude modulation (16-QAM), and a 64-QAM.

10. The method of claim 4 wherein the theoretical values are ones of theoretical throughput data rates assuming no errors and theoretical protocol overhead percentages.

11. An article of manufacture comprising:

a machine-accessible medium including data that, when accessed by a machine, causes the machine to perform operations comprising;

updating queue entries in a queue indexed by a parameter according to a transmission status of a current packet in a data stream, the current packet being transmitted using a current value of the parameter;

calculating a plurality of performance scores based on the queue; and

selecting a best value of the parameter that corresponds to a best score in the plurality of performance scores.

12. The article of manufacture of claim 11 wherein the data further comprises data that, when accessed by the machine, causes the machine to perform operations comprising:

transmitting a next packet in the data stream using the best value.

13. The article of manufacture of claim 11 wherein the data causing the machine to perform updating comprises data that, when accessed by the machine, causes the machine to perform operations comprising:

updating a counter corresponding to a history window of transmitted packets;

removing an oldest entry in the queue if the counter exceeds a maximum window size;

inserting a new entry in the queue indicating the transmission status of the current packet.

14. The article of manufacture of claim 11 wherein the data causing the machine to perform calculating comprises data that, when accessed by the machine, causes the machine to perform operations comprising:

determining success rates of transmitted packets using the updated queue entries, the transmitted packets being at least ones of actual data packets and probe packets; and

applying a function to the success rates and theoretical values of the parameter, the applied function generating the performance scores.

15. The article of manufacture of claim 14 wherein the data causing the machine to perform applying comprises data that, when accessed by the machine, causes the machine to perform operations comprising:

multiplying the success rates with the theoretical values of the parameter.

16. The article of manufacture of claim 14 wherein the data causing the machine to perform applying comprises data that, when accessed by the machine, causes the machine to perform operations comprising:

applying the function to the success rates with the theoretical values of the parameter using the current value, a higher value, and a lower value.

17. The article of manufacture of claim 11 wherein the data causing the machine to perform updating comprises data that, when accessed by the machine, causes the machine to perform operations comprising:

updating the queue entries in the queue indexed by the parameter, the parameter being one of a modulation method, a packet size, and a transmit power.

18. The article of manufacture of claim 11 the data further comprises data that, when accessed by the machine, causes the machine to perform operations comprising:

applying a hysteresis to the queue entries.

19. The article of manufacture of claim 17 wherein the modulation method is one of a binary phase shift keying (BPSK), a quadrature phase shift keying (QPSK), a 16-quadrature amplitude modulation (16-QAM), and a 64-QAM.

20. The article of manufacture of claim 14 wherein the theoretical values are ones of theoretical throughput data rates assuming no errors and theoretical protocol overhead percentages.

21. A system comprising:

a radio frequency (RF) section to transmit a radio signal from a baseband signal;

a baseband processor coupled to the RF section to generate the baseband signal from a data stream; and

a medium access controller (MAC) coupled to the RF section and the baseband processor, the MAC having a processor and a memory containing instructions that causes the processor to;

update queue entries in a queue indexed by a parameter according to a transmission status of a current packet in a data stream, the current packet being transmitted using a current value of the parameter,

calculate a plurality of performance scores based on the queue entries, and

select a best value of the parameter that corresponds to a best score in the

plurality of performance scores.

22. The system of claim 21 wherein the instructions further cause the processor to:

transmit a next packet in the data stream using the best value.

23. The system of claim 21 wherein the instructions causing the processor to update comprises instructions that cause the processor to:

update a counter corresponding to a history window of transmitted packets;

remove an oldest entry in the queue if the counter exceeds a maximum window size;

insert a new entry in the queue indicating the transmission status of the current packet.

24. The system of claim 21 wherein the instructions causing the processor to calculate comprises instructions that cause the processor to:

determine success rates of transmitted packets using the updated queue entries, the transmitted packets being at least ones of actual data packets and probe packets; and

apply a function to the success rates and theoretical values of the parameter, the applied function generating the performance scores.

25. The system of claim 24 wherein the instructions causing the processor to apply comprises instructions that cause the processor to:

multiply the success rates with the theoretical values of the parameter.

26. The system of claim 24 wherein the instructions causing the processor to apply comprises instructions that cause the processor to:

apply the function to the success rates with the theoretical values of the parameter using the current value, a higher value, and a lower value.

27. The system of claim 21 wherein the instructions causing the processor to update comprises instructions that cause the processor to:

update the queue entries in the queue indexed by the parameter, the parameter being one of a modulation method, a packet size, and a transmit power.

28. The system of claim 21 the instructions further comprises instructions that cause the processor to:

apply a hysteresis to the queue entries.

29. The system of claim 27 wherein the modulation method is one of a binary phase shift keying (BPSK), a quadrature phase shift keying (QPSK), a 16-quadrature amplitude modulation (16-QAM), and a 64-QAM.

30. The system of claim 24 wherein the theoretical values are ones of theoretical throughput data rates assuming no errors and theoretical protocol overhead percentages.