Methods and apparatus for quality of service control for TCP aggregates at a bottleneck link in the internet

• US 20030214908A1
• Filed: 03/17/2003
• Published: 11/20/2003
• Est. Priority Date: 03/19/2002
• Status: Abandoned Application

• Current Assignee: Himachal Futuristic Communications Limited
• Original Assignee: Himachal Futuristic Communications Limited
• Inventors: Hegde, Malati, S.V.R., Anand, Shivshankari, S., Kumar, Anurag, Kuri, Joy
• Application Number:
  US10/388,770
• Publication Number:
  US 20030214908A1
• Time in Patent Office: Days
• US Class Current: 370/234
• CPC Class Codes: H04L 1/0002 by adapting the transmission rate
• CPC Class Codes: H04L 1/0018 based on latency requirement
• CPC Class Codes: H04L 1/16 in which the return channel carries supervisory signals, e.g. repetition request signals

Abstract

A network device that is inserted in the path of traffic in a packet network, and the associated procedures and controller algorithms for monitoring the performance of aggregates of short lived Transmission Control Protocol (TCP) Connections flowing over a bottleneck link and dynamically managing their performance. TCP operates by allowing a certain window of data to be outstanding between the source and the receiver of each transfer and if many transfers attempt to share the network, congestion occurs, thus reducing the transmission rate of ongoing transfers. The method and apparatus aim at the performance of an aggregate of short-lived connections and hence measure only the RTT (Round Trip Time) for the aggregate and determine a window for the aggregate. By setting a target performance for the entire aggregate a measurement is made over the aggregate to determine the current performance level for each value of control eg. A RD (Random Drop) probability, or a value of MWA (Modified window Advertisement). If MWA is used and the target is RTT then the algorithm update level and a running measurement of the minimum RTT, is maintained, which is taken to be RTPD (Round Trip Propagation Delay) hence giving the algorithm that computes minimum RTT a long but finite memory. This is achieved by carrying out the following set-ups at each instant update—

(a) Measuring the average RTT over the previous measurement interval and subtracting from this the RTPD estimate to obtain queuing delay.

(b) Adjusting MWA (W_k) in the just elapsed measurement interval as follows—W_k+1=W_k−9_k−1_x (measured delay-target queuing delay).

(c) Applying the MWA W_k+1 over the next measurement.

Claims

1. ) An intrusive bandwidth manager apparatus that manages the average performance of aggregates of finite volume (and hence short-lived) TCP flows, and the associated control methods that need to make only average measurements over the (randomly varying number of) flows in an aggregate, and do not need to maintain per flow state, do not queue packets of the connections in the bandwidth manager, nor do they need to take per individual flow actions in order to achieve the average performance objectives.

2. ) A router containing the said control method of claim 1.

3. ) The intrusive bandwidth manager apparatus of claim 1 wherein the said bandwidth manager contains a control method that sets a control parameter (whereby “

control parameter”

is meant a parameter such as Random Drop Probability, Maximum Window Advertisement, Forced Delay, etc.) for an entire aggregate of finite volume (and hence short-lived) TCP flows.

4. ) The intrusive bandwidth manager apparatus of claim 1 wherein the said bandwidth manager contains a control method that adaptively adjusts the control parameter (where by “

control parameter”

is meant a parameter such as Random Drop Probability, Maximum Window Advertisement, Forced Delay etc.) so as to achieve a target average performance for an entire aggregate of finite volume (and hence short-lived) TCP flows.

5. ) The intrusive bandwidth manager apparatus of claim 1 wherein the said bandwidth manager contains a control method that adaptively adjusts the Maximum Window Advertisement so as to achieve a target average queuing delay using the following method:

i. At step K+1 the following steps are taken

ii. Measure the average round-trip delay over the previous measurement interval and subtract from this the fixed round trip propagation delay estimate to obtain the queuing delay.

iii. Adjust the Maximum Window Advertisement (whose value in the just elapsed measurement interval has been, say, Wk) as follows;

W_k+1−

W_k−

g_k+1x(measurement queuing delay−

target queuing delay)

 

Where g_k+1x is a non negative “

gain”

factor.

iv. Apply the Maximum Window Advertisement Wk+1 over the next measurement interval.

6. ) The intrusive bandwidth manager apparatus of claim 1 wherein the said bandwidth manager contains a control method that includes TCP Connection Admission Control (TCP-CAC), where TCP-CAC is used to improve the convergence properties of an adaptive algorithm for setting the control parameter (where by “

control parameter”

is meant a parameter such as Random Drop Probability, Maximum Window Advertisement, Forced Delay, etc.), or TCP-CAC is used for shedding excess load from an overloaded link.

7. ) The control method of claim 1 wherein in the said control method is embedded in a router.