2002•Unpublished venueRequires access

A comparative evaluation of sorted priority algorithms and class based queuing using simulation

P. Csallinan, M. Witwit, Frank Ball

Abstract

This paper present results from a simulation study aimed at evaluating the comparative performance of two resource control mechanisms viz. weighted fair queueing (WFQ) and class based queueing (CBQ). The purpose of this work is to assess their relative suitability for supporting multiservice in future packet switched networks. The experiment described in this paper compares their respective response time delay characteristics when each is presented with identical traffic profiles.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 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

Key concepts: Weighted fair queueing, Queueing theory, Computer science, Class (philosophy), Fair queuing, Network packet, Algorithm, Generalized processor sharing