Fairness Consideration of Scheduling for Real-Time Services in 4G Systems

摘要

In order to achieve higher resource utilization, the call admission control (CAC) will allow the number of connections into the system more than the system capacity can offer. However, the fairness problem will occur when these connections are real-time services. To solve this problem, in this paper, we propose a fair scheduling algorithm named contribution-based scheduling algorithm (CSA) for real-time polling service (rtPS) or guarantee bit rate (GBR) in the uplink direction in the forth-generation (4G) systems. In CSA, a mobile subscriber (MS) gains its contribution credit value at the end of each transmission time interval (TTI), which is based on the contribution of MS to the radio resource scheduling. The base station (BS) schedules the bandwidth according to the credit value. Simulation results show that CSA achieves higher fairness in bandwidth allocation while connection drop rate and queuing delay are also guaranteed as compared to the roundrobin (RR) and early deadline first (EDF) mechanisms.