Priority-Aware Fair Queueing for QoS Provisioning in the Internet

Authors

Jui-Pin Yang, Department of Information Technology and Communication, Shih-Chien University, Kaohsiung 84552, Taiwan, R.O.C.Follow

Author Country (or Countries)

R.O.C.

Abstract

Fair bandwidth sharing and differentiated drop precedence are two key QoS provisioning in the Internet. However, they both are studied separately. In the paper, we propose a simple active queue management scheme that deals with fair bandwidth sharing and differentiated drop precedence at the same time namely priority-aware fair queueing (PAFQ). PAFQ uses a dynamic threshold to keep up with traffic variations and hence it can efficiently discriminate non-aggressive flows from aggressive flows. Furthermore, a swap policy conditionally exchanges the records of current queue lengths of both compared packets from the same flow by considering respective drop precedence. Accordingly, this policy provides differentiated drop precedence within a flow. Besides, a mark policy is used to selectively mark a packet with the maximum count of current queue length that contributes to achieve fair bandwidth sharing among competing flows. When a marked packet reaches at the head of FIFO buffer, it will be discarded directly. Simulation results validate that the PAFQ is able to provide excellent fair bandwidth sharing and differentiated drop precedence under a variety of traffic conditions. In addition, it keeps average queue lengths low.

Recommended Citation

Yang, Jui-Pin (2015) "Priority-Aware Fair Queueing for QoS Provisioning in the Internet," Applied Mathematics & Information Sciences: Vol. 09: Iss. 4, Article 60.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol09/iss4/60