This paper investigates the performance of relative rate (RR) switch algorithms for available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. An RR switch can be implemented differently according to the congestion detection and notification methods used. This paper proposes three implementation schemes for an RR switch using various congestion detection and notification methods, and then analyzes the allowed cell rate (ACR) of a source and the queue length at a switch in steady state. The upper and lower bounds for the maximum and minimum queue lengths are also determined for each scheme, respectively, thereby investigating the effects of ABR parameter values on a queue length. Furthermore, a selection method for rate increase factor (RIF) and rate decrease factor (RDF) parameter values is suggested to prevent buffer overflow and underflow.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Dong-Ho KIM, You-Ze CHO, Jong-Hee PARK, "Analysis of Relative Rate Switch Algorithms for ABR Flow Control in ATM Networks" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 10, pp. 1586-1594, October 1999, doi: .
Abstract: This paper investigates the performance of relative rate (RR) switch algorithms for available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. An RR switch can be implemented differently according to the congestion detection and notification methods used. This paper proposes three implementation schemes for an RR switch using various congestion detection and notification methods, and then analyzes the allowed cell rate (ACR) of a source and the queue length at a switch in steady state. The upper and lower bounds for the maximum and minimum queue lengths are also determined for each scheme, respectively, thereby investigating the effects of ABR parameter values on a queue length. Furthermore, a selection method for rate increase factor (RIF) and rate decrease factor (RDF) parameter values is suggested to prevent buffer overflow and underflow.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_10_1586/_p
Copy
@ARTICLE{e82-b_10_1586,
author={Dong-Ho KIM, You-Ze CHO, Jong-Hee PARK, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of Relative Rate Switch Algorithms for ABR Flow Control in ATM Networks},
year={1999},
volume={E82-B},
number={10},
pages={1586-1594},
abstract={This paper investigates the performance of relative rate (RR) switch algorithms for available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. An RR switch can be implemented differently according to the congestion detection and notification methods used. This paper proposes three implementation schemes for an RR switch using various congestion detection and notification methods, and then analyzes the allowed cell rate (ACR) of a source and the queue length at a switch in steady state. The upper and lower bounds for the maximum and minimum queue lengths are also determined for each scheme, respectively, thereby investigating the effects of ABR parameter values on a queue length. Furthermore, a selection method for rate increase factor (RIF) and rate decrease factor (RDF) parameter values is suggested to prevent buffer overflow and underflow.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Analysis of Relative Rate Switch Algorithms for ABR Flow Control in ATM Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1586
EP - 1594
AU - Dong-Ho KIM
AU - You-Ze CHO
AU - Jong-Hee PARK
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1999
AB - This paper investigates the performance of relative rate (RR) switch algorithms for available bit rate (ABR) flow control in asynchronous transfer mode (ATM) networks. An RR switch can be implemented differently according to the congestion detection and notification methods used. This paper proposes three implementation schemes for an RR switch using various congestion detection and notification methods, and then analyzes the allowed cell rate (ACR) of a source and the queue length at a switch in steady state. The upper and lower bounds for the maximum and minimum queue lengths are also determined for each scheme, respectively, thereby investigating the effects of ABR parameter values on a queue length. Furthermore, a selection method for rate increase factor (RIF) and rate decrease factor (RDF) parameter values is suggested to prevent buffer overflow and underflow.
ER -