A simple, scalable, and stable explicit rate allocation algorithm for MAX-MIN flow control with minimum rate guarantee

Song Chong, Sangho Lee, Sungho Kang

Research output: Contribution to journalArticle

34 Citations (Scopus)

Abstract

In this paper, we present a novel control-theoretic explicit rate (ER) allocation algorithm for the MAX-MIN flow control of elastic traffic services with minimum rate guarantee in the setting of the ATM available bit rate (ABR) service. The proposed ER algorithm is simple in that the number of operations required to compute it at a switch is minimized, scalable in that per-virtual-circuit (VC) operations including per-VC queueing, per-VC accounting, and per-VC state management are virtually removed, and stable in that by employing it, the user transmission rates and the network queues are asymptotically stabilized at a unique equilibrium point at which MAX-MIN fairness with minimum rate guarantee and target queue lengths are achieved, respectively. To improve the speed of convergence, we normalize the controller gains of the algorithm by the estimate of the number of locally bottle-necked VCs. The estimation scheme is also computationally simple and scalable since it does not require per-VC accounting either. We analyze the theoretical performance of the proposed algorithm and verify its agreement with the practical performance through simulations in the case of multiple bottleneck nodes. We believe that the proposed algorithm will serve as an encouraging solution to the MAX-MIN flow control of elastic traffic services, the deployment of which has been debated long due to their lack of theoretical foundation and implementation complexity.

Original languageEnglish
Pages (from-to)322-335
Number of pages14
JournalIEEE/ACM Transactions on Networking
Volume9
Issue number3
DOIs
Publication statusPublished - 2001 Jan 1

Fingerprint

Flow control
Networks (circuits)
Bottles
Automatic teller machines
Switches
Controllers

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{19b90167a06d47ad86e347df57bb1d47,
title = "A simple, scalable, and stable explicit rate allocation algorithm for MAX-MIN flow control with minimum rate guarantee",
abstract = "In this paper, we present a novel control-theoretic explicit rate (ER) allocation algorithm for the MAX-MIN flow control of elastic traffic services with minimum rate guarantee in the setting of the ATM available bit rate (ABR) service. The proposed ER algorithm is simple in that the number of operations required to compute it at a switch is minimized, scalable in that per-virtual-circuit (VC) operations including per-VC queueing, per-VC accounting, and per-VC state management are virtually removed, and stable in that by employing it, the user transmission rates and the network queues are asymptotically stabilized at a unique equilibrium point at which MAX-MIN fairness with minimum rate guarantee and target queue lengths are achieved, respectively. To improve the speed of convergence, we normalize the controller gains of the algorithm by the estimate of the number of locally bottle-necked VCs. The estimation scheme is also computationally simple and scalable since it does not require per-VC accounting either. We analyze the theoretical performance of the proposed algorithm and verify its agreement with the practical performance through simulations in the case of multiple bottleneck nodes. We believe that the proposed algorithm will serve as an encouraging solution to the MAX-MIN flow control of elastic traffic services, the deployment of which has been debated long due to their lack of theoretical foundation and implementation complexity.",
author = "Song Chong and Sangho Lee and Sungho Kang",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/90.929854",
language = "English",
volume = "9",
pages = "322--335",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

A simple, scalable, and stable explicit rate allocation algorithm for MAX-MIN flow control with minimum rate guarantee. / Chong, Song; Lee, Sangho; Kang, Sungho.

In: IEEE/ACM Transactions on Networking, Vol. 9, No. 3, 01.01.2001, p. 322-335.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A simple, scalable, and stable explicit rate allocation algorithm for MAX-MIN flow control with minimum rate guarantee

AU - Chong, Song

AU - Lee, Sangho

AU - Kang, Sungho

PY - 2001/1/1

Y1 - 2001/1/1

N2 - In this paper, we present a novel control-theoretic explicit rate (ER) allocation algorithm for the MAX-MIN flow control of elastic traffic services with minimum rate guarantee in the setting of the ATM available bit rate (ABR) service. The proposed ER algorithm is simple in that the number of operations required to compute it at a switch is minimized, scalable in that per-virtual-circuit (VC) operations including per-VC queueing, per-VC accounting, and per-VC state management are virtually removed, and stable in that by employing it, the user transmission rates and the network queues are asymptotically stabilized at a unique equilibrium point at which MAX-MIN fairness with minimum rate guarantee and target queue lengths are achieved, respectively. To improve the speed of convergence, we normalize the controller gains of the algorithm by the estimate of the number of locally bottle-necked VCs. The estimation scheme is also computationally simple and scalable since it does not require per-VC accounting either. We analyze the theoretical performance of the proposed algorithm and verify its agreement with the practical performance through simulations in the case of multiple bottleneck nodes. We believe that the proposed algorithm will serve as an encouraging solution to the MAX-MIN flow control of elastic traffic services, the deployment of which has been debated long due to their lack of theoretical foundation and implementation complexity.

AB - In this paper, we present a novel control-theoretic explicit rate (ER) allocation algorithm for the MAX-MIN flow control of elastic traffic services with minimum rate guarantee in the setting of the ATM available bit rate (ABR) service. The proposed ER algorithm is simple in that the number of operations required to compute it at a switch is minimized, scalable in that per-virtual-circuit (VC) operations including per-VC queueing, per-VC accounting, and per-VC state management are virtually removed, and stable in that by employing it, the user transmission rates and the network queues are asymptotically stabilized at a unique equilibrium point at which MAX-MIN fairness with minimum rate guarantee and target queue lengths are achieved, respectively. To improve the speed of convergence, we normalize the controller gains of the algorithm by the estimate of the number of locally bottle-necked VCs. The estimation scheme is also computationally simple and scalable since it does not require per-VC accounting either. We analyze the theoretical performance of the proposed algorithm and verify its agreement with the practical performance through simulations in the case of multiple bottleneck nodes. We believe that the proposed algorithm will serve as an encouraging solution to the MAX-MIN flow control of elastic traffic services, the deployment of which has been debated long due to their lack of theoretical foundation and implementation complexity.

UR - http://www.scopus.com/inward/record.url?scp=0035361563&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035361563&partnerID=8YFLogxK

U2 - 10.1109/90.929854

DO - 10.1109/90.929854

M3 - Article

VL - 9

SP - 322

EP - 335

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 3

ER -