Weighted fair queueing

Known as: WFQ, Weighted Fair Queuing 
Weighted fair queueing (WFQ) is a data packet scheduling algorithm used by network schedulers. WFQ is both a packet based implementation of the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
One of the key challenges of next-generation wireless networks (such as enhanced general packet radio service) is the ability to… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2006
2006
The ongoing evolution towards the generalization of wireless access to multi-service networks stresses on the need for optimizing… (More)
  • figure 1
  • table I
  • figure 2
Is this relevant?
2004
2004
Feedback control of QoS-aware servers has recently gained much popularity due to its robustness in the face of uncertainty and… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2002
Highly Cited
2002
With Weighted Fair Queuing, the link’s bandwidth is distributed among competing flows proportionally to their weights. In this… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 8
Is this relevant?
2002
2002
While exisiting weighted fair scheduling schemes guarantee minimum bandwidths for classes/sessions in a shared channel, maximum… (More)
  • figure 1
  • figure 2
  • table II
  • figure 3
  • figure 4
Is this relevant?
2000
2000
This paper presents a study carried out on a Weighted Fair Queuing implementation for Unix routers the WFQ implementation of the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 7
Is this relevant?
1998
1998
Today, ATM networks are being used to carry bursty data traffic with large and highly variable rates, and burst sizes ranging… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Abslmcl-Although wcightcd fair queueing (WFQ) has been regnrdcd ns an ideal scheduling algorithm in terms of its combined dclny… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end… (More)
  • table 1
  • figure 2
  • figure 1
  • figure 3
  • figure 4
Is this relevant?