Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet
- 1 January 1999
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (0743166X) , 1412-1420 vol.3
- https://doi.org/10.1109/infcom.1999.752161
Abstract
The problem of fair bandwidth sharing among adaptive (TCP) and non-adaptive (i.e. CBR-UDP) flows at an Internet gateway is considered. An algorithm that drops packet preventively, in an attempt to actively penalize the non-adaptive traffic that attempts to "steal" buffer space, and therefore bandwidth from the adaptive traffic flows, is presented. The algorithm maintains minimal flow state information and is therefore scalable. The performance of the algorithm is compared with other gateway algorithms and it is shown that, in the presence of non-adaptive traffic, it achieves a more balanced bandwidth allocation among the different flows. The behavior of a flow subjected to the given algorithm has also been analysed in detail.Keywords
This publication has 7 references indexed in Scilit:
- Design considerations for supporting TCP with per-flow queueingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Dynamics of random early detectionACM SIGCOMM Computer Communication Review, 1997
- TCP and explicit congestion notificationACM SIGCOMM Computer Communication Review, 1994
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- Round-robin scheduling for max-min fairness in data networksIEEE Journal on Selected Areas in Communications, 1991
- Traffic phase effects in packet-switched gatewaysACM SIGCOMM Computer Communication Review, 1991
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networksComputer Networks and ISDN Systems, 1989