Ehsan Allahyar
Ali Movaghar
ABSTRACT
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.
- Z. Wang and A. Basu, "Resource Allocation for Elastic Traffic: Architecture and Mechanisms", Bell Laboratories, Lucent Technologies, IEEE 2000, pp1--2.Google Scholar
- B. Morgan and C. Dennis, "Managing Network Performance with Queuing and Compression", CCNP BCRAN Self-Study, Cisco Press, 2003.Google Scholar
- C. Bouras, V. Kapoulas and D. Primpas, "Performance Evaluation of the Managed Bandwidth Service with QoS Guarantees", Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Application (DS-RT'03), 1990. Google ScholarDigital Library
- C. R. Bennett, and H. Zhang, "WF2Q: Worst-case Fair Weighted Fair Queuing," IEEE 1996, pp3--4.Google Scholar
- P. Goyal, H. M. VIN and H. Zhang, "Start-Time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks", University of Texas at Austin, Austin, TX, 1996.Google Scholar
- http://www.cisco.com/application/pdf/paws/limit.pdfGoogle Scholar
- M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round robin", Proc. IEEE SIGCOMM, pp. 231--242, 1995. Google ScholarDigital Library
- J. C. R. Bennett and H. Zhang, "WF2Q: Worst-case fair weighted fair queuing, Proc. IEEE INFOCOM, pp. 120--128, 1996. Google ScholarDigital Library
- S. Keshav, "an Engineering Approach to Computer Networking: ATM Networks, the Internet, and the Telephone Network", Addison-Wesley, 1997. Google ScholarDigital Library
- A. Greenberg and N. Madras, "How fair is Fair Queuing?" Journal of ACM, July 1992. Google ScholarDigital Library
- A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queuing algorithm", Internet Res. and Exper., Vol. 1, 1990.Google Scholar
- K. Altinbuken, A. Layamon and S. Subramanian, "A Comparison of Fair Queuing Algorithms for the Internet", In Proc. IASTED Intl. Conf. on Communications, December 2006.Google Scholar
- W. Roberts, N. Benamuer, S. B. Fredj, F. Delcoigne and S. O. Boulahian, "Integrated Admission Control for Streaming and Elastic Traffic", Springer-Verlag Berlin Heidelberg 2001, pp. 1--2.Google Scholar
- A. Demers, S. Keshav and S. Shenker, "Analysis and Simulation of a Fair Queuing Algorithm", ACM, 1988.Google Scholar
- H. Asif and E. Alfy, "Performance evaluation of queuing disciplines for multi-class traffic using OPNET simulator", In the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical engineering (MMACTEE'05), 2005. Google ScholarDigital Library
- M. Ashour and T. Le-Ngoc, "Performance Analysis of Weighted Fair Queues with Variable Service Rates, 'In the International Conference on Digital Telecom, ICDT 2006. Google ScholarDigital Library
- S. Borst, CWI, "User Level Performance of Channel Aware Scheduling Algorithms in Wireless Data Networks", Proc. IEEE INFOCOM'03, April 2003.Google Scholar
- J. Sahni, P. Goyal and H. M. Vin," Scheduling CBR Flows: FIFO or per flow Queuing?" AT&T Labs--Research, New Jersey, 2002.Google Scholar
Index Terms
- Weighted start-time fair queuing: a new start-time fair queuing for elastic traffic
Recommendations
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
SIGCOMM '96: Conference proceedings on Applications, technologies, architectures, and protocols for computer communicationsWe present Start-time Fair Queuing (SFQ) algorithm that is computationally efficient, achieves fairness regardless of variation in a server capacity, and has the smallest fairness measure among all known fair scheduling algorithms. We analyze its ...
Latency-differentiable start-time fair queuing
CSNA '07: Proceedings of the IASTED International Conference on Communication Systems, Networks, and ApplicationsFair queuing algorithms providing Quality-of-Service (QoS) guarantees can be classified into two design methods in terms of the reference time used in calculating the timestamp of arriving packet: Start-Time (ST) and Finish-Time (FT). It was known that ...
Token bank fair queuing: a new scheduling algorithm for wireless multimedia services: Research Articles
Special Issue: QoS Support and Service Differentiation in Wireless NetworksThe token bank fair queuing algorithm (TBFQ) is a novel scheduling algorithm that is suitable for wireless multimedia services. The bandwidth allocation mechanism integrates the leaky bucket structure with priority handling to address the problem of ...
Comments