Premium
A novel core‐stateless ABR‐like congestion avoidance scheme in IP networks
Author(s) -
Li JungShian,
Liang JingZhi
Publication year - 2005
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.706
Subject(s) - computer science , stateless protocol , computer network , bounded function , network packet , scheduling (production processes) , fifo (computing and electronics) , network congestion , scheme (mathematics) , mathematical optimization , mathematics , mathematical analysis , computer hardware
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.