Stability analysis of intelligent marking EPRCA for ABR congestion control in ATM

W. K. Tsai, Y. Ge, Garng Morton Huang

Research output: Contribution to journalConference article

Abstract

The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. Even though the EPRCA has been adopted by the ATM forum as the standard for ABR congestion control, we show that this protocol is only marginally stable. The stability analysis presented in this paper does not consider interactions among network components and should be considered as a bottle-neck stability result. We show that, if a queue is the bottleneck of a congested path, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induced.

Original languageEnglish
Pages (from-to)380-387
Number of pages8
JournalProceedings - IEEE INFOCOM
Volume2
Publication statusPublished - 1 Dec 1997
Externally publishedYes

Fingerprint

Automatic teller machines
Network components
Asynchronous transfer mode
Bottles

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Stability analysis of intelligent marking EPRCA for ABR congestion control in ATM. / Tsai, W. K.; Ge, Y.; Huang, Garng Morton.

In: Proceedings - IEEE INFOCOM, Vol. 2, 01.12.1997, p. 380-387.

Research output: Contribution to journalConference article

@article{900215fdbe054ac28278a666780225c5,
title = "Stability analysis of intelligent marking EPRCA for ABR congestion control in ATM",
abstract = "The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. Even though the EPRCA has been adopted by the ATM forum as the standard for ABR congestion control, we show that this protocol is only marginally stable. The stability analysis presented in this paper does not consider interactions among network components and should be considered as a bottle-neck stability result. We show that, if a queue is the bottleneck of a congested path, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induced.",
author = "Tsai, {W. K.} and Y. Ge and Huang, {Garng Morton}",
year = "1997",
month = "12",
day = "1",
language = "English",
volume = "2",
pages = "380--387",
journal = "Proceedings - IEEE INFOCOM",
issn = "0743-166X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Stability analysis of intelligent marking EPRCA for ABR congestion control in ATM

AU - Tsai, W. K.

AU - Ge, Y.

AU - Huang, Garng Morton

PY - 1997/12/1

Y1 - 1997/12/1

N2 - The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. Even though the EPRCA has been adopted by the ATM forum as the standard for ABR congestion control, we show that this protocol is only marginally stable. The stability analysis presented in this paper does not consider interactions among network components and should be considered as a bottle-neck stability result. We show that, if a queue is the bottleneck of a congested path, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induced.

AB - The EPRCA (Enhanced Proportional Rate Control Algorithm) is a leading congestion control protocol for Available Bit Rate (ABR) service in ATM networks. Even though the EPRCA has been adopted by the ATM forum as the standard for ABR congestion control, we show that this protocol is only marginally stable. The stability analysis presented in this paper does not consider interactions among network components and should be considered as a bottle-neck stability result. We show that, if a queue is the bottleneck of a congested path, then its queue size will eventually decrease. However, if a queue is not congested, its queue size can actually increase and a congestion can be self-induced.

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

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

M3 - Conference article

AN - SCOPUS:0031383648

VL - 2

SP - 380

EP - 387

JO - Proceedings - IEEE INFOCOM

JF - Proceedings - IEEE INFOCOM

SN - 0743-166X

ER -