A unified architecture for the design and evaluation of wireless fair queueing algorithms
Wireless Networks - Selected Papers from Mobicom'99
| Hi-index | 0.00 |
Only best-effort traffic was supported by traditional packet switching networks, but newer applications need network services that allow an end-client to transport data with performance guarantees. The choice of packet-scheduling algorithm used at switching nodes is crucial in providing Quality of Service (QoS). This paper proposes a downlink packet scheduling algorithm for QoS provisioning in High Speed Downlink Packet Access (HSDPA) based UMTS networks. In HSDPA, a single logical channel is shared amongst multiple contending users. Besides better link utilization, scheduling disciplines seek to achieve fair allocation of this shared resource. However, these two criteria can potentially be in conflict. The scheduling algorithm proposed in this paper, Wireless Fair High Speed Scheduling, addresses this conflict. The basic idea is to allocate the wireless channel fairly amongst users, even during short time scales, according to their data rate requirements. Simulation results show that the proposed scheduling algorithm provides better link utilization, as well as long-term and short-term fairness amongst users, even under heavy load conditions.