Abstract: Chapter 8 covers a qualitative and quantitative analysis of different fair queueing scheduling algorithms in wireless networks. Because of the time-varying nature of the wireless channel in a practical situation, burst errors are the norm rather than an exception. Thus, it is widely believed that a good scheduling algorithm should take into consideration and exploit the variations of channel conditions among the mobile devices. In this regard, this chapter describes a new notion of fairness in which a scheduler is fair with respect to the throughput normalized by the channel capacity. Using this new fairness definition, Chapter 8 also describes a new scheduling algorithm called CAFQ (Channel Adaptive Fair Queueing).
Publication Year: 2006
Publication Date: 2006-02-15
Language: en
Type: other
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot