Performance evaluation of WFQ, WF&lt;sup&gt;2&lt;/sup&gt;Q&amp;#x002B; and WRR queue scheduling algorithms

Balogh, Tomáš; Medvecký, Martin

doi:10.1109/tsp.2011.6043756

Cited by 13 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…an IP router, an ATM switch). In practice, scheduling decides the order that is used to pick the packets [7] out of the queue and to transmit them over the channel. The Scheduling envisaged allows to achieve QoS differentiation and to reduce the queuing delay in order to optimize the end to end delay [8].…”

Section: Packet Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

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

Mustafa¹,

Talab²

2016

WSN

View full text Add to dashboard Cite

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 not fair, because it serves one application and ignore the other application and FIFO mechanism has smaller queuing delay, otherwise PQ has bigger delay.

show abstract

Section: Packet Schedulingmentioning

confidence: 99%

“…WFQ was introduced in 1989 Zhang, Demers, Keshav and Schenke (1989). The algorithm provides fair output bandwidth sharing according to assigned weights [7] as shown in Figure 3. Weighted fair queue is a variant of fair queue equipped with a weighted bandwidth allocation.…”

Section: Weighted Fair Queuingmentioning

confidence: 99%

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

Mustafa¹,

Talab²

2016

WSN

View full text Add to dashboard Cite

show abstract

“…FQ is not designed to support traffic with different QoS requirements, as it allocates the same amount of bandwidth among multiple traffic. The computational complexity of WFQ algorithm affects its scalability to support lager traffic with different requirements at the edge of the network [13] - [15]. WRR addresses the limitations of FIFO, PQ, and FQ by classifying traffic based on their QoS requirements, and ensuring that low priority traffic can access to buffer space and output port bandwidth.…”

Section: B Wired Qosmentioning

confidence: 99%

“…However, when one type of application is not transmitted at particular time interval, WRR divides the bandwidth allocated to that application to other transmitted applications according to their respective weights [15]. …”

Section: B Weighted Round Robin Queuing Mechanismmentioning

confidence: 99%

Improving Quality of Service in IEEE 802.11e Enhanced Distributed Channel Access protocol

Dogman

Saatchi

Al-Khayatt

2012

2012 8th International Symposium on Communication Systems, Networks &Amp; Digital Signal Processing (CSNDSP)

View full text Add to dashboard Cite

A new quality of service (QoS) enhancement scheme for IEEE 802.11e Enhanced Distributed Channel Access (EDCA) protocol is developed. It uses a combination of an adaptive access category (AC) traffic allocation, incorporated into the network's wireless side, and weighted round robin (WRR) queuing scheduling mechanism, incorporated into the wired side of the network. The adaptive traffic allocation algorithm determines the packet arrival rate (PAR) of the up-and down-link traffic for each access category (AC). It then dynamically allocates traffic of a lower priority AC to the next higher AC, when the higher AC is not receiving traffic at the time. WRR shared the network resources, based on the traffic's Quality of Service requirements. The incorporation of the scheme caused an overall reduction of delay by 54.6%, jitter by 32%, and packet loss ratio by 62% for the transmitted applications.

show abstract

“…The Diffserv architecture presents an architecture where packets are marked and divided into service classes as they enter the network . Network nodes are then able to provide different services using some scheduling algorithms.…”

Section: Introductionmentioning

confidence: 99%

New fluid approaches for studying the performance of elastic traffic under class based weighed fair queuing system

2018

View full text Add to dashboard Cite

Although TCP is typically designed to carry data (transfer of documents such as files or web pages), it is also suitable, today, for transporting most commercial video-streaming traffic such as YouTube or Netflix traffic. The class-based weighted fair queuing is still an important router discipline that allows different classes of elastic flows (generally, TCP flows) to be transported together in a truly converged network. Such system has been extensively studied in packet level by evaluating several criteria of effectiveness such as the mean queue length and the average queue waiting time, without proposing a general model that captures the flow-level dynamics and the real coupling aspect between different queues.Moreover, most studies limited their works to a simple two-queue system where performance evaluation is very much easier. Even the few works focusing on providing extended results did not give accurate results for very loaded systems.Proposed packet-level models seem, then, to be not convenient to predict the performance of large-scale operator networks with millions of users, millions of flows, and unexpected user behaviors. This paper aims to overcome these limitations by presenting new analytical explicit mathematical expressions evaluating the flow-level performance metrics of elastic traffic under a general class-based weighted fair queuing system. The core of our analysis is based on some approximations proven for balanced fairness allocation, which provides a reasonable framework for estimating bandwidth sharing among elastic traffic for best-effort allocations. Detailed packet level simulations are used to verify the accuracy and the effectiveness of the proposed approaches.

show abstract

Performance evaluation of WFQ, WF<sup>2</sup>Q+ and WRR queue scheduling algorithms

Cited by 13 publications

References 12 publications

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

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

Improving Quality of Service in IEEE 802.11e Enhanced Distributed Channel Access protocol

New fluid approaches for studying the performance of elastic traffic under class based weighed fair queuing system

Contact Info

Product

Resources

About