Research on Queue Scheduling Algorithm Modeling and Analysis
Heng Shi, Xin Xu, Yu Jie Wang, Yuan Yue Yang
Abstract
Heng Shi, Xin Xu, Yu Jie Wang, Yuan Yue Yang
Abstract
With the development of network technology and the wide use of the Internet, QoS has attracted wide attention. Queue scheduling algorithm of Router is an important core technology of the network resource management for QoS. Through controlling usage of the link bandwidth of the different type groups, the different traffics have the different levels of service. Based on the analysis and modeling of FIFO, PQ, and WFQ scheduling algorithms, the simulation experiment simulate three different priority video conferencing traffic, and apply FIFO, PQ, and WFQ scheduling algorithms on the bottleneck link. The simulation results compare network delay of FIFO, PQ, and WFQ scheduling algorithms, and describe the various queue scheduling algorithm characteristics.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
With the development of network technology and the wide use of the Internet, QoS has attracted wide attention. Queue scheduling algorithm of Router is an important core technology of the network resource management for QoS. Through controlling usage of the link bandwidth of the different type groups, the different traffics have the different levels of service. Based on the analysis and modeling of FIFO, PQ, and WFQ scheduling algorithms, the simulation experiment simulate three different priority video conferencing traffic, and apply FIFO, PQ, and WFQ scheduling algorithms on the bottleneck link. The simulation results compare network delay of FIFO, PQ, and WFQ scheduling algorithms, and describe the various queue scheduling algorithm characteristics.
Key concepts: Weighted fair queueing, Computer science, Computer network, Earliest deadline first scheduling, Distributed computing, Bottleneck, Dynamic priority scheduling, Quality of service