CA2338281A1 - Explicit rate abr algorithm for use in an atm switch - Google Patents
Explicit rate abr algorithm for use in an atm switch Download PDFInfo
- Publication number
- CA2338281A1 CA2338281A1 CA002338281A CA2338281A CA2338281A1 CA 2338281 A1 CA2338281 A1 CA 2338281A1 CA 002338281 A CA002338281 A CA 002338281A CA 2338281 A CA2338281 A CA 2338281A CA 2338281 A1 CA2338281 A1 CA 2338281A1
- Authority
- CA
- Canada
- Prior art keywords
- abr
- determining
- switch
- connections
- explicit rate
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/50—Overload detection or protection within a single switching element
- H04L49/505—Corrective measures
- H04L49/506—Backpressure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/20—Support for services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/5631—Resource management and allocation
- H04L2012/5632—Bandwidth allocation
- H04L2012/5635—Backpressure, e.g. for ABR
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
An explicit rate ABR algorithm for use in an ATM switch. The available bandwidth for ABR connections (Abw) is determined after guaranteed traffic is served (step 102). The per-VC fair share of Abw is calculated in two different ways depending on whether the VC is congested. Where the VC is not congested, the fair share is calculated by dividing the Abw by an averaged number of currently active ABR connections (step 112). Where the VC is congested, the fair share is calculated by dividing the Abw by the number of currently established ABR connections (step 106) and reducing the fair share by damping factor (damp(x)) which is a function of the VC's queue length. A new explicit rate (ERnew) is determined by adding the fair share to the minimum-cell-rate (MCR) (steps 108, 114). The ERnew replaces the old explicit rate (ER) only if it is lower than the ER (step 120).
Description
EXPLICIT RATE ABR ALGORITHM FOR USE IN AN ATM SWITCH
This application claims the benefit of provisional application serial number 60/093,826 filed July 22, 1998.
BACKGROUND OF THE INVENTION
1. Field of the Invention The present invention relates broadly to the field of telecommunications. More particularly, the present invention relates to congestion control of available bit rate (ABR) service in an asynchronous transfer mode (ATM) using explicit rate (ER) marking and per-VC queuing.
This application claims the benefit of provisional application serial number 60/093,826 filed July 22, 1998.
BACKGROUND OF THE INVENTION
1. Field of the Invention The present invention relates broadly to the field of telecommunications. More particularly, the present invention relates to congestion control of available bit rate (ABR) service in an asynchronous transfer mode (ATM) using explicit rate (ER) marking and per-VC queuing.
2. State of the Art Perhaps the most awaited, and now fastest growing technology in the field of telecommunications in the 1990's is known as Asynchronous Transfer Mode (ATM) technology. ATM is providing a mechanism for removing performance limitations of local area networks (LANs) and wide area networks (WANs) and providing data transfers at a speed of on the order of gigabits/second. The variable length packets of LAN and WAN
data are being replaced with ATM cells which are relatively short, fixed length packets. Because ATM cells can carry voice, video and data across a single backbone network, the ATM
technology provides a unitary mechanism for high speed end-to-end telecommunications traffic.
Current ATM service is offered in different categories according to a user's needs. Some of these categories include constant bit rate (CBR), variable bit rate (VBR), unspecified bit rate (UBR), and available bit rate (ABR). The ABR service category is intended for applications with vague bandwidth and delay requirements. Although the ABR service category potentially can be used for a wide variety of applications, it is primarily intended for data applications requiring low cell loss but tolerant of low bit rates. An ABR connection only specifies a minimum cell rate (MCR) which may be zero. The ABR
service guarantees a low cell loss rate to those ABR connections which adapt their rate in accordance with the feedback from the network.
From the network perspective, the objective of ABR service is to maximize resource utilization by allowing ABR sources to adapt their transmission rates according to the availability of unused resources. In other words, as more bandwidth becomes available, ABR sources are allowed to increase their bit rates.
Conversely, when network congestion occurs, ABR sources are directed to decrease their bit rate. The process of adjusting ABR bit rates is generally referred to as congestion control.
There are two common approaches for congestion control of ABR sources: rate based and credit based. The ATM Forum has selected the rate based scheme as the standard for the ABR
service. Rate based schemes use feedback information from the network to control the rate at which cells are emitted by an ABR
source to the network. The feedback information is carried in special cells called Resource Management (RM) cells. A typical network implementing a feedback control scheme consists of source end systems (SES), destination end systems (DES), and switches. The ATM Forum has specified that SES, DES, and switches must implement at least one of the following methods for congestion control: explicit forward congestion indication (EFCI) marking, relative rate (RR) marking, or explicit rate (ER) marking.
EFCI marking requires that the switch set an EFCI bit in the data cell headers. This marking scheme relies on the DES to convey congestion information to the SES by marking a congestion indication (CI) field in the backward RM cells. RR marking requires that the switch set either the CI field or a no increase (NI) field in the RM cells to convey congestion information. Both EFCI and RR marking are referred to as binary rate feedback. ER marking requires that the switch write the appropriate rate value in an ER field of the RM cells to specify an explicit rate at which the SES is allowed to transmit data.
ER marking is referred to as explicit rate feedback. The transmission rate of an ABR source set by the SES based on the ER feedback is called the allowed cell rate (ACR).
ABR flow control is applied between an SES and a DES which are connected via bidirectional connections. For the sake of simplicity, in the following discussion, only data flow from SES
to DES is described. A general end-to-end control loop mecha-nism for ABR service is shown in prior art Figure 1 where an SES
is linked to a DES 12 via several ATM switches 14, 16, 18.
The SES generates "forward" RM cells along with the data cells.
The DES turns around the forward RM cells and sends them back to the source as "backward" RM cells. The backward RM cells convey feedback information provided by the switches and/or DES. A
switch can insert feedback control information into backward or forward RM cells. As described above, a switch must implement at least one of the congestion control methods (EFCI, RR, or ER). The ER field in the forward RM cell is set by the SES to a requested rate such as peak cell rate (PCR). Intermediate switches can only decrease the rate in the ER field in forward and/or backward RM cells.
The ATM Forum has not standardized a specific algorithm for the implementation of congestion control, but has provided five examples in ATM Traffic Management Specification Version 4.0, April 1996, af-tm-0056.000, the complete disclosure of which is hereby incorporated by reference herein. As a result of tremendous research activity regarding ABR, many algorithms for congestion control have been proposed in the literature. The common goal of all of the algorithms is to provide an accurate fair share of available bandwidth for each ABR connection while maximizing link utilization and controlling queue size.
A majority of the known algorithms for ABR congestion control are designed for ATM switches having a common first-in first-out ABR queue. Although many of the current ATM switches employ this type of simple queuing and scheduling, the newer generation of ATM~switches utilize sophisticated per-VC queuing and scheduling algorithms.
A commonly accepted formula for determining fair share FS
for each ABR VC at a given link is shown in equation (1) where C
is the total link bandwidth available to the ABR VCs using the link, Cb is the aggregate rate for the bottlenecked connections, N is the number of active connections, and Nb is the number of bottlenecked VCs.
C-C
Fs - N _ Nb ( 1 ) b A bottleneck connection is a connection which cannot get its fair share at this link because either it is limited by its PCR, or is bottlenecked somewhere else.
Some known switch algorithms attempt to compute an exact fair share using equation (1). Typically, such algorithms need to keep track of per-VC state information (e. g., connection bot-tleneck status). In addition to the high complexity resulting from the local VC state information, the computed fair share may not be equal to the true fair share because a number of factors introduce inaccuracies in the computation. See, e.g., F. M.
Chiussi, A. Arulambalam, Y. Xia, and X. Chen, "Explicit rate ABR
schemes using traffic load as congestion indicator," Proc. 6th Int. Conf: Computer Commun. and Networks, Las Vegas, Nevada, Sept. 1997.
SUMMARY OF THE INVENTION
It is therefore an object of the invention to provide an explicit rate ABR algorithm for use in an ATM switch.
It is also an object of the invention to provide an explicit rate ABR algorithm which avoids the complexity of known algorithms.
It is another object of the invention to provide an explicit rate ABR algorithm which provides accurate per-VC
bandwidth fairness.
It is still another object of the invention to provide an explicit rate ABR algorithm which maximizes link utilization and stable queue control.
In accord with these objects which will be discussed in detail below, the algorithm of the present invention does not attempt to compute the exact fair share, but uses an approximation of the fair share. It relies on the underlying per-VC queuing and scheduling for flaw isolation and fair service to the VCs. This yields an efficient algorithm of low complexity that provides per-VC bandwidth fairness, high link utilization, and excellent queue control. The main steps of the algorithm include: determining the available bandwidth, determining the per-VC fair share of available bandwidth, determining the explicit rate, and updating the explicit rate value in the RM cell. The algorithm utilizes an egress side scheduler having a non-work-conserving part (e. g., a traffic shaper) and a round-robin part. The non-work-conserving part satisfies the guaranteed traffic and the round-robin part serves the "best efforts" traffic which may or may not include UBR and VBR-nrt traffic as well as ABR traffic. Priority is given to the non-work-conserving part such that the round-robin part only operates only when the guaranteed traffic has been satisfied.
According to the invention, the available bandwidth is determined by measuring the number of cells served by the non-work-conserving part during a measurement interval which is based on the link rate. The per-VC fair share of available bandwidth is calculated in two different ways depending on whether the VC is considered congested. Where the VC is not considered to be congested, the fair share is calculated by dividing the available bandwidth by an averaged number of currently active best efforts connections served by the round-robin part. Where the VC is considered to be congested, the fair share is calculated by dividing the available bandwidth by the number of currently established best efforts connections and reducing the fair share by a damping factor which is a function of the VC's queue length. A VC is considered active if its queue length is not zero and is considered congested if its queue length exceeds a threshold. Short term fluctuations in the number of active VCs are filtered out through the use of a weighted average. A new explicit rate is determined by adding the fair share to the MCR. The new explicit rate replaces the old explicit rate only if it is lower than the old explicit rate.
Additional objects and advantages of the invention will become apparent to those skilled in the art upon reference to the detailed description taken in conjunction with the provided figures.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a diagram of an SES coupled to a DES via three ATM switches according to the prior art;
Figure 2 is a simplified flow chart illustrating the algorithm of the invention; and Figure 3 is a diagram of a network configuration used to test the algorithm of the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Figure 2 illustrates the algorithm of the invention which is preferably performed on each backward RM cell. Those skilled in the art will appreciate that the algorithm may be implemented in hardware, software, or a combination of hardware and software. Turning now to Figure 2, the algorithm starts at 100 and the available bandwidth is calculated at 102. As mentioned above, the algorithm of the invention utilizes an egress side scheduler having a non-work-conserving part (e. g., a traffic shaper) and a round-robin part. The egress scheduler implies that in any finite time interval, bandwidth available for the round-robin scheduler part is the difference of total link capacity and the rate used by the non-work-conserving scheduler part. To approximate the available bandwidth AbW for the round-robin scheduler part, bandwidth used by the non-work-conserving scheduler part is first estimated. This involves determining the number of cells U served by the non-work-conserving scheduler part during an interval of W cell slots. The approximation of the available bandwidth in cells per second is determined according to equation (2).
AbW = ~ 1. 0 - W ~ ~ LinkRate ( 2 ) In experiments applying the algorithm, W was fixed at 1024 cell slots for a 149.76 N~/s (OC-3) link. A large value of the measurement interval W is desirable in order to provide a larger sample size for estimating U and in order to reduce computational load on the switch (because a larger measurement interval means fewer computation). A large value of the measurement interval W is undesirable, however, because larger measurement interval means slower (or less frequent) updating of the available bandwidth. As a design trade-off, a value of 1029 cell slots was deemed appropriate for the measurement interval.
After the Abw is found at 102, a decision is made at 104 whether the particular VC is congested. This determination is made by comparing the number of cells Q~~ in the VC queue to a threshold number Qtnresh~ If the number of cells in the queue exceeds the threshold number, the VC is considered congested.
If the VC is congested, the fair share F~hare of available bandwidth Abw is computed at 106 by dividing the Abw by the number Nest of established connections served by the round-robin scheduler as shown in equation (3).
A
F~~ = Nbw (3) When the VC is congested, the fair share Fshgre is reduced by a damping factor damp(x) which is a linear function of the relative congestion of the VC. More particularly, the damping factor is calculated according to equation (4) where x=Q"~- Qthresh and Q~X is the maximum queue length for the VC.
damp(x)=MOX~~, ~1.~-Qx ~~ (4) A new explicit rate ER is then calculated at 108 by adding the damped fair share to the minimum cell rate MCR as shown in equation (5) .
ERn~W-- MCR + Fan. ~damp(x) (5) If it is determined at 104 that the VC is not congested, fair share Fsh$=Q is determined at 112 by the number NS~t of active connections served by the round-robin scheduler rather than the number Nest of established connections. A VC is considered active if its Q~~>0. The motivation for using active connections in place of established connections is to maintain high link utilization even when "ON/OFF" sources (e. g. "bursty" sources) are present. Before calculating the fair share at 112, however, short term fluctuations in the number of active connections are first filtered out at 110 through the use of a weighted averaging function. The weighted averaging function is shown as equation (6) where a is an averaging factor, Nold is the previous measure of the number of active connections, and NneW is the present measure of the number of active connections.
N.a- ~1- a~Nma ~' aNnaW ( 6 >
The averaging factor a is chosen on the basis of experience in a particular switch. In the experiments performed by the inventors, described herein below, oc=1/16 worked well. After the number of active connections is averaged at 110 using equation (6), the fair share is computed at 112 using equation (7) .
A
F _ NbW (7) .n.n x~
After the fair share is computed at 112, the new explicit rate for the VC is computed at 114 using equation (8).
E'R~ow= MCR + Fah.n ( 8 ) After the new explicit rate is computed either at 108 in the case of a congested VC or at 114 in the case of a non-congested VC, the value in the ER field of the RM cell is compared to the new ER at 116. If the new ER is larger than the current ER, no change is made in the RM cell and the algorithm ends (for the particular RM cell) at 118 with respect to this RM
cell. If the new ER is smaller than the current ER, the ER
field of the RM cell is written at 120 with the new ER value and the algorithm ends (for the particular RM cell) at 122 with respect to this RM cell.
The algorithm of the present invention was tested using a network configuration known as a parking lot which is often used in simulations. The parking lot configuration, shown in Figure 3, includes four switches 200, 202, 204, 206 each having a source 210, 212, 214, 216 of ABR VCs, and a fifth switch 208.
The fourth switch 206 also has a source 217 of VBR/UBR traffic.
According to the parking lot configuration, each of the switches feeds the next, thereby creating a bottleneck link 218 between the fourth and fifth switches 206, 208.
Each switch 200, 202, 204, 206, 208 is a non-blocking ATM
switch with both input and output queuing. On the ingress, traffic is enqueued in a per class queue (with the exception of CBR and VBR-rt which share a common queue) and scheduled on strict priority basis. On the egress, per-VC queuing and scheduling is used. As far as ABR traffic is concerned, the per-VC scheduler is designed to support MCR plus equal share fairness criterion. The ABR traffic sources 210, 212, 214, 216 are persistent (always have data to transmit). The VBR and UBR
traffic is modeled by periodic ON/OFF sources which transmits cells at PCR during ON period and no cells during OFF period.
All links have a capacity of 149.76 Mb/s, and the length of inter-switch links and the access links is 1000 Km and 1 Km, respectively. The propagation delays through the links is 5 microseconds/Km.
Tests were conducted with the parking lot network loaded by ABR, VBR, and UBR traffic. Two ABR traffic cases corresponding to 10 and 25 VCs were considered. For the ABR sources, the following parameters were kept constant throughout this study:
ICR (initial cell rate) - 5 Mb/s, PCR (peak cell rate) - 149.76 Mb/s, RIF (rate increase factor) =1/128, RDF (rate decrease factor) - 1/256, W = 1024 cell slots and queue threshold Qtnresh =
16 cells. The performance characteristics measured include:
bandwidth fairness, link utilization, and queue control.
The service categories contending for the round-robin scheduler part available bandwidth included: ABR VCs with rate greater than MCR, UBR VCs with rate greater than zero, and VBR-nrt VCs with the rate greater than guaranteed rate.
Two experiments were conducted with multiple identical ABR
VCs: one experiment with ten identical ABR VCs, and one experiment with twenty-five identical ABR VCs. Each VC had an MCR of 1 Mb/s, ICR of 5 Mb/sec and PCR of 149.76 Mb/s. All VCs began transmitting at time zero with a rate equal to ICR.
The results of the first experiment with ten identical ABR
VCs showed that the actual transmission rate of ABR VCs converged to the MCR plus an equal share value of about 14.95 Mb/s. The ACR of the ABR sources also converged to this steady state rate. The per-VC queue length converged to a small value in the steady state. During the transient period before steady state, the explicit rate of VCs with shorter round trip delays increased faster resulting in a larger backlog at their buffers.
A very high link utilization (near 99~) was achieved.
The results of the second experiment with twenty-five identical ABR VCs showed that the actual transmission rate of ABR VCs converged to the. MCR plus equal share value of about 5.99 1~/s. The ACR of the ABR sources also converged to this rate. The per-VC queue length converged to a small value in the steady state. A very high link utilization (near 99~a) was achieved.
Two experiments were conducted with multiple ABR VCs with different cell rates, one experiment with ten ABR VCs and one experiment with twenty-five ABR VCs.
The third experiment used four ABR VCs each having an MCR
of 5 Mb/s and six ABR VCs each having an MCR of 1 Mb/s. All of the VCs had an ICR of 5 Mb/s and PCR of 149.76 Mb/s. All VCs started transmitting at time zero with a rate equal to the ICR.
The results of this experiment were that the MCR plus equal share of the four ABR VCs having an MCR of 5 Mb/s converged to about 17.37 Mb/s. The MCR plus equal share of the six ABR VCs having an MCR of 1 Mb/s converged to about 13.37 Mb/s. The actual transmission rate of the four ABR VCs having an MCR of 5 Mb/s converged to about 17.37. The actual transmission rate of the six ABR VCs having an MCR of 1 Mb/s converged to about 13.37 Mb/s. The total ABR queue length stabilized around 1K cells. A
very high link utilization (over 95~) was achieved.
The fourth experiment used fifteen ABR VCs each having an MCR of 1 Mb/s and ten ABR VCs each having an MCR of 5 Mb/s. All VCs had an ICR of 5 Mb/s and a PCR of 149.76 Mb/s. All VCs started transmitting at time zero with a rate equal to the ICR.
The results of this experiment were that the MCR plus equal share of the fifteen ABR VCs each having an MCR of 1 Mb/s converged to about 4.39 Mb/s. The MCR plus equal share of the ten ABR VCs each having an MCR of 5 Mb/s converged to about 8.39 Mb/s. The actual transmission rate of the fifteen ABR VCs each having an MCR of 1 Mb/s converged to about 4.39 Mb/s. The actual transmission rate of the ten ABR VCs each having an MCR
of 5 Mb/s converged to about 8.39 Mb/s. The total ABR queue length stabilized around 300 cells, and a very high link utilization (near 99~) was achieved.
Two experiments were performed with ABR VCs having different MCRs (the same conditions as experiments three and four) and with bursty VBR background traffic: one with ten ABR
VCs, and one with twenty-five ABR VCs. In these experiments a deterministic ON/OFF VBR source with 169 msec ON and 339 msec OFF periods was used. During ON period the VBR source transmitted at 50 Mb/s and was idle during OFF period. The presence of bursty high priority traffic has been generally shown to cause fairness problems for ABR VCs. Since VBR traffic is scheduled with high priority, the presence of ON/OFF VBR
traffic results in changing the drain rate of the ABR VCs. When the VBR source is ON, the bandwidth available for ABR VCs (above MCR) decreases. As a result, if these VCs were transmitting at a rate above MCR the queue occupancy of ABR VCs should increase.
The fifth experiment showed that when the VBR source was ON, the actual transmission rate of the four ABR VCs having an MCR of 5 Mb/s dropped from 17.37 Mb/s to 12.37 Mb/s. Similarly, the actual transmission rate of the six ABR VCs having an MCR of 1 Mb/s dropped from 13.37 Mb/s to 8.37 Mb/s. The ACR of the ABR
sources showed that the algorithm does keep track of the changes in the ER. The queue occupancy of ABR VCs fluctuated with a frequency equal to that of the VBR source.
The sixth experiment showed that when the VBR source was ON, the actual transmission rate of the fifteen ABR VCs having an MCR of 1 Mb/s dropped from 4.39 Mb/s to 2.39 Mb/s.
Similarly, the ten ABR VCs having an MCR of 5 Mb/s dropped from 8.39 Mb/s to 6.39 Mb/s. The ACR of the ABR sources showed that the algorithm does keep track of changes in the ER. The queue occupancy of ABR VCs fluctuated with a frequency equal to that of the VBR source.
One experiment was performed with twenty-five ABR VCs having different MCRs (the same conditions as experiment four) and with bursty UBR background traffic. In this experiment a deterministic ON/OFF UBR source with 85 msec ON and 763 msec OFF
periods was used. During the ON period the UBR source transmitted at 10 Mb/s and was idle during the OFF periods.
As mentioned above, a potential problem with dividing the available bandwidth equally on the basis of established connections (contending for the round-robin scheduler part) is that such a scheme can lead to under-utilization of the link when ON/OFF (bursty) sources are present. In order to avoid this, the algorithm keeps track of the active connections. The algorithm is self-correcting in the sense that as the queue size of a VC falls below the global queue threshold the available bandwidth is divided among the number of active connections rather than the number of established connections. This results in maintaining an overall high link utilization. For example, if the link is underutilized the per-VC queues will be drained at a higher rate. This results in the per-VC queues falling below the global queue threshold. When this happens, the ER
calculations are done based on the number of active rather than the number of established connections which are contending for the available bandwidth. If some connections are OFF, the end result is that the algorithm allocates higher ER to the active VCs and hence maintains high link utilization even when ON/OFF
connections are present.
The results of experiment seven showed that when the UBR
source was OFF, the available bandwidth was divided among 25 ABR
VCs connections. When the UBR source was ON, the available bandwidth was divided among 26 connections (i.e., 25 ABR VCs + 1 UBR VC). The queue length of ABR VCs fluctuated with a frequency equal to that of the ON/OFF UBR source. High link utilization was achieved.
There have been described and illustrated herein several embodiments of an algorithm for determining the explicit rate for an ABR connection in an ATM switch. While particular embodiments of the invention have been described, it is not intended that the invention be limited thereto, as it is intended that the invention be as broad in scope as the art will allow and that the specification be read likewise. It will therefore be appreciated by those skilled in the art that yet other modifications could be made to the provided invention without deviating from its spirit and scope as so claimed.
data are being replaced with ATM cells which are relatively short, fixed length packets. Because ATM cells can carry voice, video and data across a single backbone network, the ATM
technology provides a unitary mechanism for high speed end-to-end telecommunications traffic.
Current ATM service is offered in different categories according to a user's needs. Some of these categories include constant bit rate (CBR), variable bit rate (VBR), unspecified bit rate (UBR), and available bit rate (ABR). The ABR service category is intended for applications with vague bandwidth and delay requirements. Although the ABR service category potentially can be used for a wide variety of applications, it is primarily intended for data applications requiring low cell loss but tolerant of low bit rates. An ABR connection only specifies a minimum cell rate (MCR) which may be zero. The ABR
service guarantees a low cell loss rate to those ABR connections which adapt their rate in accordance with the feedback from the network.
From the network perspective, the objective of ABR service is to maximize resource utilization by allowing ABR sources to adapt their transmission rates according to the availability of unused resources. In other words, as more bandwidth becomes available, ABR sources are allowed to increase their bit rates.
Conversely, when network congestion occurs, ABR sources are directed to decrease their bit rate. The process of adjusting ABR bit rates is generally referred to as congestion control.
There are two common approaches for congestion control of ABR sources: rate based and credit based. The ATM Forum has selected the rate based scheme as the standard for the ABR
service. Rate based schemes use feedback information from the network to control the rate at which cells are emitted by an ABR
source to the network. The feedback information is carried in special cells called Resource Management (RM) cells. A typical network implementing a feedback control scheme consists of source end systems (SES), destination end systems (DES), and switches. The ATM Forum has specified that SES, DES, and switches must implement at least one of the following methods for congestion control: explicit forward congestion indication (EFCI) marking, relative rate (RR) marking, or explicit rate (ER) marking.
EFCI marking requires that the switch set an EFCI bit in the data cell headers. This marking scheme relies on the DES to convey congestion information to the SES by marking a congestion indication (CI) field in the backward RM cells. RR marking requires that the switch set either the CI field or a no increase (NI) field in the RM cells to convey congestion information. Both EFCI and RR marking are referred to as binary rate feedback. ER marking requires that the switch write the appropriate rate value in an ER field of the RM cells to specify an explicit rate at which the SES is allowed to transmit data.
ER marking is referred to as explicit rate feedback. The transmission rate of an ABR source set by the SES based on the ER feedback is called the allowed cell rate (ACR).
ABR flow control is applied between an SES and a DES which are connected via bidirectional connections. For the sake of simplicity, in the following discussion, only data flow from SES
to DES is described. A general end-to-end control loop mecha-nism for ABR service is shown in prior art Figure 1 where an SES
is linked to a DES 12 via several ATM switches 14, 16, 18.
The SES generates "forward" RM cells along with the data cells.
The DES turns around the forward RM cells and sends them back to the source as "backward" RM cells. The backward RM cells convey feedback information provided by the switches and/or DES. A
switch can insert feedback control information into backward or forward RM cells. As described above, a switch must implement at least one of the congestion control methods (EFCI, RR, or ER). The ER field in the forward RM cell is set by the SES to a requested rate such as peak cell rate (PCR). Intermediate switches can only decrease the rate in the ER field in forward and/or backward RM cells.
The ATM Forum has not standardized a specific algorithm for the implementation of congestion control, but has provided five examples in ATM Traffic Management Specification Version 4.0, April 1996, af-tm-0056.000, the complete disclosure of which is hereby incorporated by reference herein. As a result of tremendous research activity regarding ABR, many algorithms for congestion control have been proposed in the literature. The common goal of all of the algorithms is to provide an accurate fair share of available bandwidth for each ABR connection while maximizing link utilization and controlling queue size.
A majority of the known algorithms for ABR congestion control are designed for ATM switches having a common first-in first-out ABR queue. Although many of the current ATM switches employ this type of simple queuing and scheduling, the newer generation of ATM~switches utilize sophisticated per-VC queuing and scheduling algorithms.
A commonly accepted formula for determining fair share FS
for each ABR VC at a given link is shown in equation (1) where C
is the total link bandwidth available to the ABR VCs using the link, Cb is the aggregate rate for the bottlenecked connections, N is the number of active connections, and Nb is the number of bottlenecked VCs.
C-C
Fs - N _ Nb ( 1 ) b A bottleneck connection is a connection which cannot get its fair share at this link because either it is limited by its PCR, or is bottlenecked somewhere else.
Some known switch algorithms attempt to compute an exact fair share using equation (1). Typically, such algorithms need to keep track of per-VC state information (e. g., connection bot-tleneck status). In addition to the high complexity resulting from the local VC state information, the computed fair share may not be equal to the true fair share because a number of factors introduce inaccuracies in the computation. See, e.g., F. M.
Chiussi, A. Arulambalam, Y. Xia, and X. Chen, "Explicit rate ABR
schemes using traffic load as congestion indicator," Proc. 6th Int. Conf: Computer Commun. and Networks, Las Vegas, Nevada, Sept. 1997.
SUMMARY OF THE INVENTION
It is therefore an object of the invention to provide an explicit rate ABR algorithm for use in an ATM switch.
It is also an object of the invention to provide an explicit rate ABR algorithm which avoids the complexity of known algorithms.
It is another object of the invention to provide an explicit rate ABR algorithm which provides accurate per-VC
bandwidth fairness.
It is still another object of the invention to provide an explicit rate ABR algorithm which maximizes link utilization and stable queue control.
In accord with these objects which will be discussed in detail below, the algorithm of the present invention does not attempt to compute the exact fair share, but uses an approximation of the fair share. It relies on the underlying per-VC queuing and scheduling for flaw isolation and fair service to the VCs. This yields an efficient algorithm of low complexity that provides per-VC bandwidth fairness, high link utilization, and excellent queue control. The main steps of the algorithm include: determining the available bandwidth, determining the per-VC fair share of available bandwidth, determining the explicit rate, and updating the explicit rate value in the RM cell. The algorithm utilizes an egress side scheduler having a non-work-conserving part (e. g., a traffic shaper) and a round-robin part. The non-work-conserving part satisfies the guaranteed traffic and the round-robin part serves the "best efforts" traffic which may or may not include UBR and VBR-nrt traffic as well as ABR traffic. Priority is given to the non-work-conserving part such that the round-robin part only operates only when the guaranteed traffic has been satisfied.
According to the invention, the available bandwidth is determined by measuring the number of cells served by the non-work-conserving part during a measurement interval which is based on the link rate. The per-VC fair share of available bandwidth is calculated in two different ways depending on whether the VC is considered congested. Where the VC is not considered to be congested, the fair share is calculated by dividing the available bandwidth by an averaged number of currently active best efforts connections served by the round-robin part. Where the VC is considered to be congested, the fair share is calculated by dividing the available bandwidth by the number of currently established best efforts connections and reducing the fair share by a damping factor which is a function of the VC's queue length. A VC is considered active if its queue length is not zero and is considered congested if its queue length exceeds a threshold. Short term fluctuations in the number of active VCs are filtered out through the use of a weighted average. A new explicit rate is determined by adding the fair share to the MCR. The new explicit rate replaces the old explicit rate only if it is lower than the old explicit rate.
Additional objects and advantages of the invention will become apparent to those skilled in the art upon reference to the detailed description taken in conjunction with the provided figures.
BRIEF DESCRIPTION OF THE DRAWINGS
Figure 1 is a diagram of an SES coupled to a DES via three ATM switches according to the prior art;
Figure 2 is a simplified flow chart illustrating the algorithm of the invention; and Figure 3 is a diagram of a network configuration used to test the algorithm of the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
Figure 2 illustrates the algorithm of the invention which is preferably performed on each backward RM cell. Those skilled in the art will appreciate that the algorithm may be implemented in hardware, software, or a combination of hardware and software. Turning now to Figure 2, the algorithm starts at 100 and the available bandwidth is calculated at 102. As mentioned above, the algorithm of the invention utilizes an egress side scheduler having a non-work-conserving part (e. g., a traffic shaper) and a round-robin part. The egress scheduler implies that in any finite time interval, bandwidth available for the round-robin scheduler part is the difference of total link capacity and the rate used by the non-work-conserving scheduler part. To approximate the available bandwidth AbW for the round-robin scheduler part, bandwidth used by the non-work-conserving scheduler part is first estimated. This involves determining the number of cells U served by the non-work-conserving scheduler part during an interval of W cell slots. The approximation of the available bandwidth in cells per second is determined according to equation (2).
AbW = ~ 1. 0 - W ~ ~ LinkRate ( 2 ) In experiments applying the algorithm, W was fixed at 1024 cell slots for a 149.76 N~/s (OC-3) link. A large value of the measurement interval W is desirable in order to provide a larger sample size for estimating U and in order to reduce computational load on the switch (because a larger measurement interval means fewer computation). A large value of the measurement interval W is undesirable, however, because larger measurement interval means slower (or less frequent) updating of the available bandwidth. As a design trade-off, a value of 1029 cell slots was deemed appropriate for the measurement interval.
After the Abw is found at 102, a decision is made at 104 whether the particular VC is congested. This determination is made by comparing the number of cells Q~~ in the VC queue to a threshold number Qtnresh~ If the number of cells in the queue exceeds the threshold number, the VC is considered congested.
If the VC is congested, the fair share F~hare of available bandwidth Abw is computed at 106 by dividing the Abw by the number Nest of established connections served by the round-robin scheduler as shown in equation (3).
A
F~~ = Nbw (3) When the VC is congested, the fair share Fshgre is reduced by a damping factor damp(x) which is a linear function of the relative congestion of the VC. More particularly, the damping factor is calculated according to equation (4) where x=Q"~- Qthresh and Q~X is the maximum queue length for the VC.
damp(x)=MOX~~, ~1.~-Qx ~~ (4) A new explicit rate ER is then calculated at 108 by adding the damped fair share to the minimum cell rate MCR as shown in equation (5) .
ERn~W-- MCR + Fan. ~damp(x) (5) If it is determined at 104 that the VC is not congested, fair share Fsh$=Q is determined at 112 by the number NS~t of active connections served by the round-robin scheduler rather than the number Nest of established connections. A VC is considered active if its Q~~>0. The motivation for using active connections in place of established connections is to maintain high link utilization even when "ON/OFF" sources (e. g. "bursty" sources) are present. Before calculating the fair share at 112, however, short term fluctuations in the number of active connections are first filtered out at 110 through the use of a weighted averaging function. The weighted averaging function is shown as equation (6) where a is an averaging factor, Nold is the previous measure of the number of active connections, and NneW is the present measure of the number of active connections.
N.a- ~1- a~Nma ~' aNnaW ( 6 >
The averaging factor a is chosen on the basis of experience in a particular switch. In the experiments performed by the inventors, described herein below, oc=1/16 worked well. After the number of active connections is averaged at 110 using equation (6), the fair share is computed at 112 using equation (7) .
A
F _ NbW (7) .n.n x~
After the fair share is computed at 112, the new explicit rate for the VC is computed at 114 using equation (8).
E'R~ow= MCR + Fah.n ( 8 ) After the new explicit rate is computed either at 108 in the case of a congested VC or at 114 in the case of a non-congested VC, the value in the ER field of the RM cell is compared to the new ER at 116. If the new ER is larger than the current ER, no change is made in the RM cell and the algorithm ends (for the particular RM cell) at 118 with respect to this RM
cell. If the new ER is smaller than the current ER, the ER
field of the RM cell is written at 120 with the new ER value and the algorithm ends (for the particular RM cell) at 122 with respect to this RM cell.
The algorithm of the present invention was tested using a network configuration known as a parking lot which is often used in simulations. The parking lot configuration, shown in Figure 3, includes four switches 200, 202, 204, 206 each having a source 210, 212, 214, 216 of ABR VCs, and a fifth switch 208.
The fourth switch 206 also has a source 217 of VBR/UBR traffic.
According to the parking lot configuration, each of the switches feeds the next, thereby creating a bottleneck link 218 between the fourth and fifth switches 206, 208.
Each switch 200, 202, 204, 206, 208 is a non-blocking ATM
switch with both input and output queuing. On the ingress, traffic is enqueued in a per class queue (with the exception of CBR and VBR-rt which share a common queue) and scheduled on strict priority basis. On the egress, per-VC queuing and scheduling is used. As far as ABR traffic is concerned, the per-VC scheduler is designed to support MCR plus equal share fairness criterion. The ABR traffic sources 210, 212, 214, 216 are persistent (always have data to transmit). The VBR and UBR
traffic is modeled by periodic ON/OFF sources which transmits cells at PCR during ON period and no cells during OFF period.
All links have a capacity of 149.76 Mb/s, and the length of inter-switch links and the access links is 1000 Km and 1 Km, respectively. The propagation delays through the links is 5 microseconds/Km.
Tests were conducted with the parking lot network loaded by ABR, VBR, and UBR traffic. Two ABR traffic cases corresponding to 10 and 25 VCs were considered. For the ABR sources, the following parameters were kept constant throughout this study:
ICR (initial cell rate) - 5 Mb/s, PCR (peak cell rate) - 149.76 Mb/s, RIF (rate increase factor) =1/128, RDF (rate decrease factor) - 1/256, W = 1024 cell slots and queue threshold Qtnresh =
16 cells. The performance characteristics measured include:
bandwidth fairness, link utilization, and queue control.
The service categories contending for the round-robin scheduler part available bandwidth included: ABR VCs with rate greater than MCR, UBR VCs with rate greater than zero, and VBR-nrt VCs with the rate greater than guaranteed rate.
Two experiments were conducted with multiple identical ABR
VCs: one experiment with ten identical ABR VCs, and one experiment with twenty-five identical ABR VCs. Each VC had an MCR of 1 Mb/s, ICR of 5 Mb/sec and PCR of 149.76 Mb/s. All VCs began transmitting at time zero with a rate equal to ICR.
The results of the first experiment with ten identical ABR
VCs showed that the actual transmission rate of ABR VCs converged to the MCR plus an equal share value of about 14.95 Mb/s. The ACR of the ABR sources also converged to this steady state rate. The per-VC queue length converged to a small value in the steady state. During the transient period before steady state, the explicit rate of VCs with shorter round trip delays increased faster resulting in a larger backlog at their buffers.
A very high link utilization (near 99~) was achieved.
The results of the second experiment with twenty-five identical ABR VCs showed that the actual transmission rate of ABR VCs converged to the. MCR plus equal share value of about 5.99 1~/s. The ACR of the ABR sources also converged to this rate. The per-VC queue length converged to a small value in the steady state. A very high link utilization (near 99~a) was achieved.
Two experiments were conducted with multiple ABR VCs with different cell rates, one experiment with ten ABR VCs and one experiment with twenty-five ABR VCs.
The third experiment used four ABR VCs each having an MCR
of 5 Mb/s and six ABR VCs each having an MCR of 1 Mb/s. All of the VCs had an ICR of 5 Mb/s and PCR of 149.76 Mb/s. All VCs started transmitting at time zero with a rate equal to the ICR.
The results of this experiment were that the MCR plus equal share of the four ABR VCs having an MCR of 5 Mb/s converged to about 17.37 Mb/s. The MCR plus equal share of the six ABR VCs having an MCR of 1 Mb/s converged to about 13.37 Mb/s. The actual transmission rate of the four ABR VCs having an MCR of 5 Mb/s converged to about 17.37. The actual transmission rate of the six ABR VCs having an MCR of 1 Mb/s converged to about 13.37 Mb/s. The total ABR queue length stabilized around 1K cells. A
very high link utilization (over 95~) was achieved.
The fourth experiment used fifteen ABR VCs each having an MCR of 1 Mb/s and ten ABR VCs each having an MCR of 5 Mb/s. All VCs had an ICR of 5 Mb/s and a PCR of 149.76 Mb/s. All VCs started transmitting at time zero with a rate equal to the ICR.
The results of this experiment were that the MCR plus equal share of the fifteen ABR VCs each having an MCR of 1 Mb/s converged to about 4.39 Mb/s. The MCR plus equal share of the ten ABR VCs each having an MCR of 5 Mb/s converged to about 8.39 Mb/s. The actual transmission rate of the fifteen ABR VCs each having an MCR of 1 Mb/s converged to about 4.39 Mb/s. The actual transmission rate of the ten ABR VCs each having an MCR
of 5 Mb/s converged to about 8.39 Mb/s. The total ABR queue length stabilized around 300 cells, and a very high link utilization (near 99~) was achieved.
Two experiments were performed with ABR VCs having different MCRs (the same conditions as experiments three and four) and with bursty VBR background traffic: one with ten ABR
VCs, and one with twenty-five ABR VCs. In these experiments a deterministic ON/OFF VBR source with 169 msec ON and 339 msec OFF periods was used. During ON period the VBR source transmitted at 50 Mb/s and was idle during OFF period. The presence of bursty high priority traffic has been generally shown to cause fairness problems for ABR VCs. Since VBR traffic is scheduled with high priority, the presence of ON/OFF VBR
traffic results in changing the drain rate of the ABR VCs. When the VBR source is ON, the bandwidth available for ABR VCs (above MCR) decreases. As a result, if these VCs were transmitting at a rate above MCR the queue occupancy of ABR VCs should increase.
The fifth experiment showed that when the VBR source was ON, the actual transmission rate of the four ABR VCs having an MCR of 5 Mb/s dropped from 17.37 Mb/s to 12.37 Mb/s. Similarly, the actual transmission rate of the six ABR VCs having an MCR of 1 Mb/s dropped from 13.37 Mb/s to 8.37 Mb/s. The ACR of the ABR
sources showed that the algorithm does keep track of the changes in the ER. The queue occupancy of ABR VCs fluctuated with a frequency equal to that of the VBR source.
The sixth experiment showed that when the VBR source was ON, the actual transmission rate of the fifteen ABR VCs having an MCR of 1 Mb/s dropped from 4.39 Mb/s to 2.39 Mb/s.
Similarly, the ten ABR VCs having an MCR of 5 Mb/s dropped from 8.39 Mb/s to 6.39 Mb/s. The ACR of the ABR sources showed that the algorithm does keep track of changes in the ER. The queue occupancy of ABR VCs fluctuated with a frequency equal to that of the VBR source.
One experiment was performed with twenty-five ABR VCs having different MCRs (the same conditions as experiment four) and with bursty UBR background traffic. In this experiment a deterministic ON/OFF UBR source with 85 msec ON and 763 msec OFF
periods was used. During the ON period the UBR source transmitted at 10 Mb/s and was idle during the OFF periods.
As mentioned above, a potential problem with dividing the available bandwidth equally on the basis of established connections (contending for the round-robin scheduler part) is that such a scheme can lead to under-utilization of the link when ON/OFF (bursty) sources are present. In order to avoid this, the algorithm keeps track of the active connections. The algorithm is self-correcting in the sense that as the queue size of a VC falls below the global queue threshold the available bandwidth is divided among the number of active connections rather than the number of established connections. This results in maintaining an overall high link utilization. For example, if the link is underutilized the per-VC queues will be drained at a higher rate. This results in the per-VC queues falling below the global queue threshold. When this happens, the ER
calculations are done based on the number of active rather than the number of established connections which are contending for the available bandwidth. If some connections are OFF, the end result is that the algorithm allocates higher ER to the active VCs and hence maintains high link utilization even when ON/OFF
connections are present.
The results of experiment seven showed that when the UBR
source was OFF, the available bandwidth was divided among 25 ABR
VCs connections. When the UBR source was ON, the available bandwidth was divided among 26 connections (i.e., 25 ABR VCs + 1 UBR VC). The queue length of ABR VCs fluctuated with a frequency equal to that of the ON/OFF UBR source. High link utilization was achieved.
There have been described and illustrated herein several embodiments of an algorithm for determining the explicit rate for an ABR connection in an ATM switch. While particular embodiments of the invention have been described, it is not intended that the invention be limited thereto, as it is intended that the invention be as broad in scope as the art will allow and that the specification be read likewise. It will therefore be appreciated by those skilled in the art that yet other modifications could be made to the provided invention without deviating from its spirit and scope as so claimed.
Claims (29)
1. A method for determining the explicit rate for an ABR
connection in an ATM switch which serves guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth in the switch after guaranteed traffic is served;
b) determining whether the ABR connection is congested;
c) if the ABR connection is congested, determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch;
d) if the ABR connection is not congested, determining a fair share of available bandwidth as a function of the number of active best efforts connections in the switch;
e) determining a new explicit rate as a function of the fair share; and f) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
connection in an ATM switch which serves guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth in the switch after guaranteed traffic is served;
b) determining whether the ABR connection is congested;
c) if the ABR connection is congested, determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch;
d) if the ABR connection is not congested, determining a fair share of available bandwidth as a function of the number of active best efforts connections in the switch;
e) determining a new explicit rate as a function of the fair share; and f) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
2. A method according to claim 1, wherein:
said step of determining the available bandwidth is performed as a function of the total bandwidth of the switch and the bandwidth used by the guaranteed traffic.
said step of determining the available bandwidth is performed as a function of the total bandwidth of the switch and the bandwidth used by the guaranteed traffic.
3. A method according to claim 2, wherein:
the switch includes an egress side scheduler having a non-work-conserving part serving the guaranteed traffic and a round-robin part serving the ABR traffic; and said step of determining the available bandwidth is performed according to the following equation Abw= (1.0 - W u_w).LinkRate where Abw is the available bandwidth, U is the number of cells served by the non-work-conserving part during an interval of W
cell slots and LinkRate is the total bandwidth of the switch.
the switch includes an egress side scheduler having a non-work-conserving part serving the guaranteed traffic and a round-robin part serving the ABR traffic; and said step of determining the available bandwidth is performed according to the following equation Abw= (1.0 - W u_w).LinkRate where Abw is the available bandwidth, U is the number of cells served by the non-work-conserving part during an interval of W
cell slots and LinkRate is the total bandwidth of the switch.
4. A method according to claim 3, wherein:
the interval W is chosen based on the LinkRate.
the interval W is chosen based on the LinkRate.
5. A method according to claim 4 wherein:
for a LinkRate of approximately 149.76 Mb/s, W is approximately 1024 cells.
for a LinkRate of approximately 149.76 Mb/s, W is approximately 1024 cells.
6. A method according to claim 1, wherein:
each ABR VC in the switch has its own queue; and said step of determining whether the ABR connection is congested includes comparing the number of cells in the ABR
connection queue with a threshold number.
each ABR VC in the switch has its own queue; and said step of determining whether the ABR connection is congested includes comparing the number of cells in the ABR
connection queue with a threshold number.
7. A method according to claim 1, wherein:
said step of determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch is performed according to the following equation where F share is the fair share, A bW is the available bandwidth, and Nest is the number of established best efforts connections in the switch.
said step of determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch is performed according to the following equation where F share is the fair share, A bW is the available bandwidth, and Nest is the number of established best efforts connections in the switch.
8. A method according to claim 1, wherein:
said step of determining a fair share of available bandwidth as a function of the number of active ABR connections in the switch is performed according to the following equation where F share is the fair share, A bw is the available bandwidth, and N act is the number of best efforts ABR connections in the switch.
said step of determining a fair share of available bandwidth as a function of the number of active ABR connections in the switch is performed according to the following equation where F share is the fair share, A bw is the available bandwidth, and N act is the number of best efforts ABR connections in the switch.
9. A method according to claim 1, wherein:
if the ABR connection is congested, the fair share is reduced by a damping factor before determining the new explicit rate.
if the ABR connection is congested, the fair share is reduced by a damping factor before determining the new explicit rate.
10. A method according to claim 9, wherein each ABR VC in the switch has its own queue;
the damping factor is a function of the number of cells in the ABR connection queue.
the damping factor is a function of the number of cells in the ABR connection queue.
11. A method according to claim 10, wherein:
the damping factor is expressed as where Q vc is the number of cells in the ABR connection queue, Q thresh is a threshold number used to determine whether the ABR
connection is congested, and Q max is the maximum length of the ABR connection queue.
the damping factor is expressed as where Q vc is the number of cells in the ABR connection queue, Q thresh is a threshold number used to determine whether the ABR
connection is congested, and Q max is the maximum length of the ABR connection queue.
12. A method according to claim 8, wherein:
N act is a weighted average of the number of active best efforts connections.
N act is a weighted average of the number of active best efforts connections.
13. A method according to claim 12, wherein:
N act is computed according to the following formula N act =(1-.alpha.)N old +.alpha.N new where .alpha. is a weighting factor, Nold is the last measure of the number of active best efforts connections, and NneW is the present measure of the number of active best efforts connections.
N act is computed according to the following formula N act =(1-.alpha.)N old +.alpha.N new where .alpha. is a weighting factor, Nold is the last measure of the number of active best efforts connections, and NneW is the present measure of the number of active best efforts connections.
14. An apparatus for determining the explicit rate for an ABR
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) means for determining the available bandwidth in the switch after guaranteed traffic is served;
b) means for determining whether the ABR connection is congested;
c) means for determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch if the ABR connection is congested;
d) means for determining a fair share of available bandwidth as a function of the number of active best efforts connections in the switch if the ABR connection is not congested;
e) means for determining a new explicit rate as a function of the fair share; and f) means for replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) means for determining the available bandwidth in the switch after guaranteed traffic is served;
b) means for determining whether the ABR connection is congested;
c) means for determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch if the ABR connection is congested;
d) means for determining a fair share of available bandwidth as a function of the number of active best efforts connections in the switch if the ABR connection is not congested;
e) means for determining a new explicit rate as a function of the fair share; and f) means for replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
15. An apparatus according to claim 14, wherein:
said means for determining the available bandwidth utilizes a function of the total bandwidth of the switch and the bandwidth used by the guaranteed traffic.
said means for determining the available bandwidth utilizes a function of the total bandwidth of the switch and the bandwidth used by the guaranteed traffic.
16. An apparatus according to claim 15, wherein:
the switch includes an egress side scheduler having a non-work-conserving part serving the guaranteed traffic and a round-robin part serving the ABR traffic; and said means for determining the available bandwidth utilizes the following equation A bw = (1.0-~)~LinkRate where A bw is the available bandwidth, U is the number of cells served by the non-work-conserving part during an interval of W
cell slots and LinkRate is the total bandwidth of the switch.
the switch includes an egress side scheduler having a non-work-conserving part serving the guaranteed traffic and a round-robin part serving the ABR traffic; and said means for determining the available bandwidth utilizes the following equation A bw = (1.0-~)~LinkRate where A bw is the available bandwidth, U is the number of cells served by the non-work-conserving part during an interval of W
cell slots and LinkRate is the total bandwidth of the switch.
17. An apparatus according to claim 16, wherein:
the interval W is chosen based on the LinkRate.
the interval W is chosen based on the LinkRate.
18. An apparatus according to claim 17 wherein:
for a LinkRate of approximately 149.76 Mb/s, W is approximately 1024 cells.
for a LinkRate of approximately 149.76 Mb/s, W is approximately 1024 cells.
19. An apparatus according to claim 14, wherein:
each ABR VC in the switch has its own queue; and said means for determining whether the ABR connection is congested compares the number of cells in the ABR connection queue with a threshold number.
each ABR VC in the switch has its own queue; and said means for determining whether the ABR connection is congested compares the number of cells in the ABR connection queue with a threshold number.
20. An apparatus according to claim 14, wherein:
said means for determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch utilizes the following equation where F share is the fair share, A bw is the available bandwidth, and N est is the number of established best efforts connections in the switch.
said means for determining a fair share of available bandwidth as a function of the number of established best efforts connections in the switch utilizes the following equation where F share is the fair share, A bw is the available bandwidth, and N est is the number of established best efforts connections in the switch.
21. An apparatus according to claim 14, wherein:
said means for determining a fair share of available bandwidth as a function of the number of active best efforts connections in the switch utilizes the following equation where F share is the fair share, A bw is the available bandwidth, and N act is the number of active best efforts connections in the switch.
said means for determining a fair share of available bandwidth as a function of the number of active best efforts connections in the switch utilizes the following equation where F share is the fair share, A bw is the available bandwidth, and N act is the number of active best efforts connections in the switch.
22. An apparatus according to claim 14, further comprising:
g) means for reducing the fair share by a damping factor if the ABR connection is congested.
g) means for reducing the fair share by a damping factor if the ABR connection is congested.
23. An apparatus according to claim 22, wherein each ABR VC in the switch has its own queue;
the damping factor is a function of the number of cells in the ABR connection queue.
the damping factor is a function of the number of cells in the ABR connection queue.
24. An apparatus according to claim 23, wherein:
the damping factor is expressed as where Q vc is the number of cells in the ABR connection queue, Q thresh is a threshold number used to determine whether the ABR
connection is congested, and Q max is the maximum length of the ABR connection queue.
the damping factor is expressed as where Q vc is the number of cells in the ABR connection queue, Q thresh is a threshold number used to determine whether the ABR
connection is congested, and Q max is the maximum length of the ABR connection queue.
25. An apparatus according to claim 21, wherein:
N act is a weighted average of the number of active best efforts connections.
N act is a weighted average of the number of active best efforts connections.
26. An apparatus according to claim 25, wherein:
Nact is computed according to the following formula Nact =(1-.alpha.)Nold +.alpha.Nnew where a is a weighting factor, Nold is the last measure of the number of active best efforts connections, and Nnew is the present measure of the number of active best efforts connections.
Nact is computed according to the following formula Nact =(1-.alpha.)Nold +.alpha.Nnew where a is a weighting factor, Nold is the last measure of the number of active best efforts connections, and Nnew is the present measure of the number of active best efforts connections.
27. A method for determining the explicit rate for an ABR
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth as a function of the total bandwidth of the switch and the bandwidth used by guaranteed traffic;
b) determining a fair share of available bandwidth;
c) determining a new explicit rate as a function of the fair share; and d) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth as a function of the total bandwidth of the switch and the bandwidth used by guaranteed traffic;
b) determining a fair share of available bandwidth;
c) determining a new explicit rate as a function of the fair share; and d) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
28. A method for determining the explicit rate for an ABR
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth in the switch after guaranteed traffic is served;
b) determining whether the ABR connection is congested;
c) determining a fair share of available bandwidth;
d) if the ABR connection is congested, reducing the fair share of available bandwidth by a damping factor;
e) if the ABR connection is congested, determining a new explicit rate as a function of the reduced fair share; and f) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth in the switch after guaranteed traffic is served;
b) determining whether the ABR connection is congested;
c) determining a fair share of available bandwidth;
d) if the ABR connection is congested, reducing the fair share of available bandwidth by a damping factor;
e) if the ABR connection is congested, determining a new explicit rate as a function of the reduced fair share; and f) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
29. A method for determining the explicit rate for an ABR
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth in the switch after guaranteed traffic is served;
b) determining whether the ABR connection is congested;
c) if the ABR connection is not congested, determining the number of active best efforts connections in the switch at time t1 and time t2;
d) if the ABR connection is not congested, determining a fair share of available bandwidth as a function of a weighted average of the number of active best efforts connections in the switch at time t1 and time t2;
e) determining a new explicit rate as a function of the fair share; and f) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
connection in an ATM switch serving guaranteed traffic and best efforts connections, comprising:
a) determining the available bandwidth in the switch after guaranteed traffic is served;
b) determining whether the ABR connection is congested;
c) if the ABR connection is not congested, determining the number of active best efforts connections in the switch at time t1 and time t2;
d) if the ABR connection is not congested, determining a fair share of available bandwidth as a function of a weighted average of the number of active best efforts connections in the switch at time t1 and time t2;
e) determining a new explicit rate as a function of the fair share; and f) replacing the explicit rate for the connection with the new explicit rate if the explicit rate is larger than the new explicit rate.
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US9382698P | 1998-07-22 | 1998-07-22 | |
| US60/093,826 | 1998-07-22 | ||
| PCT/US1999/016810 WO2000005846A1 (en) | 1998-07-22 | 1999-07-22 | Explicit rate abr algorithm for use in an atm switch |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2338281A1 true CA2338281A1 (en) | 2000-02-03 |
Family
ID=22240989
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002338281A Abandoned CA2338281A1 (en) | 1998-07-22 | 1999-07-22 | Explicit rate abr algorithm for use in an atm switch |
Country Status (2)
| Country | Link |
|---|---|
| CA (1) | CA2338281A1 (en) |
| WO (1) | WO2000005846A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2004180302A (en) * | 2002-11-27 | 2004-06-24 | Alcatel Canada Inc | System and method of scheduling data traffic flow for communication device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5812527A (en) * | 1996-04-01 | 1998-09-22 | Motorola Inc. | Simplified calculation of cell transmission rates in a cell based netwook |
| US5777984A (en) * | 1996-04-01 | 1998-07-07 | Motorola Inc. | Method and apparatus for controlling cell transmission rate in a cell based network in the presence of congestion |
-
1999
- 1999-07-22 CA CA002338281A patent/CA2338281A1/en not_active Abandoned
- 1999-07-22 WO PCT/US1999/016810 patent/WO2000005846A1/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2000005846A1 (en) | 2000-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5754530A (en) | Flow control of ABR traffic in ATM networks | |
| US5991268A (en) | Flow control mechanism of ABR traffic in ATM networks | |
| US6046983A (en) | Dynamic rate control system | |
| Kolarov et al. | A control-theoretic approach to the design of an explicit rate controller for ABR service | |
| US5862126A (en) | Connection admission control for ATM networks | |
| US7072295B1 (en) | Allocating network bandwidth | |
| US6490248B1 (en) | Packet transfer device and packet transfer method adaptive to a large number of input ports | |
| US6504820B1 (en) | Method and system for connection admission control | |
| US6549517B1 (en) | Explicit rate computation for flow control in compute networks | |
| US6826151B1 (en) | Apparatus and method for congestion control in high speed networks | |
| EP0901301B1 (en) | Dynamic rate control scheduler for ATM networks | |
| US5633859A (en) | Method and apparatus for congestion management in computer networks using explicit rate indication | |
| US7068660B2 (en) | Method for measurement-based connection admission control (MBAC) in a packet data network | |
| US5917804A (en) | Connection admission control for ATM networks handling CBR and VBR services | |
| US6137779A (en) | Transmission rate calculation scheme using table-lookup | |
| WO2001020876A1 (en) | Allocating network bandwidth | |
| CA2338281A1 (en) | Explicit rate abr algorithm for use in an atm switch | |
| Chu et al. | On‐board closed‐loop congestion control for satellite‐based packet‐switching networks | |
| Drury | ATM traffic management and the impact of ATM switch design | |
| US6850881B1 (en) | ATM connection admission control device for DBR connections | |
| EP0979022B1 (en) | Method and apparatus for a simple explicit rate indication algorithm (SERIA) | |
| Hussain et al. | An explicit rate ABR algorithm for new‐generation ATM switches | |
| KR100319457B1 (en) | Traffic control method for ATM switches | |
| KR100204052B1 (en) | Congestion control method by detecting the queue length and traffic load in atm network | |
| JP3160833B2 (en) | Call admission control method and call admission control device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |