Fair scheduling in wireless networks with controlled compensation for faulty channels

There has been a heavy interest in generalized processor sharing (GPS) based fair queuing algorithms modeled and implemented on wireline networks [1, 2]. The core reason for this is that most wired networks (ethernet, optical networks) have channels which are very rarely prone to errors. In other words, wireline channels most often are able to transmit what is intended with very less probability of error and channel malfeasance. Wireless channels on the other hand are very bursty in nature besides having higher chances of channel malfeasance compared to wireline channels. Most wireless fair scheduling adaptations work on the basis that flows that are error free occupies the complete bandwidth at any point of time and those that are faulty are allowed to reclaim later once channels recover [1, 2, 5]. In this paper we propose a wireless fair scheduling model where channels that reclaim, for compensation are controlled so that redundant data does not flow on the network for long.