WO2000005846A1 - 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
- WO2000005846A1 WO2000005846A1 PCT/US1999/016810 US9916810W WO0005846A1 WO 2000005846 A1 WO2000005846 A1 WO 2000005846A1 US 9916810 W US9916810 W US 9916810W WO 0005846 A1 WO0005846 A1 WO 0005846A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- abr
- determining
- switch
- connections
- explicit rate
- Prior art date
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
Definitions
- 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.
- ABR available bit rate
- ATM asynchronous transfer mode
- ER explicit rate marking and per-VC queuing.
- ATM Asynchronous Transfer Mode
- LANs local area networks
- WANs wide area networks
- 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.
- CBR constant bit rate
- VBR variable bit rate
- URR unspecified bit rate
- ABR available bit rate
- 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.
- MCR minimum cell rate
- 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.
- congestion control The process of adjusting ABR bit rates is generally referred to as congestion control.
- 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.
- RM Resource Management
- a typical network implementing a feedback control scheme consists of source end systems (SES) , destination end systems (DES) , and switches.
- SES source end systems
- DES destination end systems
- switches switches
- 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) .
- ACR allowed cell rate
- ABR flow control is applied between an SES and a DES which are connected via bidirectional connections.
- SES SES
- DES data flow control
- FIG. 1 A general end-to-end control loop mechanism for ABR service is shown in prior art Figure 1 where an SES 10 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.
- 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) .
- PCR peak cell rate
- 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.
- ABR Advanced Traffic Management Specification
- ABR congestion control 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.
- Equation (1) A commonly accepted formula for determining fair share F s 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, Q . is the aggregate rate for the bottlenecked connections,
- W is the number of active connections, and 2V_ . is the number of bottlenecked VCs.
- 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) .
- such algorithms need to keep track of per-VC state information (e.g., connection bottleneck status) .
- 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.
- 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 flow 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.
- 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.
- 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.
- 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.
- Figure 3 is a diagram of a network configuration used to test the algorithm of the invention.
- Figure 2 illustrates the algorithm of the invention which is preferably performed on each backward RM cell.
- the algorithm may be implemented in hardware, software, or a combination of hardware and software.
- the algorithm starts at 100 and the available bandwidth is calculated at 102.
- 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.
- 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) .
- W was fixed at 1024 cell slots for a 149.76 Mb/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.
- a value of 1024 cell slots was deemed appropriate for the measurement interval.
- 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) .
- fair share F S are is determined at 112 by the number N act of active connections served by the round-robin scheduler rather than the number N es of established connections.
- a VC is considered active if its Q vc >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.
- 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 ⁇ is an averaging factor, N oid is the previous measure of the number of active connections, and N new is the present measure of the number of active connections.
- the new explicit rate for the VC is computed at 114 using equation (8) .
- 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.
- traffic 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.
- per-VC queuing and scheduling On the egress, per-VC queuing and scheduling is used.
- 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
- the performance characteristics measured include: bandwidth fairness, link utilization, and queue control.
- ABR VCs 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 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 IK 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.
- 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.
- 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.
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA002338281A CA2338281A1 (en) | 1998-07-22 | 1999-07-22 | Explicit rate abr algorithm for use in an atm switch |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US9382698P | 1998-07-22 | 1998-07-22 | |
US60/093,826 | 1998-07-22 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2000005846A1 true WO2000005846A1 (en) | 2000-02-03 |
Family
ID=22240989
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US1999/016810 WO2000005846A1 (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) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1458149A2 (en) * | 2002-11-27 | 2004-09-15 | Alcatel Canada Inc. | System and method for scheduling data traffic flows for a communication device |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
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 |
US5812527A (en) * | 1996-04-01 | 1998-09-22 | Motorola Inc. | Simplified calculation of cell transmission rates in a cell based netwook |
-
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
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
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 |
US5812527A (en) * | 1996-04-01 | 1998-09-22 | Motorola Inc. | Simplified calculation of cell transmission rates in a cell based netwook |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1458149A2 (en) * | 2002-11-27 | 2004-09-15 | Alcatel Canada Inc. | System and method for scheduling data traffic flows for a communication device |
EP1458149A3 (en) * | 2002-11-27 | 2011-01-05 | Alcatel Canada Inc. | System and method for scheduling data traffic flows for a communication device |
Also Published As
Publication number | Publication date |
---|---|
CA2338281A1 (en) | 2000-02-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0862299B1 (en) | Multi-class connection admission control method for asynchronous transfer mode (ATM) switches | |
EP0901301B1 (en) | Dynamic rate control scheduler for ATM networks | |
US6324165B1 (en) | Large capacity, multiclass core ATM switch architecture | |
US6046983A (en) | Dynamic rate control system | |
Kolarov et al. | A control-theoretic approach to the design of an explicit rate controller for ABR service | |
US7072295B1 (en) | Allocating network bandwidth | |
US5917804A (en) | Connection admission control for ATM networks handling CBR and VBR services | |
US5862126A (en) | Connection admission control for ATM networks | |
US5633859A (en) | Method and apparatus for congestion management in computer networks using explicit rate indication | |
US5991268A (en) | Flow control mechanism of ABR traffic in ATM networks | |
US6504820B1 (en) | Method and system for connection admission control | |
US6549517B1 (en) | Explicit rate computation for flow control in compute networks | |
EP1028600B1 (en) | An optimal buffer management scheme with dynamic queue length thresholds for ATM switches | |
CA2229577A1 (en) | Method and apparatus for controlling traffic flows in a packet-switched network in order to guarantee service performance | |
EP1041774A2 (en) | Method and apparatus for dynamic call admission control | |
US6917590B1 (en) | Method and system for connection admission control | |
WO2001020876A1 (en) | Allocating network bandwidth | |
WO2000005846A1 (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 | |
EP0979022B1 (en) | Method and apparatus for a simple explicit rate indication algorithm (SERIA) | |
He et al. | Connection admission control design for GlobeView®-2000 ATM core switches | |
Hussain et al. | An explicit rate ABR algorithm for new‐generation ATM switches | |
KR100319457B1 (en) | Traffic control method for ATM switches | |
Petrovic | Comparative evaluation of adaptive stochastic and ERICA switch algorithms for ABR traffic management in ATM networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): CA JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
ENP | Entry into the national phase |
Ref document number: 2338281 Country of ref document: CA Ref country code: CA Ref document number: 2338281 Kind code of ref document: A Format of ref document f/p: F |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09744323 Country of ref document: US |
|
122 | Ep: pct application non-entry in european phase |