Analysis of virtual-time complexity in weighted fair queuing

Alnuweiri, Hussein; Tayyar, Haitham

doi:10.1016/j.comcom.2004.12.010

Cited by 7 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This complexity is in addition to the inherent complexity of computing virtual times for these algorithms [21]. We have also shown in [17] that, in a singe rate WLAN, fair algorithms such as SFQ that use start time scheduling have an advantage over WFQ and WF 2 Q.…”

Section: Delay Bound Analysis Of Caps-sfqmentioning

confidence: 93%

See 1 more Smart Citation

Analysis of temporal and throughput fair scheduling in multirate WLANs

Fallah

Alnuweiri

2008

Computer Networks

Self Cite

View full text Add to dashboard Cite

Section: Delay Bound Analysis Of Caps-sfqmentioning

confidence: 93%

“…h Lemma 6. In a dynamic multirate SFQ the time it takes to serve the traffic of set E1 is less than V 2 À V 1 for V 1 and V 2 as described in (21).…”

Section: Delay Bound Of Throughput Fair Sfq In Dynamic Multirate Casementioning

confidence: 99%

Analysis of temporal and throughput fair scheduling in multirate WLANs

Fallah

Alnuweiri

2008

Computer Networks

Self Cite

View full text Add to dashboard Cite

“…To ensure this, the scheduler uses a global variable known as h(t) virtual time. The variable's responsibility is to maintain a record of scheduler's work [29]. The virtual time is represented in equation 1 as:…”

Section: Fairness Factormentioning

confidence: 99%

Implementation of Class-Based Low Latency Fair Queueing (CBLLFQ) Packet Scheduling Algorithm for HSDPA Core Network

2020

KSII TIIS

View full text Add to dashboard Cite

To provide a guaranteed Quality of Service (QoS) to real-time traffic in High-Speed Downlink Packet Access (HSDPA) core network, we proposed an enhanced mechanism. For an enhanced QoS, a Class-Based Low Latency Fair Queueing (CBLLFQ) packet scheduling algorithm is introduced in this work. Packet classification, metering, queuing, and scheduling using differentiated services (DiffServ) environment was the points in focus. To classify different types of real-time voice and multimedia traffic, the QoS provisioning mechanisms use different DiffServ code points (DSCP).The proposed algorithm is based on traffic classes which efficiently require the guarantee of services and specified level of fairness. In CBLLFQ, a mapping criterion and an efficient queuing mechanism for voice, video and other traffic in separate queues are used. It is proved, that the algorithm enhances the throughput and fairness along with a reduction in the delay and packet loss factors for smooth and worst traffic conditions. The results calculated through simulation show that the proposed calculations meet the QoS prerequisites efficiently.

show abstract

“…However, as aforementioned, GPS is impractical because several packets from different traffic flows receive services simultaneously in GPS. On the contrary, in realistic networks a scheduler must complete or terminate the service of an entire packet from a flow before turning to the next flow [1], [7]. For this reason, many packet-based scheduling disciplines have been proposed to approximate the GPS scheduling mechanism in the open literature.…”

Section: Introductionmentioning

confidence: 98%

“…To provide differentiated QoS, weight-based scheduling principles including the well-known Generalized Process Sharing (GPS) [11] and Weighted Fair Queueing (WFQ) [1] have been proposed. In GPS, each traffic flow is assigned a fixed weight that can guarantee a minimum service rate even though other traffic flows may be greedy in demanding service.…”

Section: Introductionmentioning

confidence: 99%

A Comprehensive Analytical Model for Weighted Fair Queuing under Multi-Class Self-Similar Traffic

Jin

Min

Wang

2009

2009 IEEE International Conference on Communications

View full text Add to dashboard Cite

Weighted Fair Queueing (WFQ) is a practical scheduling discipline for supporting differentiated Quality-ofService (QoS) in computer networks and communication systems. Analytical models are important tools for system performance evaluation and resource optimization. However, there is not any comprehensive model reported in the open literature for analytically investigating the performance behaviors of WFQ subject to multiple self-similar traffic flows. To fill this gap, this paper develops such a model and derives the upper bounds for the distributions of several important QoS performance metrics including queue length, packet delay and loss of traffic flows in the WFQ system. The comparison between analytical and simulation results using the traffic parameters obtained from real-world MPEG frame traces validates the accuracy of the developed model which can be used for investigating the performance behavior of WFQ systems with multi-class selfsimilar traffic under realistic working conditions.

show abstract

Analysis of virtual-time complexity in weighted fair queuing

Cited by 7 publications

References 15 publications

Analysis of temporal and throughput fair scheduling in multirate WLANs

Analysis of temporal and throughput fair scheduling in multirate WLANs

Implementation of Class-Based Low Latency Fair Queueing (CBLLFQ) Packet Scheduling Algorithm for HSDPA Core Network

A Comprehensive Analytical Model for Weighted Fair Queuing under Multi-Class Self-Similar Traffic

Contact Info

Product

Resources

About