ScholarLens Back to search
2011•Unpublished venueRequires access

Comparative Study on Delay and Throughput for Weighted Fair Queuing and Priority Queuing

Swarnalatha Mannar Mannan, Anoop Vuppala, Shiva Chaitnaya Nallapati

Open publisher page 1 citations

Abstract

Today’s modern world is very much dependent on IP (Internet Protocol) Network services. Queuing is one of the vital mechanisms in traffic management systems. As a part of resource allocation mechanism each router in the network must implement some queuing techniques that govern the packets transmission while waiting in the queue. The (Weighted Fair Queuing (WFQ), Priority Queuing (PQ) and Fair Queuing (FQ) are most prominent techniques implemented in the router. This paper gives a comparative analysis of WFQ and Priority Queuing for different Types of Services (ToS). A study has been carried out on end to end delay and throughput by using OPNET simulator. The simulation result shows that WFQ technique has low delay and maximum throughput than PQ. This shows WFQ provides better performance than the priority queuing in IP networks.

About this research paper

What this paper is about

Today’s modern world is very much dependent on IP (Internet Protocol) Network services. Queuing is one of the vital mechanisms in traffic management systems. As a part of resource allocation mechanism each router in the network must implement some queuing techniques that govern the packets transmission while waiting in the queue. The (Weighted Fair Queuing (WFQ), Priority Queuing (PQ) and Fair Queuing (FQ) are most prominent techniques implemented in the router. This paper gives a comparative analysis of WFQ and Priority Queuing for different Types of Services (ToS). A study has been carried out on end to end delay and throughput by using OPNET simulator. The simulation result shows that WFQ technique has low delay and maximum throughput than PQ. This shows WFQ provides better performance than the priority queuing in IP networks.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Today’s modern world is very much dependent on IP (Internet Protocol) Network services. Queuing is one of the vital mechanisms in traffic management systems. As a part of resource allocation mechanism each router in the network must implement some queuing techniques that govern the packets transmission while waiting in the queue. The (Weighted Fair Queuing (WFQ), Priority Queuing (PQ) and Fair Queuing (FQ) are most prominent techniques implemented in the router. This paper gives a comparative analysis of WFQ and Priority Queuing for different Types of Services (ToS). A study has been carried out on end to end delay and throughput by using OPNET simulator. The simulation result shows that WFQ technique has low delay and maximum throughput than PQ. This shows WFQ provides better performance than the priority queuing in IP networks.

Key concepts: Weighted fair queueing, Fair queuing, Computer science, Computer network, Queueing theory, Queuing delay, Generalized processor sharing, Throughput

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Comparative Study on Delay and Throughput for Weighted Fair Queuing and Priority Queuing — Research Paper | ScholarLens