A novel multi-service scheduling scheme for e-utra

Abstract

In this paper, we present a novel multi-service scheduling scheme while satisfying the principle of multi-service operation in E-UTRA. Instantaneous buffered packet size is used to modify the traditional proportional fair scheduling algorithm for reducing padding probability. Swapping resource between different services users satisfies the principle of multi-service operation and increases multi-user/service diversity. The simulation results demonstrate that the proposed scheme can increase system throughput and fairness among users.