Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control

We consider the problem of allocating resources (time slots, frequency, power, etc.) at a base station to many competing flows, where each flow is intended for a different receiver. The channel conditions may be time-varying and different for different receivers. It is well-known that appropriately chosen queue-length based policies are throughput-optimal while other policies based on the estimation of channel statistics can be used to allocate resources fairly (such as proportional fairness) among competing users. In this paper, we show that a combination of queue-length-based scheduling at the base station and congestion control implemented either at the base station or at the end users can lead to fair resource allocation and queue-length stability.

[1]  A. G. Pakes,et al.  Some Conditions for Ergodicity and Recurrence of Markov Chains , 1969, Oper. Res..

[2]  D. Vere-Jones.  Markov Chains , 1972, Nature.

[3]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[4]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[5]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

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

[7]  Leandros Tassiulas,et al.  Scheduling and performance limits of networks with constantly changing topology , 1997, IEEE Trans. Inf. Theory.

[8]  Leandros Tassiulas.  Scheduling and performance limits of networks with constantly changing topology , 1997 .

[9]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[10]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[11]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[12]  Richard J. Gibbens,et al.  Resource pricing and the evolution of congestion control , 1999, at - Automatisierungstechnik.

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

[14]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

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

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

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

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

[19]  R. Srikant,et al.  A time scale decomposition approach to adaptive ECN marking , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  Rakesh V. Vohra,et al.  Mathematics of the Internet , 2001 .

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

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

[23]  R. Srikant,et al.  A time-scale decomposition approach to adaptive explicit congestion notification (ECN) marking , 2002, IEEE Trans. Autom. Control..

[24]  David Tse,et al.  Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.

[25]  Fernando Paganini,et al.  A global stability result in network flow control , 2002, Syst. Control. Lett..

[26]  Atilla Eryilmaz,et al.  Stable scheduling policies for fading wireless channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[27]  Ness B. Shroff,et al.  The multi-path utility maximization problem , 2003 .

[28]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[29]  Tansu Alpcan,et al.  A utility-based congestion control scheme for Internet-style networks with delay , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[31]  Nicholas Bambos,et al.  Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems , 2003, Queueing Syst. Theory Appl..

[32]  Marimuthu Palaniswami,et al.  Optimal flow control and routing in multi-path networks , 2003, Perform. Evaluation.

[33]  Harold J. Kushner,et al.  Control of mobile communication systems with time-varying channels via stability methods , 2004, IEEE Transactions on Automatic Control.

[34]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[35]  John T. Wen,et al.  A unifying passivity framework for network flow control , 2004, IEEE Transactions on Automatic Control.

[36]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[37]  R. Srikant,et al.  An adaptive virtual queue (AVQ) algorithm for active queue management , 2004, IEEE/ACM Transactions on Networking.

[38]  Philip A. Whiting,et al.  Convergence of proportional-fair sharing algorithms under general conditions , 2004, IEEE Transactions on Wireless Communications.

[39]  R. Srikant,et al.  Robustness of real and virtual queue-based active queue management schemes , 2005, IEEE/ACM Transactions on Networking.

[40]  Eytan Modiano,et al.  Dynamic power allocation and routing for time-varying wireless networks , 2005 .

[41]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[42]  Atilla Eryilmaz,et al.  Efficient and Fair Scheduling for Wireless Networks , 2005 .

[43]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[44]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.

[45]  Sem C. Borst.  User-level performance of channel-aware scheduling algorithms in wireless data networks , 2005, IEEE/ACM Transactions on Networking.

[46]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..