Instability of the proportional fair scheduling algorithm for HDR

In this letter, we study the Proportional Fair scheduler that has been proposed for scheduling in the high data rate (HDR) wireless data system. We consider a single basestation transmitting to a set of mobile users. In each time slot, the scheduler has to decide on a mobile to which it will transmit data. The decision is based on information that the basestation receives about the time-varying channels between itself and the mobiles. We focus on deciding whether or not Proportional Fair is stable in a situation with finite queues and a data arrival process. That is, we wish to decide if Proportional Fair keeps all queues bounded whenever this is feasible. There are, in fact, multiple versions of Proportional Fair, depending on how it treats small queues. In this letter, we consider six different versions and show that all are unstable for one simple example.

[1]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[2]  Alexander L. Stolyar,et al.  Scheduling for multiple flows sharing a time-varying channel: the exponential rule , 2000 .

[3]  Philip A. Whiting,et al.  Cdma data qos scheduling on the forward link with variable channel conditions , 2000 .

[4]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[5]  A. Jalali,et al.  Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).

[6]  Sem C. Borst,et al.  Dynamic rate control algorithms for HDR throughput optimization , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Alexander L. Stolyar,et al.  Scheduling algorithms for a mixture of real-time and non-real-time data in HDR , 2001 .

[8]  Matthew S. Grob,et al.  CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..

[9]  R. Srikant,et al.  Scheduling Real-Time Traffic With Deadlines over a Wireless Channel , 2002, Wirel. Networks.

[10]  Lisa Zhang,et al.  Scheduling over a time-varying user-dependent channel with applications to high speed wireless data , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..