|
Abstract : |
Fair queueing has long been a popular paradigm for providing bounded delay channel access and separation between flows in wireline networks. However, adapting fair queueing to the wireless domain is non-trivial because of the unique problems in wireless channels such as location-dependent and bursty channel error. In this article, we identify the key issues in wireless fair queueing, define a wireless fair service model, present a generic framework for designing wireless fair queueing algorithms, and explore the solution space within this framework. Using simple examples, we show that some of the wireless fair queueing algorithms currently proposed in literature can achieve wireless fair service. 1, |
