Flow control method using a dynamic major reduction factor

Abstract

A flow control method for available bit rate service in an asynchronous transfer mode network for detecting congestion in a switch and conveying congestion status information using resource management cells to the source which adjusts its flow rate accordingly. During detection of congestion in the switch the explicit rate field of the resource management cell is updated using a dynamic major reduction factor to improve transient queue-length performance.

Description

FIELD OF THE INVENTION

The present invention relates to a flow control method for an Available Bit Rate service in an Asynchronous Transfer Mode network. In particular, the invention is directed to a flow control method using a dynamic Major Reduction Factor (MRF), which is a non-increasing function of queue-length.

Asynchronous Transfer Mode (ATM) networks provide an Available Bit Rate (ABR) service in which the data rate is adjusted based on network congestion information. In the network, each switch employs an algorithm to detect and indicate congestion. One well-known control algorithm is referred to as the Dynamic Max Rate Control Algorithm (DMRCA), described by F. M. Chiussi et al., “Dynamic Max Rate Control Algorithm For Available Bit Rate Service in ATM Networks”, IEEE Globecom '96, November 1996, and U.S. Pat. No. 5,701,292, which are herein incorporated by reference.

DMRCA flow control is implemented with an Explicit Rate Manager (ERM) to support ABR service and provide proper flow control in the ATM network. This is achieved by monitoring the queue-length at a congestion point of the switch and the maximum cell rate (MAX) of all connections arriving at the switch. Preferably, MAX is adjusted to smooth excessive oscillations in the maximum rate. The adjusted maximum rate Amax is defined as

A max=(1−alpha)· A max+alpha·MAX

where

alpha is an averaging factor, for example, {fraction (1/16)}; and

MAX is the maximum cell rate of all connections arriving at the switch.

The DMRCA algorithm compares the queue-length q at a congestion point of the switch to a lower queue-length threshold QT and a higher queue-length threshold DQT. If the queue-length q at a congestion point is greater than or equal to DQT, the switch is considered to be “heavily congested” and the Explicit Rate (ER) field and Congestion Indication (CI) bit of the resource management (RM) cells which deliver the congestion information are marked accordingly. Specifically, the CI bit is set equal to “1” and the ER field of the RM cell is set equal to Amax·MRF, where MRF is the Major Reduction Factor. If the queue-length q at a congestion point is greater than or equal to QT but less than DQT, the switch is considered to be “moderately congested”. In this moderately congested case, a marking threshold is set equal to Amax·Fn(q), where Fn( ) is a discrete, non-increasing correction function of the queue-length in the range 0≦Fn( )≦1, and the calculated marking threshold is compared to the current cell rate (CCR). If the current cell rate is greater than or equal to the marking threshold then the CI bit is set to “1”.

The conventional DMRCA flow control algorithm often generates poor transient queue-length performance as a result of using a fixed MRF value to calculate and mark ER. Poor transient queue-length performance is caused by the fact that DMRCA does not explicitly measure bandwidth availability at the congestion point. Instead, DMRCA estimates the transmission rate of each ABR connection at the congestion point based on Amax, which, in turn, is computed based on CCR information carried by the forward resource management (FRM) cell. Since CCR is set by the ABR source when FRM cells depart its source, the CCR information will not change even when the bandwidth available (and thus the actual transmission rate of ABR connections) at the congestion point decreases drastically. In other words, when there is a sudden drop in available bandwidth at the congestion point, e.g., due to increase in high priority traffic, DMRCA will have the wrong information about actual bandwidth availability. Worse still, DMRCA will use the misleading Amax as the basis for major source rate reduction, i.e., ER is set to Amax·MRF. Since Amax is significantly higher than the actual fairshare of bandwidth an ABR connection should get after the onset of congestion, Amax·MRF is likely to remain higher than the fairshare because the value of MRF is statically set near to 1, e.g. ⅞. As a result, the queue grows as it is filled with forward RM-cells carrying stale CCR information and the Amax values remain relatively large. The larger the queue becomes, the longer the Amax remains at high values. This positive feedback cycle continues indefinitely. In short, setting ER equal to Amax·MRF fails to reduce congestion. It is therefore desirable to develop a scheme to overcome these disadvantages.

SUMMARY OF THE INVENTION

The present invention is directed to a method for adjusting the flow rate of available bit rate connections in an asynchronous transfer mode network based on congestion information detected at a switch and conveyed using resource management cells having an explicit rate field. Upon an occurrence of an event, a determination is made of an estimated fairshare of bandwidth allotted to a particular connection at the switch. When a queue-length of the switch is greater than or equal to a queue-length threshold, the estimated fairshare of bandwidth allotted to the particular connection is then adjusted based on a dynamic major reduction factor, which is a non-increasing function of queue-length.

In a preferred embodiment, the maximum flow rate among all connections arriving at the switch is detected upon the arrival of an forward resource management cell at the switch and the detected maximum flow rate is adjusted based on a running exponential weighted average. A determination is made whether a queue-length of the switch is greater than or equal to a queue-length threshold. If the queue-length of the switch is greater than or equal to the queue-length threshold, then the explicit rate field of the resource management cell is marked based on a dynamic major reduction factor, which is a non-increasing function of queue-length.

Other objects and features of the present invention will become apparent from the following detailed description considered in conjunction with the accompanying drawings. It is to be understood, however, that the drawings are intended solely for purposes of illustration and not as a definition of the limits of the invention, for which reference should be made to the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

In the drawing, wherein like reference numerals denote similar elements throughout the several views:

FIG. 1 is a flow chart of an example Dynamic Max Rate Control method using a dynamic major reduction factor in accordance with the present invention; and

FIG. 2 is a graph of an example of a dynamic major reduction factor, which is a non-increasing function of queue-length.

DETAILED DESCRIPTION OF THE INVENTION

The present invention is directed to a flow control algorithm that uses a dynamic MRF in calculating the ER. It has been recognized that ABR source sending rates may be aggressively reduced when the queue-length grows beyond some normal level in order to prevent cell loss and improve transient queue-length performance by using a flow control algorithm that employs a dynamic MRF instead of a static value. In the extreme case, the ABR sources can be shutdown completely and then be allowed to gradually increase their rate from zero.

By way of example, the invention will be described for the conventional DMRCA algorithm described above. The inventive flow control method is performed the same way as the conventional DMRCA algorithm, except that when calculating the explicit rate (ER=Amax·MRF) instead of using a predetermined fixed MRF value, a dynamic MRF is employed. FIG. 1 is a flow chart of the dynamic max rate flow control method employing a dynamic major reduction factor, which is a non-increasing function of queue-length. Initially, a determination is made of an estimated fairshare of bandwidth allotted to a particular connection at the switch upon the occurrence of an event such as the arrival of an FRM cell at the switch or periodically after a predetermined period of time. Specifically, in step 100 the maximum flow rate among all connections arriving at the switch is detected upon the arrival of an FRM cell at the switch and the detected maximum flow rate is adjusted in step 105 , preferably based on a running exponential weighted average. A determination is made in step 110 whether a queue-length of the switch is less than an upper queue-length threshold. If the queue-length of the switch is not less than the upper queue-length threshold, then in step 115 the CI bit is set to “1” and the explicit rate field of the resource management cell is marked as

ER =min( ER, MRF·A max)

where

MRF is a non-increasing function of queue-length; and

Amax is the adjusted maximum flow rate.

Thereafter, in step 120 the flow rate of the connection is decreased based on the marked explicit rate, and the process returns to step 100 and repeats. If at step 110 the queue-length of the switch is less than the upper queue-length threshold then in step 125 a determination is made whether the queue-length is less than a lower queue-length threshold. If the queue-length is greater than or equal to the lower queue-length threshold, then in step 130 the marking threshold is calculated as

Marking threshold= A max· Fn (queue-length)

where

Amax is the adjusted maximum flow rate; and

Fn(queue-length) is a discrete, non-increasing function of the queue-length.

Thereafter, in step 135 a determination is made whether the current cell rate (CCR) is greater than or equal to the marking threshold and, if it is, then the CI bit is set to “1” at step 140 and the process returns to step 100 and repeats. The modified DMRCA flow control method in accordance with the invention may be performed using a processor connected to the switch.

FIG. 2 is an example of an MRF, which is a non-increasing function of queue-length. The y-axis represents the MRF value of which MRF max , MRF med , MRF min values are specified. The MRF-function is such that under normal situations, MRF remains constant at a value MRF max <1 (e.g. ⅞), as in the conventional DMRCA, and then drops rapidly as the queue grows beyond some high threshold to a final value of MRF min ≧0. Queue-length is indicated on the x-axis, and specifically the q hi , q med and q lo queue-length values are identified, wherein q lo ≧DQT and q hi is defined as

q hi =B −(α· BW ·τ)

where

B is the total buffer size;

α is a constant which differs for each network configuration;

BW is the link bandwidth; and

τ is the round-trip propagation delay between the source and the destination of an ABR connection.

Then MRF values are defined as

MRF=MRF max , for 0≦q≦q lo ;

MRF=ƒ 1 (q, q lo , q med , MRF med , MRF max , k 1 ), for q lo <q<q med ;

MRF=MRF med , for q=q med ;

MRF=ƒ 2 (q, q med , q hi , MRF min , MRF med , k 2 ), for q med <q<q hi ;

MRF=MRF min , for q≧q hi ;

where

k 1 and k 2 are constants.

Functions ƒ 1 and ƒ 2 may be any non-increasing function of queue-length such as:

1) an exponential convex function defined as

ƒ e convex ( X, X min , X max , y min , y max , k )= y min , if x≧x max =y max , if x≦x min ;

otherwise

 = y min +( y max −y min )exp[− k ·[( x−x min )/( x max −x min )]

where

k is a constant.

2) an exponential concave function defined as

ƒ e concave ( x, x min , x max , y min , y max , k )= y min , if x≧x max =y max , if x≦x min ;

otherwise

= y max −[( y max −y min )exp[ k ·[( x−x max )/( x max −x min )]]

where

k is a constant.

3) a quadratic convex function defined as

ƒ q convex ( x, x min , x max , y min , y max , k )= y min , if x≧x max =y max , if x≦x min ;

otherwise

= y max −( y max −y min )·[1−[( x max −x ) 2 /( x max −x min ) 2 ]]

4) a quadratic concave function defined as

ƒ q convex ( x, x min , x max , y min , y max , k )= y min , if x≧x max =y max , if x≦x min ;

otherwise

= y min +( y max −y min )·[1−[( x−x min ) 2 /( x max −x min ) 2 ]];

or

5) a linear function defined as

ƒ linear ( x, x min , x max , y min , y max , k )= y min , if x≧x max =y max , if x≦x min ;

otherwise

= y min +[( y max −y min )/( x max −x min )]·( x max −x )

In a preferred embodiment the dynamic MRF values are stored in a look-up-table (LUT).

Thus, while there have been shown and described and pointed out fundamental novel features of the invention as applied to a preferred embodiment thereof, it will be understood that various omissions and substitutions and changes in the form and details of the devices illustrated, and in their operation, may be made by those skilled in the art without departing from the spirit of the invention. For example, it is expressly intended that all combinations of those method steps which perform substantially the same function in substantially the same way to achieve the same results are within the scope of the invention. Substitutions of steps from one described embodiment to another are also fully intended and contemplated. It is also to be understood that the drawings are not necessarily drawn to scale but that they are merely conceptual in nature. It is the intention, therefore, to be limited only as indicated by the scope of the claims appended hereto.

Claims

1. A method for adjusting a flow rate in an asynchronous transfer mode network based on congestion information detected at a switch and conveyed using resource management cells having an explicit rate field, said method comprising the steps of:determining upon an occurrence of an event an estimated fairshare of bandwidth allotted a particular connection at the switch, said determining step comprising the steps of: detecting a maximum flow rate among all connections arriving at the switch upon arrival of a forward resource management cell at the switch; and adjusting the detected maximum flow rate based on a running exponential weighted average; and when a queue-length of the switch is greater than or equal to a queue-length threshold, adjusting the estimated fairshare of bandwidth allotted to the particular connection based on a dynamic major reduction factor, said dynamic major reduction factor being a non-increasing function of queue-length.

2. A method in accordance with claim 1, wherein said determining step comprises the step of defining the event based on arrival of a forward resource management cell at the switch.

3. A method in accordance with claim 1, wherein said determining step comprises the step of defining the event as a predetermined period of time.

4. A method for adjusting a flow rate in an asynchronous transfer mode network based on congestion information detected at a switch and conveyed using resource management cells having an explicit rate field, said method comprising the steps of:determining upon an occurrence of an event an estimated fairshare of bandwidth allotted a particular connection at the switch; and when a queue-length of the switch is greater than or equal to a queue-length threshold, adjusting the estimated fairshare of bandwidth allotted to the particular connection based on a dynamic major reduction factor, said dynamic major reduction factor being a non-increasing function of queue-length, said adjusting step comprising the step of calculating the explicit rate field as ER=min(ER, MRF·Amax) whereMRF is a non-increasing function of queue-length; and Amax is the adjusted maximum flow rate.

5. A method for adjusting a flow rate in an asynchronous transfer mode network based on congestion information detected at a switch and conveyed using resource management cells having an explicit rate field, said method comprising the steps of:determining upon an occurrence of an event an estimated fairshare of bandwidth allotted a particular connection at the switch; and when a queue-length of the switch is greater than or equal to a queue-length threshold, adjusting the estimated fairshare of bandwidth allotted to the particular connection based on a dynamic major reduction factor, said dynamic major reduction factor being a non-increasing function of queue-length, said adjusting step comprising the step of defining the major reduction factor function to include a maximum major reduction factor value less than or equal to “1” and a minimum major reduction factor value greater or equal to “0”.

6. A method in accordance with claim 5, wherein said adjusting step comprises the step of defining the major reduction factor function so that the minimum major reduction factor value corresponds to a maximum queue-length value defined asqhi=B−(α·BW·τ) whereB is total buffer size; α is a constant which differs for each network configuration; BW is link bandwidth; and τ is a round-trip propagation delay between a source and a destination of an available bit rate connection.

7. A method in accordance with claim 6, wherein said adjusting step comprises the step of defining the major reduction factor function asMRF=MRFmax, for 0≦q≦qlo; MRF=ƒ1(q, qlo, qmed, MRFmed, MRFmax, k1), for qlo<q<qmed; MRF=MRFmed, for q=qmed; MRF=ƒ2(q, qmed, qhi, MRFmin, MRFmed, k2), for qmed<q<qhi; MRF=MRFmin, for q≧qhi; whereMRFmax is the maximum major reduction factor value; MRFmin is the minimum major reduction factor value; MRFmed is an intermediate major reduction factor value, where MRFmin<MRFmed<MRFmax; q is the queue-length; qhi is the maximum queue-length; qlo is a minimum queue-length; qmed is an intermediate queue-length, where qlo<qmed<hi; ƒ1 and ƒ2 are first and second non-increasing functions of queue-length; and k1 and k2 are constants.

8. A method in accordance with claim 7, wherein said adjusting step further comprises selecting the first and second non-increasing functions from the group consisting of an exponential concave function, an exponential convex function, a quadratic concave function, a quadratic convex function, and a linear function.

9. A method in accordance with claim 7, wherein the first and second non-increasing functions are the same function.

10. A method in accordance with claim 8, wherein said adjusting step comprises the step of defining at least one of the first and second non-increasing functions as the exponential convex function defined asƒe convex(x, xmin, xmax, ymin, ymax, k)=ymin, if x≧xmax=ymax, if x≦xmin; otherwise=ymin+(ymax−ymin)exp[−k·[(x−xmin)/(xmax−xmin)]wherek is a constant.

11. A method in accordance with claim 8, wherein said adjusting step comprises the step of defining at least one of the first and second non-increasing functions as the exponential concave function defined asƒe concave(x, xmin, xmax, ymin, ymax, k)=ymin, if x≧xmax=ymax, if x≦xmin; otherwise=ymax−[(ymax−ymin)exp[k·[(x−xmax)/(xmax−xmin)]]wherek is a constant.

12. A method in accordance with claim 8, wherein adjusting step comprises defining at least one of the first and second non-increasing functions as the quadratic convex function defined asƒq convex(x, xmin, xmax, ymin, ymax, k)=ymin, if x≧xmax=ymax, if x≦xmin; otherwise=ymax−(ymax−ymin)·[1−[(xmax−x)2/(xmax−xmin)2]].

13. A method in accordance with claim 8, wherein said adjusting step comprises the step of defining at least one of the first and second non-increasing functions as the quadratic concave function defined asƒq concave(x, xmin, xmax, ymin, ymax, k)=ymin, if x≧xmax=ymax, if x≦xmin; otherwise=ymin+(ymax−ymin)·[1−[(x−xmin)2/(xmax−xmin)2]].

14. A method in accordance with claim 8, wherein said adjusting step comprises the step of defining at least one of the first and second non-increasing functions as the linear function defined asƒlinear(x, xmin, xmax, ymin, ymaxk)=ymin, if x≧xmax=ymax, if x≦xmin; otherwise=ymin+[(ymax−ymin)/(xmax−xmin)]·(xmax−x).