IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Adapting packet fair queueing algorithms to wireless networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A slotted CDMA protocol with BER scheduling for wireless multimedia networks
IEEE/ACM Transactions on Networking (TON)
Multiclass priority fair queuing for hybrid wired/wireless quality of service support
WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
Fair scheduling in wireless packet networks
IEEE/ACM Transactions on Networking (TON)
A unified architecture for the design and evaluation of wireless fair queueing algorithms
Wireless Networks - Selected Papers from Mobicom'99
Fair Scheduling Algorithm for Wireless Packet Networks
ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
T2-fair: a two-tiered time and throughput fair scheduler for multi-rate WLANs
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Delay-bound preservation through packet scheduling at wireless access point nodes
Mobility '06 Proceedings of the 3rd international conference on Mobile technology, applications & systems
Performance comparison of scheduling algorithms in network mobility environment
Computer Communications
An adaptive bluetooth packet selection and scheduling scheme in interference environments
Computer Communications
Hi-index | 0.00 |
In a distributed mobile computing system, an efficient packet scheduling policy is a crucial component to achieve a high utilization of the precious bandwidth resources while satisfying users' QoS (quality of service) demands. An important class of scheduling techniques, namely, the 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-state channel (good or bad) is assumed. While it is relatively easy to analyze the system using such a simple model, the algorithms so designed are of a limited applicability in a practical environment, in which the level of burst errors is time-varying and can be exploited by using channel adaptive coding and modulation techniques. In this paper, we first argue that the existing algorithms cannot cater for a more realistic channel model and the traditional notion of fairness is not suitable. We then propose a new notion of fairness, which bounds the actual throughput normalized by channel capacity of any two data connections. Using the new fairness definition, we propose a new fair queueing algorithm called CAFQ (Channel Adaptive Fair Queueing), which, as indicated in our numerical studies, outperforms other algorithms in terms of overall system throughput and fairness among error prone connections.