A New Class of Priority-based Weighted Fair Scheduling Algorithm
Li Yang, Chengsheng Pan, ErHan Zhang, Haiyan Liu · Physics Procedia · 2012
The traditional fair queuing scheduling algorithm (WFQ WF2Q) for data application is a fair and efficient algorithm, while when they face to real-time applications such as voice, interactive video, and so on, they are short of the guarantee of strict time delay. In view of this, we propose one kind of weighted fair scheduling algorithm which is based on an strict rob priority class, this algorithm add an absolute priority queue based on the foundation of based class weighted fair scheduling algorithm(CBWFQ), and it also carries on the expansion to network simulator NS2. With the comparison to traditional algorithm, we can drawn a conclusion from the simulation results that the new algorithm can improve the time delay, fairness and other network performances based on the same throughput. Namely it guarantees the real-time application of Quality of Service, also guarantees the fair transmission of other service.