Data flow control method

• US 7,203,167 B2
• Filed: 04/01/2002
• Issued: 04/10/2007
• Est. Priority Date: 04/04/2001
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Ludwig, Reiner, Meyer, Michael
• Primary Examiner(s): Kizou; Hassan
• Assistant Examiner(s): Adrami; M. Sajid
• Application Number:
  US10/114,517
• Publication Number:
  US 20020145976A1
• Time in Patent Office: 1,835 Days
• Field of Search: 714/748, 370/229, 370/236, 370/231
• US Class Current: 370/231
• CPC Class Codes: H04L 1/0001 Systems modifying transmission characteristics according to link quality, e.g. power backoff adaptive data allocation for multicarrier modulation H04L5/0044; controlling transmission power for radio systems H04W52/04
• CPC Class Codes: H04L 1/1635 Cumulative acknowledgement, i.e. the acknowledgement message applying to all previous messages
• CPC Class Codes: H04L 1/1809 Selective-repeat protocols
• CPC Class Codes: H04L 1/1887 Scheduling and prioritising arrangements
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/18 End to end
• CPC Class Codes: H04L 47/193 at the transport layer, e.g. TCP related
• CPC Class Codes: H04L 47/27 Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
• CPC Class Codes: H04L 47/283 in response to processing delays, e.g. caused by jitter or round trip time [RTT]
• CPC Class Codes: H04L 47/29 using a combination of thresholds
• CPC Class Codes: H04L 47/34 ensuring sequence integrity, e.g. using sequence numbers
• CPC Class Codes: H04L 69/16 Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
• CPC Class Codes: H04L 69/163 In-band adaptation of TCP data exchange; In-band control procedures

Abstract

A method of controlling the flow of an amount of data from a sending peer to a receiving peer of a predetermined communication protocol is described. The method comprises dividing the amount of data into a plurality of data segments, where the data segments are ordered in a sequence. The segments are sent to the receiving peer in the order of said sequence. The receiving peer acknowledges the correct receipt of a data segment and identifies the last correctly received data segment of the sequence that was received in the proper order of the sequence. The sending peer is arranged such that if it receives a threshold number of duplicate acknowledgements, it performs a retransmission. The threshold number that trigger a retransmission is an adaptive parameter and may assume values larger than three.

Claims

1. A method of controlling the flow of an amount of data from a sending peer to a receiving peer of a predetermined communication protocol, comprising:

dividing said amount of data into a plurality of data segments, said data segments being ordered in a sequence,

transmitting said data segments from said sending peer to said receiving peer in the order of said sequence,

determining at said receiving peer if a data segment was received correctly, and if a correctly received data segment is in the proper order of said sequence,

sending acknowledgment messages from said receiving peer to said sending peer, where an acknowledgment message indicates the correct receipt of a data segment and identifies the last correctly received data segment of said sequence that was received in the proper order of said sequence, and

if the sending peer receives a threshold number of duplicate acknowledgement messages that each identify the same one data segment as the last correctly received data segment of said sequence that was received in the proper order of said sequence, retransmitting the segment that immediately follows said one data segment, where said method comprises a threshold number adaptation procedure performed by the sending peer for dynamically adapting said threshold number, where the current value of the duplicate acknowledgement threshold is determined on the basis of measurements made with respect to the characteristics of the connection between the sending peer and the receiving peer and where said threshold number adaptation procedure is arranged such that said threshold number may assume values larger than three.

2. The method of claim 1, wherein said threshold number adaptation procedure comprises:

performing a data segment number determination procedure, said data segment number being an integer that identifies a number of data segments belonging to a predetermined group associated with flow control, dividing said number of data segments by a predetermined factor, and adapting said threshold number on the basis of the result of dividing said number of data segments by the predetermined factor.

3. The method of claim 2, wherein said predetermined factor is an integer.

4. The method of claim 3, wherein said predetermined factor is two.

5. The method of claim 2, wherein said step of adapting said threshold number on the basis of the result of dividing said number of data segments by the predetermined factor comprises setting said threshold number equal to said result if said result is an integer, and otherwise performing a predetermined rounding operation on said result and then setting the threshold number equal to the result of said rounding operation.

6. The method of claim 2, wherein the controlling of the flow of data segments involves a sliding window technique using one or more windows, and said predetermined group is associated with a given one of said one or more windows.

7. The method of claim 6, wherein said predetermined group is associated with a window that is calculated by said sending peer.

8. The method of claim 6, wherein said given window is a congestion window, a congestion window being associated with a flow control sub-procedure according to which at the beginning of sending said plurality of data segments, said sending peer initializes the size of said congestion window to a predetermined initial value and then controls the size in dependence on said acknowledgement messages and on the occurrence of congestion indicating events.

9. The method of claim 8, wherein said predetermined communication protocol is the Transmission Control Protocol, and said congestion window is the TOP congestion window.

10. The method of claim 6, wherein said data segment number determination procedure comprises dividing the size of said given window by a data segment size indicator.

11. The method of claim 10, wherein said data segment size indicator is the maximum segment size.

12. The method of claim 2, wherein said predetermined group is the set of outstanding data segments, such that said data segment number is equal to the number of outstanding data segments, an outstanding data segment being a data segment that was sent by said sending peer, but for which said sending peer did not receive an acknowledgement message identifying said data segment as the last correctly received data segment of said sequence that was received in the proper order of said sequence.

13. The method of claim 2, wherein said threshold number is adapted each time that the predetermined group changes.

14. The method of claim 1, wherein said threshold number is updated at least each first time that a duplicate acknowledgement message for one of said data segments is received.

15. The method of claim 14, wherein said threshold number is updated each time that a duplicate acknowledgement message is received.

16. The method of claim 1, wherein said threshold number is updated each time that an acknowledgement message is received.

17. The method of claim 1, wherein said threshold number is updated each time that an acknowledgement message is received that identifies an outstanding data segment, an outstanding segment being a segment that was sent by said sending peer, but for which said sending peer did not receive an acknowledgement message identifying said segment as the last correctly received data segment of said sequence that was received in the proper order of said sequence.

18. The method of claim 1, wherein said predetermined communication protocol lies at a first protocol layer, and a second protocol layer comprising a predetermined protocol implementation is provided below said first protocol layer for receiving said data segments from the sending peer of said predetermined communication protocol and releasing said data segments to the receiving peer of said predetermined communication protocol, where said predetermined protocol implementation is operable to release said data segments out of order of said sequence.

19. The method of claim 18, wherein said first protocol layer is a transport layer, and said second protocol layer is a link layer.

20. A computer program arranged to perform the method of claim 1 when executed on a computer.

21. A computer readable memory device that stores the computer program of claim 20.

22. A communication device arranged to send and receive data, said communication device being arranged to operate as a sending and/or receiving peer in accordance with the method of claim 1.

23. The method of claim 1 wherein the characteristics of the connection between the sending peer and the receiving peer are characteristics comprised from the group consisting of:

an amount of disturbance of the connection, average transmission time for transmitting the data segment, and average transmission delay for transmitting the data segment.

24. The method of claim 1 wherein the duplicate acknowledgment threshold is adapted on the basis of the number of outstanding data segments sent from the sending peer to the receiving peer.