A novel core-stateless ABR-like congestion avoidance scheme in IP networks

Jung Shian Li, Jing Zhi Liang

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We propose a novel explicit rate-based congestion avoidance scheme. The scheme is similar to ATM available bit rate (ABR) services but its complexity is largely reduced to enable implementation in IP networks. In our proposed scheme, sources can adapt their sending rate according to network status. Adaptation of sending rates converges to max-min fairness with minimal rate guarantee. Furthermore, routers do not maintain per flow state; they use FIFO packet scheduling enhanced by an explicit rate feedback mechanism with estimations, including number of active flows, number of bounded flows and total bounded rate, based on a simple algorithm motivated by Bloom filter. We present and discuss simulations on the performance under various network conditions.

Original languageEnglish
Pages (from-to)427-447
Number of pages21
JournalInternational Journal of Communication Systems
Volume18
Issue number5
DOIs
Publication statusPublished - 2005 Jun 1

Fingerprint

Automatic teller machines
Routers
Scheduling
Feedback

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{8dd483cc9b6445688a2b312b934da47c,
title = "A novel core-stateless ABR-like congestion avoidance scheme in IP networks",
abstract = "We propose a novel explicit rate-based congestion avoidance scheme. The scheme is similar to ATM available bit rate (ABR) services but its complexity is largely reduced to enable implementation in IP networks. In our proposed scheme, sources can adapt their sending rate according to network status. Adaptation of sending rates converges to max-min fairness with minimal rate guarantee. Furthermore, routers do not maintain per flow state; they use FIFO packet scheduling enhanced by an explicit rate feedback mechanism with estimations, including number of active flows, number of bounded flows and total bounded rate, based on a simple algorithm motivated by Bloom filter. We present and discuss simulations on the performance under various network conditions.",
author = "Li, {Jung Shian} and Liang, {Jing Zhi}",
year = "2005",
month = "6",
day = "1",
doi = "10.1002/dac.706",
language = "English",
volume = "18",
pages = "427--447",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",
number = "5",

}

A novel core-stateless ABR-like congestion avoidance scheme in IP networks. / Li, Jung Shian; Liang, Jing Zhi.

In: International Journal of Communication Systems, Vol. 18, No. 5, 01.06.2005, p. 427-447.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A novel core-stateless ABR-like congestion avoidance scheme in IP networks

AU - Li, Jung Shian

AU - Liang, Jing Zhi

PY - 2005/6/1

Y1 - 2005/6/1

N2 - We propose a novel explicit rate-based congestion avoidance scheme. The scheme is similar to ATM available bit rate (ABR) services but its complexity is largely reduced to enable implementation in IP networks. In our proposed scheme, sources can adapt their sending rate according to network status. Adaptation of sending rates converges to max-min fairness with minimal rate guarantee. Furthermore, routers do not maintain per flow state; they use FIFO packet scheduling enhanced by an explicit rate feedback mechanism with estimations, including number of active flows, number of bounded flows and total bounded rate, based on a simple algorithm motivated by Bloom filter. We present and discuss simulations on the performance under various network conditions.

AB - We propose a novel explicit rate-based congestion avoidance scheme. The scheme is similar to ATM available bit rate (ABR) services but its complexity is largely reduced to enable implementation in IP networks. In our proposed scheme, sources can adapt their sending rate according to network status. Adaptation of sending rates converges to max-min fairness with minimal rate guarantee. Furthermore, routers do not maintain per flow state; they use FIFO packet scheduling enhanced by an explicit rate feedback mechanism with estimations, including number of active flows, number of bounded flows and total bounded rate, based on a simple algorithm motivated by Bloom filter. We present and discuss simulations on the performance under various network conditions.

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

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

U2 - 10.1002/dac.706

DO - 10.1002/dac.706

M3 - Article

AN - SCOPUS:21244483447

VL - 18

SP - 427

EP - 447

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

IS - 5

ER -