Research Article

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

  1. Jung-Shian Li*,
  2. Jing-Zhi Liang

Article first published online: 15 MAR 2005

DOI: 10.1002/dac.706

Issue

International Journal of Communication Systems

International Journal of Communication Systems

Volume 18, Issue 5, pages 427–447, June 2005

Additional Information

How to Cite

Li, J.-S. and Liang, J.-Z. (2005), A novel core-stateless ABR-like congestion avoidance scheme in IP networks. Int. J. Commun. Syst., 18: 427–447. doi: 10.1002/dac.706

Author Information

  1. Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, 1. University Road, Tainan, Taiwan

*Department of Electrical Engineering, Institute of Computer and Communication Engineering, National Cheng Kung University, 1. University Road, Tainan, Taiwan

Publication History

  1. Issue published online: 27 MAY 2005
  2. Article first published online: 15 MAR 2005
  3. Manuscript Accepted: 17 NOV 2004
  4. Manuscript Revised: 5 NOV 2004
  5. Manuscript Received: 4 FEB 2004

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (267K)

Keywords:

  • active flow number;
  • Internet;
  • explicit rate-based congestion avoidance;
  • max–min fairness;
  • QoS;
  • ABR

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. Copyright © 2005 John Wiley & Sons, Ltd.

Get PDF (267K)