2016
DOI: 10.4236/wsn.2016.85008
|View full text |Cite
|
Sign up to set email alerts
|

The Effect of Queuing Mechanisms First in First out (FIFO), Priority Queuing (PQ) and Weighted Fair Queuing (WFQ) on Network’s Routers and Applications

Abstract: The paper presents the simulation results of the comparison of three Queuing Mechanisms, First in First out (FIFO), Priority Queuing (PQ), and Weighted Fair Queuing (WFQ). Depending on their effects on the network's Routers, the load of any algorithm of them over Router's CPUs and memory usage, the delay occurred between routers when any algorithm has been used and the network application throughput. This comparison explains that, PQ doesn't need high specification hardware (memory and CPU) but when used it is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…FIFO is used in many scientific researches in order to study the behavior of systems or technologies. In a research (Mustafa & Talab, 2016), FIFO queueing is used as their first scheduling algorithm to study the effects of different scheduling algorithms on network routers and applications. In this research, the authors used Opnet Modeler as their simulation environment to compare FIFO with Priority Queueing (PR) and many other algorithms to see their effect on the network router's CPU and memory usage in terms of load, delay and throughput.…”
Section: First-in-first-out (Fifo) Scheduling Algorithmmentioning
confidence: 99%
“…FIFO is used in many scientific researches in order to study the behavior of systems or technologies. In a research (Mustafa & Talab, 2016), FIFO queueing is used as their first scheduling algorithm to study the effects of different scheduling algorithms on network routers and applications. In this research, the authors used Opnet Modeler as their simulation environment to compare FIFO with Priority Queueing (PR) and many other algorithms to see their effect on the network router's CPU and memory usage in terms of load, delay and throughput.…”
Section: First-in-first-out (Fifo) Scheduling Algorithmmentioning
confidence: 99%
“…This allows for elements of higher priority to be extracted first, independently of the order in which they are inserted into the queue [25]. In consequence, priority queuing is the basis for a class of queue scheduling algorithms that are designed to provide relatively simple method of supporting differentiated service classes [26]. Thus it is analogous to the behavior of persons "standing in a line" or "queue" where the persons leave the queue in the order they arrive.…”
Section: Priority Queue (Pq)mentioning
confidence: 99%
“…Packet scheduling specifies the service policy of a queue within a node (e.g. an IP router, an ATM switch) [15]. In practice, scheduling decides the order that is used to pick the packets out of the queue and to transmit them over the channel.…”
Section: Scheduling Algorithmsmentioning
confidence: 99%