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

has been cited by the following article:

• TITLE: Scheduler Algorithm for Multi-Class Switch with Priority Threshold

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

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

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.5 No.6, June 12, 2012

  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).