Fairness and Optimal Stochastic Control for Heterogeneous Networks

We consider optimal control for general networks with both wireless and wireline components and time varying channels. A dynamic strategy is developed to support all traffic whenever possible, and to make optimally fair decisions about which data to serve when inputs exceed network capacity. The strategy is decoupled into separate algorithms for flow control, routing, and resource allocation, and allows each user to make decisions independent of the actions of others. The combined strategy is shown to yield data rates that are arbitrarily close to the optimal operating point achieved when all network controllers are coordinated and have perfect knowledge of future events. The cost of approaching this fair operating point is an end-to-end delay increase for data that is served by the network.

[1]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Devavrat Shah,et al.  Delay bounds for approximate maximum weight matching algorithms for input queued switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Ness B. Shroff,et al.  Opportunistic power scheduling for dynamic multi-server wireless systems , 2006, IEEE Transactions on Wireless Communications.

[4]  R. Srikant,et al.  Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control , 2007, TNET.

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

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

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

[8]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

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

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

[11]  Peter Marbach,et al.  Downlink resource allocation and pricing for wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[12]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .

[13]  H. Kushner,et al.  Asymptotic Properties of Proportional-Fair Sharing Algorithms , 2002 .

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

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

[16]  Leandros Tassiulas,et al.  Exploiting wireless channel State information for throughput maximization , 2004, IEEE Trans. Inf. Theory.

[17]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation for wireless networks , 2001 .

[18]  Edmund M. Yeh,et al.  Throughput and delay optimal resource allocation in multiaccess fading channels , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[19]  Michael J. Neely.  Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks , 2006, IEEE J. Sel. Areas Commun..

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

[21]  Marco Ajmone Marsan,et al.  Bounds on average delays and queue size averages and variances in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[23]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[24]  Mung Chiang.  Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control , 2005 .

[25]  R. Srikant,et al.  Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[26]  R. Wets,et al.  Stochastic programming , 1989 .

[27]  Nabil Kahale,et al.  Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.

[28]  Stephen P. Boyd,et al.  QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[30]  Hao Che,et al.  Decentralized optimal traffic engineering in connectionless networks , 2005, IEEE Journal on Selected Areas in Communications.

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

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

[33]  Michael L. Honig,et al.  Design and analysis of downlink utility-based schedulers , 2002 .

[34]  A. Banerjee.  Convex Analysis and Optimization , 2006 .

[35]  Michael J. Neely.  Energy Optimal Control for Time-Varying Wireless Networks , 2006, IEEE Trans. Inf. Theory.

[36]  B. Krishnamachari,et al.  Analysis of energy-efficient, fair routing in wireless sensor networks through non-linear optimization , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[37]  Peter Marbach,et al.  Priority service and max-min fairness , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[38]  R. Johari,et al.  Network resource allocation and a congestion game: the single link case , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[39]  Eytan Modiano,et al.  Tradeoffs in Delay Guarantees and Computation Complexity for Packet Switches NN , 2002 .

[40]  Ness B. Shroff,et al.  Downlink power allocation for multi-class CDMA wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[41]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

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

[43]  Michael J. Neely,et al.  Dynamic power allocation and routing for satellite and wireless networks with time varying channels , 2003 .

[44]  Eytan Modiano,et al.  Power allocation and routing in multibeam satellites with time-varying channels , 2003, TNET.

[45]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[46]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..