Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,123,622 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.
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
,
Y. 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
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
,
W. 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
Soft QoS provisioning using the token bank fair queuing scheduling algorithm
W. K. Wong
,
H. Zhu
,
Victor C. M. Leung
IEEE wireless communications
2003
Corpus ID: 459534
Future-generation wireless packet networks will support multimedia applications with diverse QoS requirements. Much of the…
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
2001
2001
Efficient fair queuing with decoupled delay-bandwidth guarantees
F. Agharebparast
,
Victor C. M. Leung
GLOBECOM'01. IEEE Global Telecommunications…
2001
Corpus ID: 15587929
In this paper we introduce a new scheduling system with decoupled delay bound and bandwidth allocation guarantees. It is based on…
Expand
2000
2000
<italic>W</italic><supscrpt>2</supscrpt><italic>F</italic><supscrpt>2</supscrpt><italic>Q</italic>: packet fair queuing in wireless packet networks
Yung Yi
,
Yongho Seok
,
Taekyoung Kwon
,
Yanghee Choi
,
Junseok Park
IEEE International Symposium on a World of…
2000
Corpus ID: 8933418
Recently, there is a growing interest in wireless packet communications due to the explosive growth in wireless communications…
Expand
2000
2000
QoS provisioning for wireless IP networks with multiple classes through flexible fair queuing
T. Janevski
,
B. Spasenovski
Global Communications Conference
2000
Corpus ID: 21974311
We propose a scheduling algorithm, a wireless class-based flexible fair queuing (WCFQ), to support QoS demands of different…
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