Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Choosing the best quality of service algorithm using OPNET simulation

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 4 (2022)

DOI
10.11591/ijece.v12i4.pp4079-4089
ISSN
2722-2578, 2088-8708
Published
2022-08-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The concept of quality of service (QoS) is a new computer technology. Previously, there was a slow internet connection to access the sites and it was slow to send information. But now, it requires speeding up the traffic and increasing the efficiency for audio and video. In this study, we discuss the concepts of QoS provided over the network to achieve these goals. This study aims to compare six algorithms to control the QoS, then, the best algorithm will be selected to improve the traffic. These algorithms are named first in first out (FIFO), priority queuing (PQ), custom queuing (CQ), CQ with low latency queuing (LLQ), weighted fair queuing (WFQ), WFQ with low latency queuing (LLQ), so the behavior of these algorithms can be measured. The results obtained by comparing between them using OPNETsimulation show that the best algorithm is the priority queuing algorithm, followed by CQ, then CQ with LLQ, then WFQ, then WFQ with LLQ and finally FIFO. All these results are plotted in the form of graphs to show the paths of these algorithms for the single state with an operation time of 5 minutes for each algorithm.

Collaboration network of the authors

5 authors · 10 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Jouf University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Choosing the best quality of service algorithm using OPNET simulation</dc:title><dc:creator>Eltaib, Mohamed Osman</dc:creator><dc:creator>Alshammari, Hamoud H.</dc:creator><dc:creator>Boukrara, Ammar</dc:creator><dc:creator>Gasmi, Karim</dc:creator><dc:creator>Hrizi, Olfa</dc:creator><dc:description>&lt;jats:p&gt;The concept of quality of service (QoS) is a new computer technology. Previously, there was a slow internet connection to access the sites and it was slow to send information. But now, it requires speeding up the traffic and increasing the efficiency for audio and video. In this study, we discuss the concepts of QoS provided over the network to achieve these goals. This study aims to compare six algorithms to control the QoS, then, the best algorithm will be selected to improve the traffic. These algorithms are named first in first out (FIFO), priority queuing (PQ), custom queuing (CQ), CQ with low latency queuing (LLQ), weighted fair queuing (WFQ), WFQ with low latency queuing (LLQ), so the behavior of these algorithms can be measured. The results obtained by comparing between them using OPNETsimulation show that the best algorithm is the priority queuing algorithm, followed by CQ, then CQ with LLQ, then WFQ, then WFQ with LLQ and finally FIFO. All these results are plotted in the form of graphs to show the paths of these algorithms for the single state with an operation time of 5 minutes for each algorithm.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-08-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i4.pp4079-4089</dc:identifier><dc:identifier>10.11591/ijece.v12i4.pp4079-4089</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 4 (2022); 4079</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/25060/15832</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>