Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
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)
| Hi-index | 0.00 |
Flows have different characteristics depending on the type of application, and this leads to consideration of the QoS needed to guarantee that the application will work satisfactorily. However, the scheduling algorithms such as WFQ, DRR, or Hierarchical Scheduling algorithms are complex to guarantee QoS in per-flow level because of buffer management. Calendar queue is appropriate to service per-flow based scheduling because it is simple enough to implement and easy to manage buffers. However, the nature of the calendar queue - fixed slot size can degrade the network throughput. So we propose a QoS scheduler based on calendar queue with an algorithm to improve the network throughput. Also, we verify the performance of the proposed scheduler with ns2 simulator especially in terms of throughput.