Skip to search formSkip to main contentSkip to account menu

Fair queuing

Known as: Fair Queueing, Fair queuing (FQ), Fair scheduling 
Fair queuing is a family of scheduling algorithms used in some process and network schedulers. The concept implies a separate data packet queue (or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2009
Review
2009
Due to the rapid growth of wireless data services, the issues of providing different quality of services and fair channel access… 
2008
2008
The buffered crossbar switch architecture has recently gained considerable research attention. In such a switch, besides normal… 
2006
2006
The ongoing evolution towards the generalization of wireless access to multi-service networks stresses on the need for optimizing… 
2004
2004
The token bank fair queuing algorithm (TBFQ) is a novel scheduling algorithm that is suitable for wireless multimedia services… 
2002
2002
Due to the increasing number of users of the Internet, the need for Quality of Service for the internet has increased. This has… 
2002
2002
There are many capacity enhancement techniques in wireless networks. Multiple-input-multiple-output (MIMO) antenna systems… 
2000
2000
Recently, there is a growing interest in wireless packet communications due to the explosive growth in wireless communications… 
2000
2000
Many multimedia scheduling algorithms implement fair sharing of the CPU among processes. However, often a share of the CPU does… 
1999
1999
In a multiprotocol label switching (MPLS) domain, ATM label-switching routers (LSRs) are potentially capable of providing the… 
Highly Cited
1998
Highly Cited
1998
This paper studies the quality of service (QoS) provision problem in noncooperative networks where applications or users are…