Improving service rate granularity by dual-rate session grouping in cell-based schedulers

In this paper we propose a scheme referred to as dual-rate session grouping to improve the service rate granularity for cell-based schedulers. In this scheme a session is split into two subsessions to provide the average service rate that a user requires. By applying dual-rate session grouping, the utilization of bandwidth and fairness among users can be improved, while the complexity of the scheduling algorithm remains the same as the conventional scheme. The overall computational complexity of the dual-rate session grouping does not increase with the rate granularity that is only limited by the available memory space. Several implementation issues are also presented in this paper