Scheduler Algorithm for Multi-Class Switch with Priority Threshold
Scheduler Algorithm for Multi-Class Switch with Priority Threshold作者机构：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
出 版 物：《International Journal of Communications, Network and System Sciences》 (通讯、网络与系统学国际期刊（英文）)
年 卷 期：2012年第5卷第6期
页 面：313-320页
学科分类：081203[工学-计算机应用技术] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）]
主 题：Scheduler Priority Thresholds Multi-Class Quality of Service (QOS)
摘 要：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).
维普期刊数据库