An adaptive approach to weighted fair queue with QoS enhanced on IP network

We propose an adaptive bandwidth allocation algorithm for reservation protocols to support quality-of-service networking on the future multimedia Internet. QoS design is the fundamental functionality of the next generation IP router to enable differentiated delivery and to guarantee the delivery quality for diverse service traffic. The proposed algorithm called adaptive weighted fair queue (AWFQ) scheduling employs the queue status and priority assignment to determine the bandwidth sharing of various Internet services and to ensure the defined QoS policy is obtained. We propose a smart methodology of distributing the outlink bandwidth in a flexible, fair and prioritized manner to utilize network bandwidth more effectively and efficiently. In simulation, we compare the proposed AWFQ algorithm with priority queue (PQ) and weighted fair queue (WFQ) that are two famous scheduling algorithms in practice. In comparison, we examine their performances in terms of packet loss, bandwidth utilization and queue dynamics to verify our algorithm. We find that the proposed algorithm has the following advantages: 1) improves the bandwidth starvation of low-priority traffic occurring in PQ, 2) has a high bandwidth utilization close to PQ, 3) has a low queue congestion and 4) maintains the fairness of WFQ. Overall, the proposed algorithm not only has an excellent performance close to PQ but also improve the disadvantage of PQ.