article · Springer Link (Chiba Institute of Technology) · 2016

Dynamic Multi Threshold Priority Packet Scheduling Algorithms

Tamer Dag, Sezer Uzungenc

Cited by 0Abstract and details only

Abstract

\nPacket 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.\n

Cite this paper

APA 7

Dag, T., & Uzungenc, S. (2016). Dynamic Multi Threshold Priority Packet Scheduling Algorithms. Springer Link (Chiba Institute of Technology). https://doi.org/10.1051/matecconf/20167506004/pdf

MLA 9

Dag, Tamer, and Sezer Uzungenc. “Dynamic Multi Threshold Priority Packet Scheduling Algorithms.” Springer Link (Chiba Institute of Technology), 2016, https://doi.org/10.1051/matecconf/20167506004/pdf.

Chicago

Dag, Tamer, and Sezer Uzungenc. 2016. “Dynamic Multi Threshold Priority Packet Scheduling Algorithms.” Springer Link (Chiba Institute of Technology). https://doi.org/10.1051/matecconf/20167506004/pdf.

Harvard

Dag, T. and Uzungenc, S. (2016) ‘Dynamic Multi Threshold Priority Packet Scheduling Algorithms’, Springer Link (Chiba Institute of Technology). Available at: https://doi.org/10.1051/matecconf/20167506004/pdf.

BibTeX

@article{dag2016dynamic,
  title = {{Dynamic Multi Threshold Priority Packet Scheduling Algorithms}},
  author = {Dag, Tamer and Uzungenc, Sezer},
  journal = {Springer Link (Chiba Institute of Technology)},
  year = {2016},
  doi = {10.1051/matecconf/20167506004/pdf}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.