2008•Unpublished venueRequires access

One novel multi-services scheduling algorithm in WCDMA system

Cao Jianglian, Pei Tingrui

Open publisher page 3 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Quality of service, W-CDMA, Scheduling (production processes), Maximum throughput scheduling, Computer network, Fair-share scheduling, Dynamic priority scheduling

Related papers

Back to paper searchBrowse research topicsOriginal source
One novel multi-services scheduling algorithm in WCDMA system — Research Paper | ScholarLens