Dynamic Multi Threshold Priority Packet Scheduling Algorithms

Abstract

Abstract.Packet scheduling algorithms are developed in order to use shared transmission resources efficiently. Various application packets such as real and non-real time packets might have different QoS requirements and traditional scheduling algorithms might be insufficient to respond to the applications needs. In this paper, two packet scheduling algorithms are proposed to overcome this problem: Dynamic multi threshold priority packet scheduling (DMTPS) and dynamic multi threshold priority with urgency packet scheduling (DMTPUS). The proposed algorithms aim to provide a better QoS level with a decrease in delay time and loss ratio for the low priority packets while still maintaining acceptable fairness towards high priority packets. To evaluate the performance of DMTPS and DMTPUS algorithms, they are compared with the commonly used scheduling algorithms such as first come first served (FCFS) and fixed priority. Simulation results illustrate that the dynamic multi threshold priority packet scheduling algorithms can provide a better QoS for low priority packets without decreasing the QoS levels of high priority packets.

Non-preemptive priority scheduler with multiple thresholds for network routers

“…However, this type of approach introduces excessive processing delays. In [14], dynamic multi threshold priority scheduling algorithm is introduced. If a packet arrives with an urgent flag set, its priority is increased and the packet is placed forward in the queue.…”