Optimality of Certain Channel Aware Scheduling Policies

With an abstraction of serving rate-adaptive sources on a broadcast-type wireless channel as a utility maximization problem, it is shown how one can design many intuitive online scheduling policies based upon the feedback that one obtains at the scheduler. Using a stochastic approximation argument it is then shown that the constructed algorithms converge to optimal solutions of the utility maximization problem over different sets which critically depend on the quality of the feedback information.

[1]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

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

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

[4]  James A. Bucklew,et al.  Mixed time scale recursive algorithms , 2001, IEEE Trans. Signal Process..

[5]  Richard J. La,et al.  Class and channel condition based weighted proportional fair scheduler , 2001 .

[6]  Harish Viswanathan,et al.  The impact of antenna diversity in packet data systems with scheduling , 2004, IEEE Transactions on Communications.

[7]  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).

[8]  William A. Sethares,et al.  Weak convergence and local stability properties of fixed step size recursive algorithms , 1993, IEEE Trans. Inf. Theory.

[9]  Ness B. Shroff,et al.  A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.

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

[11]  Richard J. La,et al.  Class and channel condition-based scheduler for EDGE/GPRS , 2001, SPIE ITCom.

[12]  Edward W. Knightly,et al.  Opportunistic fair scheduling over multiple wireless channels , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[14]  Ness B. Shroff,et al.  Opportunistic transmission scheduling with resource-sharing constraints in wireless networks , 2001, IEEE J. Sel. Areas Commun..

[15]  Rajeev Agrawal,et al.  Scheduling in multimedia CDMA wireless networks , 2003, IEEE Trans. Veh. Technol..

[16]  David Tse,et al.  Optimal power allocation over parallel Gaussian broadcast channels , 1997, Proceedings of IEEE International Symposium on Information Theory.

[17]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[18]  Andrea J. Goldsmith,et al.  Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity , 2001, IEEE Trans. Inf. Theory.

[19]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[20]  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).

[21]  D. Kraft.  Nonlinear system analysis by direct collocation , 1987 .

[22]  Rajeev Agrawal,et al.  Scheduling in multimedia wireless networks , 2001 .

[23]  Songwu Lu,et al.  Fair queuing in wireless networks: issues and approaches , 1999, IEEE Wirel. Commun..

[24]  Antti Toskala,et al.  WCDMA for UMTS: Radio Access for Third Generation Mobile Communications , 2000 .

[25]  Thomas G. Kurtz,et al.  Averaging for martingale problems and stochastic approximation , 1992 .

[26]  Satish K. Tripathi,et al.  Enhancing throughput over wireless LANs using channel state dependent packet scheduling , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[27]  Philip A. Whiting,et al.  Dynamic bandwidth allocation algorithms for high-speed data wireless networks , 1998, Bell Labs Technical Journal.

[28]  Michael L. Honig,et al.  Delay-sensitive packet scheduling in wireless networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..