Priority based, adaptive queuing for differentiating services in IP based networks

摘要

Packet classification and packet scheduling are important and basic techniques used in network nodes, in order to provide quality of service for packets belonging to different applications. In this paper we propose a new priority based, adaptive queuing algorithm, including an adaptive, packet-by-packet classifier for differentiating services in IP based networks. The proposed queuing paradigm focuses on providing delay sensitive application's requirements while not imposing noticeable delay on other applications and improving fairness and the performance of the system at the same time. The main advantage of the algorithm is that, it can dynamically adopt its parameters to the changing nature of the Internet. The simulation results, which are very promising, confirm that the algorithm has reached its goals.