Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
A buffer allocation scheme for ATM networks: complete sharing based on virtual partition
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Rate-proportional servers: a design methodology for fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Scalable QoS provision through buffer management
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
IEEE/ACM Transactions on Networking (TON)
Equilibrium bandwidth and buffer allocations for elastic traffics
IEEE/ACM Transactions on Networking (TON)
A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic
ACM SIGCOMM Computer Communication Review
User-Oriented Fair Buffer Management for MPEG Video Streams
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
A fair buffer allocation scheme
Computer Communications
A comparison of active queue management algorithms using the OPNET Modeler
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Guaranteed frame rate: a better service for TCP/IP in ATM networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Fairness in network traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate certain kinds of transient bottlenecks and may serve as a critical component of a strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. While fairness in bandwidth allocation over a shared link has been studied extensively, the desired eventual goal is overall fairness in the use of all the resources in the network. This paper is concerned with achieving fairness in the joint allocation of buffer and bandwidth resources. Although a large variety of buffer management strategies have been proposed in the research literature, a provably fair and practical algorithm based on a rigorously defined theoretical framework does not exist. In this paper, we describe such a framework and a new, provably fair, and practical strategy for the joint allocation of buffer and bandwidth resources using the max-rain notion of fairness. Through simulation experiments using real gateway traffic and video traffic traces, we demonstrate the improved fairness of our strategy in comparison to several popular buffer management algorithms. Joint management of buffer and bandwidth resources involves both an entry policy into the buffer and an exit policy through the output link. Our study reveals that, even though algorithms such as WFQ and DRR that can serve as fair exit policies have received significantly more attention, a fair entry policy is more critical than a fair exit policy to the over-all fairness goal when buffer resources are constrained.