Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A Class of End-to-End Congestion Control Algorithms for the Internet
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
General weighted fairness and its support in explicit rate switch algorithms
Computer Communications
Improvements to Core Stateless Fair Queueing
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
A selective attenuation feedback mechanism for rate oscillation avoidance
Computer Communications
| Hi-index | 0.00 |
This paper addresses the fundamental issue of providing per-flow fairness within the Diffserv framework. The Fair Allocation Derivative Estimation (FADE) algorithm for estimating flow fair share in the absence of per-flow information is proposed. FADE calculates fair share feedback using a modified Quasi-Newton method. This efficient method for estimating fair share provides a more precise model than other existing fairness estimation approaches. As such, it is able to more accurately estimate fair share and quickly converge to the proper rate. The simulation compares FADE to other proposals and demonstrates the overall effectiveness of the algorithm.