TY - GEN
T1 - Overload based explicit rate switch schemes with MCR guarantees
AU - Vandalore, Bobby
AU - Fahmy, Sonia
AU - Jain, Raj
AU - Goyal, Rohit
AU - Goyal, Mukul
N1 - Publisher Copyright:
© 1999 IEEE.
PY - 1999
Y1 - 1999
N2 - An explicit rate switch scheme monitors the load at each link and gives feedback to the sources. We define the overload factor as the ratio of the input rate to the available capacity. In this paper, we present three overload-based switch schemes which provide MCR (minimum cell rate) guarantees for the ATM (asynchronous transfer mode) ABR (available bit rate) service. The switch schemes proposed use the overload factor and other terms including current source rate and target utilization to calculate feedback rates. A dynamic queue control mechanism is used to achieve efficient usage of the link, control queues and, achieve constant queuing delay at steady state. The proposed algorithms are studied and compared using several configurations. The configurations were chosen to test the performance of the algorithms in the presence of link bottlenecks, source bottlenecks and transient sources. Finally, a comparison of the proposed algorithms based on the simulation results is given.
AB - An explicit rate switch scheme monitors the load at each link and gives feedback to the sources. We define the overload factor as the ratio of the input rate to the available capacity. In this paper, we present three overload-based switch schemes which provide MCR (minimum cell rate) guarantees for the ATM (asynchronous transfer mode) ABR (available bit rate) service. The switch schemes proposed use the overload factor and other terms including current source rate and target utilization to calculate feedback rates. A dynamic queue control mechanism is used to achieve efficient usage of the link, control queues and, achieve constant queuing delay at steady state. The proposed algorithms are studied and compared using several configurations. The configurations were chosen to test the performance of the algorithms in the presence of link bottlenecks, source bottlenecks and transient sources. Finally, a comparison of the proposed algorithms based on the simulation results is given.
UR - https://www.scopus.com/pages/publications/85054031408
U2 - 10.1109/ICCCN.1999.805588
DO - 10.1109/ICCCN.1999.805588
M3 - Conference contribution
AN - SCOPUS:85054031408
SN - 0780357949
SN - 9780780357945
T3 - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999
SP - 655
EP - 661
BT - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999
A2 - Somani, Arun
A2 - Park, EK
A2 - Dixit, Sudhir
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 8th International Conference on Computer Communications and Networks, ICCCN 1999
Y2 - 11 October 1999 through 13 October 1999
ER -