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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.