R. Agrawal and S. V. , Optimalily of certain channrlaware scheduling policies, Proe. 40th Annual Allerton Conf Cowmun . Control.. Comp, pp.1532-1541, 2002.

D. K. Andrews, ~. K. Stolyar, R. Vtjarakumar, and P. Whiting, Scheduling in a queueing system with asynchronously varying service mte~

F. Baccelli and . P. Bremaud, Rernents ofQueuerng Theow, 2003.

N. B&rrlc, Inequalities for stta.hustic models via supermodular orderings. Commun. Star -Srm. U o d e l s 13, pp.181-201, 1997.

N. Si-puerle and . Rolski, A monotonicity result for the workload m Markovian modulated queues. 3, Appl. Prob, vol.7, issue.35, pp.741-747, 1998.

B. , D. , and T. Proutibre, Wireless downlink channels: user performance and cell dimensioning, 2003.

S. C. Boat and . Whiting, User-level performance of channel-aware scheduling algorithms in w i r e k s data networks wnamic channel-smdiw scheduling algorithms for wireless data throughput optimization. IEEE ?'ram IM Tech, Proc. Infmom ZW3. 191 B, pp.569-586, 2003.

C. S. Io-]-chang, X. Chao, and . M. Pincdo, Monotonicity results for queues with doubly stochastic Poisson arrivals: Ross's conjecture, Advances in Applied Probability, vol.27, issue.01, pp.210-228, 1991.
DOI : 10.2307/3214250

.. E. 1111-chapontiere, P. J. Black, . Hollrman, . Lhl, and D. N. Tse, Transminer directed code division multiple access system using path diversity to equitably maximize thmughput, p.449490

J. G. Dai, On positive H-s recurrence of multiclass queueing, 1995.

I. M. Grossglauser and . D. Tse, Mobility increases the capacity of ad hoc wireless networks, IEEE4ACA4 Trans, pp.10-477186, 2002.

J. Hollrmun, CDMA forward link watcrfilling power EOIIUOI, Pmc. IEEF i T C 2000 Spring Conf, pp.1663-1667, 2000.

. Hu.-'i, Comparisons of dependence for stvtiunw Markov processes, Pan. S. Pmb. Eng. I$ Sc, vol.14, pp.299-315, 2000.

. A. Jalali, . R. Padomi, R. Pankaj, and F. P. Kelly, Data throughput of CDMA- HDR a high efficiency-high data rate pcnonal communiuatiun wireless sptem, Proc. IEEE 1171 Reverribilrr). and Stmhashc iVeworks, 1979.

H. J. Kushner and P. Whiting, i\s)mptotic propenies of Pmportional Fair sharing algorithms, Pioc. 40th Annual Allerton Conf Commun Control.. Coop, pp.1051-1059, 2002.

X. Liu, E. K. Chong, and . N. Shroff, A fi-amework for opporhlnistic scheduling in wireless networks, Comp. Nefw, vol.41, pp.451-474, 2003.

. A. Moller and D. S-t-y-e, Cornparison Afethods fo? Stochastic Alodels and Risk, 2002.

A. Proutiire, Imsnsinvrly and stmhostic comparisons in quruamg networks

. S. Shakkollai and A. L. Stolyar, Scheduling algorithms fora miflure of mal-timr and non-real time data in HDR, Pmc. ITC-I i, pp.793-804, 2001.

A. L. Stolyar, On the asymptotic optinlalily of the gradient scheduling algorithm for multi-user throughput dtocation

. A. L2sl-tcher, Inequalities for distfibutions with xiwn marginalS. 10W Spnng Con!, pp.1854-1858, 1980.

V. Tsibonis and G. L. Tussiulas, Exploiting wireless channel state information for throughmm maximization, Pmc. Infoo m 7w3