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

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.