A Packet Fair Queueing Algorithm for CDMA2000 1xEV-DV Networks

Providing packet fair queueing is difficult in CDMA2000 1xEV-DV networks since there are multiple sessions associated with each user and the packets from each session can be served by multiple code channels. Essentially, this is a multi-session multi-server problem, which so far has received little research. The above problem becomes more complicated in CDMA2000 1xEV-DV networks, where Adaptive Modulation and Coding (AMC) schemes are employed for a higher network resource utilization. This means that the underlying service data rate of each code channel will be dynamically changing with the current perceived channel quality and the current number of available code channels. However, current research on packet fair queueing in wireless networks mostly use fixed service data rates. Therefore, how to design a packet fair queueing scheme with multiple servers and time-varying service data rates is very important for QoS provisioning in CDMA2000 1xEV-DV networks. In this paper, we propose a new packet fair queueing algorithm, where it seamlessly integrates the fair queueing with the CDMA2000 1xEV-DV AMC scheme. Both theoretical analyses and simulation results show that the proposed fair queueing algorithm can provide fairness among different sessions as well as satisfy their QoS requirements.