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
Proportional differentiated services: delay differentiation and packet scheduling
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
The role of signaling in quality of service enabled networks
IEEE Communications Magazine
A rate regulating traffic conditioner for supporting TCP over Diffserv
Computer Communications
General weighted fairness and its support in explicit rate switch algorithms
Computer Communications
| Hi-index | 0.00 |
This article addresses the fundamental issue of providing per-flow fairness. In particular, it focuses on fairness within the Diffserv framework. We propose the Fair Allocation Derivative Estimation (FADE) algorithm for estimating flow fair share in the absence of per-flow information. 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. The results demonstrate the overall effectiveness of the algorithm.