WO2000005656A1 - Dynamic buffer management scheme for atm switches - Google Patents
Dynamic buffer management scheme for atm switches Download PDFInfo
- Publication number
- WO2000005656A1 WO2000005656A1 PCT/US1999/016477 US9916477W WO0005656A1 WO 2000005656 A1 WO2000005656 A1 WO 2000005656A1 US 9916477 W US9916477 W US 9916477W WO 0005656 A1 WO0005656 A1 WO 0005656A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- queue
- buffer
- threshold
- created
- virtual connection
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
- H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
- H04Q11/0478—Provisions for broadband connections
-
- 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/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
- H04L2012/5651—Priority, marking, classes
-
- 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/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5681—Buffer or queue management
- H04L2012/5682—Threshold; Watermark
Definitions
- the present invention relates broadly to the field of telecommunications. More particularly, the present invention relates to the management of shared memory buffers in an asynchronous transfer mode (ATM) switch or node by setting of queue size and dynamic queue thresholds as functions of overall buffer occupancy and service category.
- ATM asynchronous transfer mode
- 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.
- the simplest implementation of shared memory buffers sets up queues for virtual connections (VCs) as needed and sets a queue length threshold for each queue regardless of the service category of the VC.
- This implementation is often referred to as the "Static Threshold" scheme. Arriving cells are admitted to the queue only if the queue length is smaller than the threshold set for the queue.
- the Static Threshold scheme is simple to implement, it does not adapt to changing traffic conditions. If one port in the switch (one VC) is very active, cells from that VC will be lost even if there is shared memory available to enlarge the queue.
- a control threshold T (t) at time t is set (using notation of the present invention) equal to a multiple ⁇ of the unused buffer space as shown in equation (1) where B is the total size of the shared buffer and U is the size of the used portion of the buffer.
- Choudhury states that ⁇ should be a positive, negative, or zero power of two so that a shifter can be used to regulate the control threshold. According to Choudhury, ⁇ is adjusted depending on whether the switch is moderately loaded or heavily loaded and whether the load is uniform across all ports or non-uniform with one port more heavily loaded than others.
- the Dynamic Threshold scheme of Choudhury is essentially a Static Threshold Scheme which is dynamically tuned according to load conditions in the switch. All VCs are treated equally and a certain amount of buffer space is intentionally wasted to accomplish this.
- the Choudhury scheme excels when there is a uniform load on the switch but does not provide much improvement over Static Threshold schemes when only a few ports in the switch are overloaded. Also, as specifically noted by Choudhury, the scheme does not address the issue of multiple service categories .
- CBR constant bit rate
- VBR variable bit rate
- URR unspecified bit rate
- ABR available bit rate
- the buffer management scheme of the present invention sets different dynamic thresholds for different VCs according to the formula expressed in equation (2) .
- TfU T F + 7i . (B - U) (2)
- T (U) is the threshold (in number of cells) for the i th connection when the used portion of the buffer is U.
- T F1 is the minimum required buffer threshold allocation (in number of cells) for the 1 th connection buffer when the buffer is full and Yi is preferably a power of two chosen for the i th connection at the time the connection is set-up. Both T F ⁇ and ⁇ i are chosen based on the service category of the connection.
- the buffer management scheme of the present invention sets minimum and maximum buffer sizes based on the service category of the connection.
- a minimum buffer is guaranteed for service categories above UBR (unspecified bit rate) .
- the minimum buffer available is determined by the number of backlogged connections.
- the maximum buffer size for each connection is a function of the total buffer size B, T F i, and Ji .
- Figure 1 is a graph of the relationship between dynamic threshold and overall buffer occupancy
- Figure 2 is a flow chart illustrating the operations of an apparatus according to the invention.
- a dynamic threshold T (U) can be set such that if the number of cells Qvc in a buffer equals or exceeds the threshold (Qvc ⁇ T (U) ) , cells arriving at the buffer are discarded.
- the dynamic threshold T (U) is shown to be a linear function of the overall buffer occupancy U.
- the dynamic threshold decreases, i.e. cells will be discarded sooner.
- the linear function has a negative slope.
- the "y intercept" of the function, labelled "x" on the y-axis of Figure 1 is the integer value of the dynamic threshold when the overall buffer occupancy is empty.
- the minimum required buffer threshold allocation T 0 should be some integer number less than or equal to x.
- buffer thresholds are set by add/subtract shift operations. Therefore, the slope of the function is preferably limited to an integer power of two, i.e. 2y.
- the intercept and the slope of the function T (U) can be chosen so that the threshold has some value T F when the buffer is full as shown in equation (3) .
- the threshold when the buffer is empty should be less than or equal to x as shown in equation (5) .
- Equation (6) can be rewritten as equation (7) .
- equations (4) and (8) may be used directly at the time a VC is set up to determine x and y from B, T 0 , and T .
- y is selected on a per class basis, i.e. the value of y depends solely on the service category and the size of the buffer.
- T F is also preferably based solely on the service category .
- the buffer threshold formula according to the invention can be expressed in simplified form as equation (9) .
- T (U) is the threshold for the i ⁇ connection buffer when the overall buffer usage is U.
- B is the total shared buffer size
- ⁇ j_ is 2Y where y is chosen for the ith connection at the time the connection is set-up based on service category and total shared buffer size.
- the thresholds, buffer size and buffer usage are given as an integer number of cells.
- minimum and maximum queue occupancy levels are also set by the dynamic thresholding scheme for each connection.
- Table 1 illustrates the presently preferred recommended dynamic threshold parameters for five different service categories.
- ⁇ is a dimensionless coefficient as defined by ITU 1.371, the complete disclosure of which is hereby incorporated herein by reference. The default value of ⁇ is 120.
- PCR refers to the peak cell rate and ⁇ PCR refers to the cell delay variation tolerance or CDVT as defined in ITU 1.371 for constant bit rate (CBR) and variable bit rate-real time (VBR-rt) service categories.
- B is the size of the shared buffer in number of cells.
- b e is the effective buffer size as defined in IEEE Journal on Selected Areas in Communications, Vol. 13, No. 6, pp. 1115-11127 (1995)
- TBE is the transient buffer exposure as defined in ATM forum Traffic Management Specification 4.0, April 1996, #af-tm-0056.000.
- the minimum buffer size Q m i n is the minimum size of the buffer in number of cells when the shared buffer is completely full.
- Q max is the maximum queue occupancy (in number of cells) allowed for a particular connection.
- URR unspecified bit rate
- Q max is purely a function of the total shared buffer size
- Q m i n is a function of total shared buffer size and number of backlogged connections N.
- the value of the y parameter should be chosen such that the resulting value of Q max is greater than or equal to the maximum value of Q m i n for the service category.
- y should be set proportionally to the expected queue length of a connection in the category.
- T 2 T F + ⁇ ' 2 B - ⁇ ' 2T1 - ⁇ 1T2
- equation (12) Substituting equation (12) in equation (13) yields equation (14) which is exemplary of equation (10) .
- equation (15) is produced which is also exemplary of equation (10) .
- an apparatus will determine at 10 when a new virtual connection is about to be established. If a new VC is being established, the apparatus will determine at 12 the service category of the new VC and will set the parameters based on the service category at 14. These parameters include T F , ⁇ , Q maX , and Q m i n - At 16, the apparatus will determine the amount of free space in the shared buffer and at 18 the apparatus will set the dynamic queue threshold using equation (9) . The apparatus will return to step 10.
- the apparatus When no new VC is being established the apparatus will continue to monitor the amount of free space in the shared buffer at 16 and will reset the dynamic queue thresholds at 18 accordingly. Based on the queue thresholds, determination may be made by the apparatus to discard cells which would cause the queue length to exceed the queue threshold.
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CA002338218A CA2338218A1 (en) | 1998-07-22 | 1999-07-21 | Dynamic buffer management scheme for atm switches |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US9368198P | 1998-07-22 | 1998-07-22 | |
US60/093,681 | 1998-07-22 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2000005656A1 true WO2000005656A1 (en) | 2000-02-03 |
Family
ID=22240192
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US1999/016477 WO2000005656A1 (en) | 1998-07-22 | 1999-07-21 | Dynamic buffer management scheme for atm switches |
Country Status (2)
Country | Link |
---|---|
CA (1) | CA2338218A1 (en) |
WO (1) | WO2000005656A1 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN100405786C (en) * | 2005-12-09 | 2008-07-23 | 清华大学 | Sharing cache dynamic threshold early drop device for supporting multi queue |
CN107656881A (en) * | 2017-09-13 | 2018-02-02 | 中国科学院半导体研究所 | Data storage transit system based on FPGA |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5541912A (en) * | 1994-10-04 | 1996-07-30 | At&T Corp. | Dynamic queue length thresholds in a shared memory ATM switch |
US5901139A (en) * | 1995-09-27 | 1999-05-04 | Nec Corporation | ATM cell buffer managing system in ATM node equipment |
-
1999
- 1999-07-21 CA CA002338218A patent/CA2338218A1/en not_active Abandoned
- 1999-07-21 WO PCT/US1999/016477 patent/WO2000005656A1/en active Application Filing
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5541912A (en) * | 1994-10-04 | 1996-07-30 | At&T Corp. | Dynamic queue length thresholds in a shared memory ATM switch |
US5901139A (en) * | 1995-09-27 | 1999-05-04 | Nec Corporation | ATM cell buffer managing system in ATM node equipment |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN100405786C (en) * | 2005-12-09 | 2008-07-23 | 清华大学 | Sharing cache dynamic threshold early drop device for supporting multi queue |
CN107656881A (en) * | 2017-09-13 | 2018-02-02 | 中国科学院半导体研究所 | Data storage transit system based on FPGA |
Also Published As
Publication number | Publication date |
---|---|
CA2338218A1 (en) | 2000-02-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6240066B1 (en) | Dynamic bandwidth and buffer management algorithm for multi-service ATM switches | |
EP1122916B1 (en) | Dynamic buffering system having integrated radom early detection | |
US5917804A (en) | Connection admission control for ATM networks handling CBR and VBR services | |
US6438106B1 (en) | Inter-class schedulers utilizing statistical priority guaranteed queuing and generic cell-rate algorithm priority guaranteed queuing | |
EP1028600B1 (en) | An optimal buffer management scheme with dynamic queue length thresholds for ATM switches | |
US20080069113A1 (en) | Method and system for controlling atm traffic using bandwidth allocation technology | |
US6018518A (en) | Flow control in a cell switched communication system | |
US6587437B1 (en) | ER information acceleration in ABR traffic | |
EP1183901A1 (en) | Bi-modal control system and method for partitioning a shared output buffer in a connection-oriented network | |
WO2000076148A1 (en) | Method for allocating bandwidth to real-time variable bit rate (rt-vbr) traffic | |
EP0845182B1 (en) | Traffic policing in broadband networks | |
KR100429897B1 (en) | Adaptive buffer partitioning method for shared buffer switch and switch used for the method | |
WO1997001895A2 (en) | Connection admission control system (cac) for atm networks | |
Fan et al. | An optimal buffer management scheme with dynamic thresholds | |
WO2000005656A1 (en) | Dynamic buffer management scheme for atm switches | |
Chao et al. | Design of an ATM shaping multiplexer with guaranteed output burstiness | |
EP0481447A2 (en) | Method of controlling communication network incorporating virtual channels exchange nodes and virtual paths exchange nodes | |
He et al. | Connection admission control design for GlobeView®-2000 ATM core switches | |
Hasegawa et al. | Performance of TCP over ABR service class | |
Elsayed et al. | Analysis of an ATM statistical multiplexer with heterogeneous Markovian on/off sources and applications to call admission control | |
WO2000022785A1 (en) | Atm connection admission control device for dbr connections | |
Mitrou et al. | Traffic engineering using a class ofM/G/1models | |
Rejin et al. | Modified round-robin scheduler for pareto traffic streams | |
Pao et al. | Cell scheduling for ATM switch with delay-sensitive and loss-sensitive traffic | |
Atkinson | A traffic control scheme for virtual paths in an asynchronous transfer mode network |
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: 2338218 Country of ref document: CA Ref country code: CA Ref document number: 2338218 Kind code of ref document: A Format of ref document f/p: F |
|
WWE | Wipo information: entry into national phase |
Ref document number: 09744324 Country of ref document: US |
|
122 | Ep: pct application non-entry in european phase |