Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
In this paper, we study the fundamental problem of allocating the available resources with efficiency and fairness in a wireless CDMA network. In particular, we first introduce an ideal fair scheduling (IFS) scheme. The allocation of resources in IFS is strictly fair. Then we introduce the proportional compensation based fair scheduling (PCFS) algorithm. PCFS distinguishes the services in different application levels. In PCFS, a channel-adaptive resource allocation policy is introduced to improve the system throughput and a compensation model is introduced to achieve fair services. Based on the assignment of PCFS, we propose the traffic aided PCFS (T-PCFS) algorithm that incorporates traffic information into compensation model to achieve better fairness. Extensive simulation results show that our scheme can operate well in wireless CDMA networks.
In this paper, we study the fundamental problem of allocating the available resources with efficiency and fairness in a wireless CDMA network. In particular, we first introduce an ideal fair scheduling (IFS) scheme. The allocation of resources in IFS is strictly fair. Then we introduce the proportional compensation based fair scheduling (PCFS) algorithm. PCFS distinguishes the services in different application levels. In PCFS, a channel-adaptive resource allocation policy is introduced to improve the system throughput and a compensation model is introduced to achieve fair services. Based on the assignment of PCFS, we propose the traffic aided PCFS (T-PCFS) algorithm that incorporates traffic information into compensation model to achieve better fairness. Extensive simulation results show that our scheme can operate well in wireless CDMA networks.
Traffic Aided Fair Scheduling Using Compensation Scheme in Wireless CDMA Networks
01.06.2006
6279934 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Scheduling Algorithms for Downlink Rate Allocation in Heterogeneous CDMA Networks
British Library Online Contents | 2002
|