Due to the rapid growth of wireless data services, the issues of providing different quality of
services and fair channel access have become more and more crucial. In wireline networks …

Fair queuing has long been a popular paradigm for providing bounded delay channel
access and separation between flows in wireline networks. However, adapting fair queuing …

Chapter 8 identifies key issues in wireless fair queuing, defines a wireless fair service
model, and surveys algorithms. Fairness implies that the allocated channel bandwidth is in …

Fair queueing in the wireless domain poses significant challenges due to the unique issues
in the wireless channel such as location-dependent and bursty channel error. In this paper …

Abstract Parames~ varan Ramana. tllan Pratbinla t\graIval Dept. of Elect. & Comp. Engr. I [)
ter]~ et. ArcIl. Research Lab University of Wisconsin Bellcore, hIorristotvn Nladison, WI …

In order to provide quality of service to wireless networks, a number of wireless fair queueing
algorithms have recently been proposed. They, however, require perfect channel prediction …

Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not
addressed effectively by most contemporary wireline fair scheduling algorithms because of …

Fair queueing is a service scheduling discipline to pursue the fairness among users in
packet communication networks. Many fair queueing algorithms, however, have problems of …

Wireless fair queueing algorithms have been extensively studied recently. However, a major
drawback in existing approaches is that the channel model is overly simplified-a two states …

Wireless channels are characterized by more serious bursty and location-dependent errors.
Many packet scheduling algorithms have been proposed for wireless networks to guarantee …