Analysis of serving discipline algorithms for cellular networks

As user requests arrive randomly in a wireless network, a good serving discipline scheme optimizes the trade-off between resource utilization and quality of service by effectively predicting future demands. In this paper, we analyze research outputs on serving discipline algorithms for cellular networks. The contribution of this paper is two-fold: first we review different serving discipline schemes and we choose the one which we believe is a good scheme. Then we propose an improvement on it and we validate our argument through simulation using the Network Simulator (NS-2).