Journal of the ACM (JACM)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Performance Evaluation of the Managed Bandwidth Service with QoS Guarantees
DS-RT '03 Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications
Performance Analysis of Weighted Fair Queues with Variable Service Rates
ICDT '06 Proceedings of the international conference on Digital Telecommunications
Performance evaluation of queuing disciplines for multi-class traffic using OPNET simulator
MMACTE'05 Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering
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
Hi-index | 0.00 |
In this paper, we present a new Start-time Fair Queuing (SFQ) algorithm called Weighted Start-time Fair Queuing (WSFQ) which is more efficient and achieves better fairness than SFQ in the presence of small and huge elastic traffic flows. WSFQ scheduler, like SFQ uses a start time eligibility criterion to select packets and when the start-time of two packets in two flows are the same, it acts like Weighted Fair Queuing (WFQ) which selects the smallest virtual finish time first. Afterward, we compared the performance of our model with that of the applied scheduling algorithms such as First-In-First-Out (FIFO), SFQ as well as WFQ on the end-to-end delay and the throughput in small and large-scale networks. Our analysis demonstrates that our proposed model is suitable for elastic services networks since it achieves low end-to-end delay for elastic applications as well as providing fairness which is desirable for elastic traffic regardless of variation in one misbehaving flow.