Scheduler Algorithm for Multi-Class Switch with Priority Threshold

Abdul Aziz Abdul Rahman, Kamaruzzaman Seman, Kamarudin Saadan, Ahmad Kamsani Samingan, Azreen Azman

Faculty of Computer Science & IT, Universiti Putra Malaysia (UPM), Selangor, Malaysia.
Faculty of Science & Technology, Universiti Sains Islam Malaysia (USIM), Negeri Sembilan, Malaysia.
Next Generation Access, Telekom Research & Development, Selangor, Malaysia.

DOI: 10.4236/ijcns.2012.56041                

Abstract

The requirement for guaranteed Quality of Service (QoS) have become very essential since there are numerous network base application is available such as video conferencing, data streaming, data transfer and many more. This has led to the multi-class switch architecture to cater for the needs for different QoS requirements. The introduction of threshold in multi-class switch to solve the starvation problems in loss sensitive class has increased the mean delay for delay sensitive class. In this research, a new scheduling architecture is introduced to improve mean delay in delay sensitive class when the threshold is active. The proposed architecture has been simulated under uniform and non-uniform traffic to show performance of the switch in terms of mean delay. The results show that the proposed architecture has achieved better performance as compared to Weighted Fair Queueing (WFQ) and Priority Queue (PQ).

Keywords

Scheduler; Priority Thresholds; Multi-Class; Quality of Service (QOS)

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	A. K. Gupta and N. D. Georganas, “Priority performance of ATM packet switches,” Proceedings of Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, Florence, 4-8 May 1992, pp. 727-733.
[2]	L. Lemin, et al., “Maximum Throughput of an Input Queueing Packet Switch with Two Priority Classes,” IEEE Transactions on Communications, Vol. 42, No. 12, 1994, pp. 3095-3097. doi:10.1109/26.339828
[3]	A. A. A. Rahman, et al., “Multi-Class Scheduling Technique Using Dual Threshold,” The 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, Kuching, 15-18 June 2010, pp. 1-5.
[4]	J. S. C. Chen and R. Guerin, “Performance Study of an Input Queueing Packet Switch with Two Priority Classes,” IEEE Transactions on Communications, Vol. 39, No. 1, 1991, pp. 117-126. doi:10.1109/26.68282
[5]	J. S. Choi and C. K. Un, “Delay Performance of an Input Queueing Packet Switch with Two Priority Classes,” IEE Proceedings of Communications, Vol. 145, No. 3, 1998, pp. 141-144. doi:10.1049/ip-com:19981931
[6]	D. C. W. Pao and S. P. Lam, “Cell Scheduling for ATM Switch with Two Priority Classes,” IEEE ATM Workshop Proceedings, Fairfax, 26-29 May 1998, pp. 86-90.
[7]	A. Al-Sawaai, I. Awan and R. Fretwell, “Analysis of the Weighted Fair Queuing System with Two Classes of Customers with Finite Buffer,” International Conference on Advanced Information Networking and Applications Workshops, Bradford, 26-29 May 2009, pp. 218-223.
[8]	A. Al-Sawaai, I. U. Awan and R. Fretwell, “Performance of Weighted Fair Queuing System with Multi-Class Jobs,” The 24th IEEE International Conference on Advanced Information Networking and Applications, Perth, 20-23 April 2010, pp. 50-57.
[9]	A. A. A. Rahman, et al., “Adaptive Dual Threshold Multi-Class Scheduling for Packet Switch,” International Journal of Computer and Network Security, Vol. 2, No. 8, 2010, pp. 21-26.