Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Determining End-to-End Delay Bounds in Heterogeneous Networks
NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Fair Queueing Algorithms for Packet Scheduling in BISDN
IZS '96 Proceedings of the 1996 International Zurich Seminar on Digital Communications: Broadband Communications - Networks, Services, Applications, Future Directions
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
Carry-over round robin: a simple cell scheduling mechanism for ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Hardware-efficient fair queueing architectures for high-speed networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Exploiting medium access diversity in rate adaptive wireless LANs
Proceedings of the 10th annual international conference on Mobile computing and networking
Scheduling streaming flows on the downlink shared channel of UMTS
International Journal of Network Management
A slot allocation strategy for clustered ad hoc networks
International Journal of Ad Hoc and Ubiquitous Computing
Priority-based opportunistic MAC protocol in IEEE 802.11 WLANs
International Journal of Sensor Networks
A scalable packet sorting circuit for high-speed WFQ packet scheduling
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Design and dimensioning of an edge router using Markov model
International Journal of Communication Networks and Distributed Systems
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An opportunistic video scheduling algorithm over shared wireless downlink
Computer Communications
Fair scheduling in optical burst switching networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Adaptive admission control in a NGN service platform
WTS'10 Proceedings of the 9th conference on Wireless telecommunications symposium
Fully hardware based WFQ architecture for high-speed QoS packet scheduling
Integration, the VLSI Journal
| Hi-index | 0.00 |
This paper proposes a simple rate-based scheduling algorithm for packet-switched networks. Using a set of counters to keep track of the credits accumulated by each traffic flow, the bandwidth share allocated to each flow, and the size of the head-of-line (HOL) packets of the different flows, the algorithm decides which flow to serve next. Our proposed algorithm requires on average a smaller complexity than the most interesting alternative ones while guaranteeing comparable fairness, delay, and delay jitter bounds. To further reduce the complexity, a simplified version (CBFQ-F) of the general algorithm is also proposed for networks with fixed packet lengths, such as ATM, by relaxing the fairness bound by a negligibly small amount.