One novel multi-services scheduling algorithm in WCDMA system
Cao Jianglian, Pei Tingrui
Abstract
Cao Jianglian, Pei Tingrui
Abstract
Designing scheduling algorithm in multi-services WCDMA system must take channel condition into account, and differentiate the service to guarantee the demand of QoS, avoid the user’s starvation, meanwhile try to improve the throughput and the fairness of the scheduling in the system as much as possible. Therefore, on the basis of PFS, we proposed a service differentiated proportional fairness scheduling algorithm (CQSSD-PFS) based on C/I, QoS, and starvation weight. CQSSD-PFS also introduced realtime service and system capacitance compensate model. Simulation results showed that effectively insured all kinds of service’s short-term and long-term fairness and the throughput of the system.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Designing scheduling algorithm in multi-services WCDMA system must take channel condition into account, and differentiate the service to guarantee the demand of QoS, avoid the user’s starvation, meanwhile try to improve the throughput and the fairness of the scheduling in the system as much as possible. Therefore, on the basis of PFS, we proposed a service differentiated proportional fairness scheduling algorithm (CQSSD-PFS) based on C/I, QoS, and starvation weight. CQSSD-PFS also introduced realtime service and system capacitance compensate model. Simulation results showed that effectively insured all kinds of service’s short-term and long-term fairness and the throughput of the system.
Key concepts: Computer science, Quality of service, W-CDMA, Scheduling (production processes), Maximum throughput scheduling, Computer network, Fair-share scheduling, Dynamic priority scheduling