Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,605,519 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
26 relations
Active queue management
Bufferbloat
CoDel
Deficit round robin
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Novel Techniques for Fair Rate Control in Wireless Mesh Networks
Mohiuddin Ahmed
,
K. M. Arifur Rahman
2012
Corpus ID: 16181091
IEEE 802.11 based wireless mesh networks can exhibit severe fairness problem by distributing throughput among different flows…
Expand
2011
2011
VoIP Performance Over different service Classes Under Various Scheduling Techniques
A. Karim
,
Bahauddin
2011
Corpus ID: 165154387
IP Telephony application or Voice over Internet Protocol (VoIP) is one of the most promising services that can be implemented…
Expand
Review
2009
Review
2009
Packet Fair Queuing Algorithms for Wireless Networks
You-Chiun Wang
,
Yu-Chee Tseng
2009
Corpus ID: 10641266
Due to the rapid growth of wireless data services, the issues of providing different quality of services and fair channel access…
Expand
2005
2005
An Approximate Analysis of Two Class WFQ Systems
G. Horváth
,
M. Telek
2005
Corpus ID: 31323626
dary generating functions. This gives the difficulty of this approach, since it needs Wiener-Hopf factorization. In this paper we…
Expand
2004
2004
Token bank fair queuing: a new scheduling algorithm for wireless multimedia services
W. K. Wong
,
Helen Tang
,
Victor C. M. Leung
International Journal of Communication Systems
2004
Corpus ID: 2610373
The token bank fair queuing algorithm (TBFQ) is a novel scheduling algorithm that is suitable for wireless multimedia services…
Expand
2004
2004
Efficient Packet Scheduling Using Channel Adaptive Fair Queueing in Distributed Mobile Computing Systems
Li Wang
,
Yu-Kwong Kwok
,
Wing C. Lau
,
V. Lau
Mob. Networks Appl.
2004
Corpus ID: 16011630
In a distributed mobile computing system, an efficient packet scheduling policy is a crucial component to achieve a high…
Expand
2003
2003
The directional p-median problem with applications to traffic quantization and multiprocessor scheduling
L. E. Jackson
,
G. Rouskas
,
Matthias F. Stallmann
2003
Corpus ID: 118835229
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the…
Expand
1999
1999
Performance issues in VC-merge capable switches for multiprotocol label switching
I. Widjaja
,
A. Elwalid
IEEE J. Sel. Areas Commun.
1999
Corpus ID: 26749705
In a multiprotocol label switching (MPLS) domain, ATM label-switching routers (LSRs) are potentially capable of providing the…
Expand
1999
1999
CHOKe-A simple approach for providing Quality of Service through stateless approximation of fair queueing
Rong Pan
,
B. Prabhakar
1999
Corpus ID: 8513981
We consider the problem of providing a fair bandwidth allocation to each of n flows that share an outgoing link at a congested…
Expand
1998
1998
Eligible Start-Time Fair Queuing: A New Fair Queuing Policy and its Analysis with a Stochastic Comparison Approach
O. Abuamsha
,
N. Pekergin
1998
Corpus ID: 2816057
We present a new Fair Queuing policy adapted to low-bandwidth flows, and preventing discrepancy which is encountered under almost…
Expand