Approximation for a two-class weighted fair queueing discipline

Shortle, John; Fischer, Martin J.

doi:10.1016/j.peva.2010.05.004

Cited by 18 publications

(17 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This scheduling discipline is very important to understand how heterogeneous elastic traffic converges and competes for the use of the same‐shared transmission resources. Class‐based weighted fair queuing may be able to meet the QoS measures needed by the different elastic traffic types …”

Section: Introductionmentioning

confidence: 99%

“…Although the issue of resource allocation in CBWFQ system cannot be addressed without taking into account the random and the dynamic nature of ongoing flows, studying the flow level performance of elastic traffic under such system (or an equivalent system) has not received much attention in literature. Class‐based weighted fair queuing system has been extensively studied at 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 (arrivals and departures of flows) and the real coupling aspect between different queues.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Section: Introductionmentioning

confidence: 99%

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

show abstract

“…We mention, among others, priority scheduling (see, e.g., [4,8,11,13,15]), weighted fair queueing (WFQ) (see, e.g., [14,17]), random order of service (ROS) (see, e.g., [1,3,10]), and generalized processor sharing (GPS) (see, e.g., [9,12,16]). Strangely enough, only few results have been derived for multi-class First-Come-First-Served (FCFS) systems, i.e., queueing systems in which the customers of different classes are accommodated in one queue and served in their order of arrival, irrespective of the classes they belong to (a recent paper is [5]).…”

Section: Introductionmentioning

confidence: 99%

Analysis of a Two-Class FCFS Queueing System with Interclass Correlation

Bruneel

Maertens

Steyaert

et al. 2012

Analytical and Stochastic Modeling Techniques and Applications

View full text Add to dashboard Cite

Abstract. This paper considers a discrete-time queueing system with one server and two classes of customers. All arriving customers are accommodated in one queue, and are served in a First-Come-First-Served order, regardless of their classes. The total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. The classes of consecutively arriving customers, however, are correlated in a Markovian way, i.e., the probability that a customer belongs to a class depends on the class of the previously arrived customer. Service-time distributions are assumed to be general but class-dependent. We use probability generating functions to study the system analytically. The major aim of the paper is to estimate the impact of the interclass correlation in the arrival stream on the queueing performance of the system, in terms of the (average) number of customers in the system and the (average) customer delay and customer waiting time.

show abstract

“…weighted round-robin [17,31], deficit round-robin [47] and smoothed round-robin [22]), generalised processor sharing (GPS) [18], packet-by-packet generalized processor sharing (P-GPS) [15], class-based weighted fair queuing (CBWFQ) [46], virtual clock [64] and self-clocked fair queuing [21].…”

Section: Introductionmentioning

confidence: 99%

“…. , w N , data flow i will achieve an average data rate of R * w i /(w 1 þ w 2 þ · · · þ w N ), where R is the data link rate) [46] have been adopted by the industry and implemented in most commercial products (e.g. [4,7,8,14,24,25,42]).…”

Section: Introductionmentioning

confidence: 99%

Class-based weighted fair queuing scheduling on quad-priority Delta Networks

Vasiliadis

Rizos

Vassilakis

2012

International Journal of Parallel, Emergent and Distributed Sys

View full text Add to dashboard Cite

Contemporary networks support multiple priorities, aiming to differentiate the quality of service (QoS) levels offered to individual traffic classes. Support for multiple priorities necessitates the introduction of a scheduling algorithm, to select each time the next packet to transmit over the data link. Class-based weighted fair queuing (CBWFQ) scheduling and its variations are widely used as a scheduling technique since it is easy to implement and prevent the low-priority queues from starvation, i.e. receiving no service during periods of high-priority traffic. CBWFQ effectively thus offers low-priority queues, the opportunity to transmit packets even though the high-priority queues are not empty. In this paper, we present the modelling and performance evaluation of a single-buffered, four-priority multistage interconnection network (MIN) operating under the CBWFQ scheduling policy. Performance evaluation is conducted through simulation, and the performance metrics obtained can be used by MIN designers to set the appropriate queue weights according to the expected traffic and the desired QoS levels for each priority class, delivering efficient thus systems.

show abstract

Approximation for a two-class weighted fair queueing discipline

Cited by 18 publications

References 21 publications

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

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

Analysis of a Two-Class FCFS Queueing System with Interclass Correlation

Class-based weighted fair queuing scheduling on quad-priority Delta Networks

Contact Info

Product

Resources

About