Delay-Optimal Server Allocation in Multiqueue Multiserver Systems With Time-Varying Connectivities

This paper considers the problem of optimal server allocation in a time-slotted system with N statistically symmetric queues and K servers when the arrivals and channels are stochastic and time-varying. In this setting, we identify two classes of "desirable" policies with potentially competing goals of maximizing instantaneous throughput versus balancing the load. Via an example, we show that these goals, in general, can be incompatible, implying an empty intersection between the two classes of policies. On the other hand, we establish the existence of a policy achieving both goals when the connectivities between each queue and each server are random and either "ON" or "OFF". We use dynamic programming (DP) and properties of the value function to establish the delay optimality of a policy, which, at each time-slot, simultaneously maximizes the instantaneous throughput and balances the queues.

[1]  Khaled Ben Letaief,et al.  Multiuser OFDM with adaptive subcarrier, bit, and power allocation , 1999, IEEE J. Sel. Areas Commun..

[2]  Mingyan Liu,et al.  Optimal bandwidth allocation in a delay channel , 2006, IEEE Journal on Selected Areas in Communications.

[3]  S. Musy.  A delay optimal policy for symmetric broadcast channels , 2006, 2006 International Conference on Communication Technology.

[4]  László Lovász,et al.  Semi-matchings for bipartite graphs and load balancing , 2003, J. Algorithms.

[5]  Ger Koole,et al.  Monotonicity in Markov Reward and Decision Chains: Theory and Applications , 2007, Found. Trends Stoch. Syst..

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

[7]  Ta R A Ja.  EXPECTED MAKESPAN MINIMIZATION ON IDENTICAL MACHINES IN TWO INTERCONNECTED QUEUES , 2001 .

[8]  Demosthenis Teneketzis,et al.  ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES , 2000 .

[9]  Eitan Altman,et al.  Discrete-Event Control of Stochastic Networks - Multimodularity and Regularity , 2004, Lecture notes in mathematics.

[10]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[11]  Kurt Mehlhorn,et al.  LEDA: a platform for combinatorial and geometric computing , 1997, CACM.

[12]  Kurt Mehlhorn,et al.  The LEDA Platform of Combinatorial and Geometric Computing , 1997, ICALP.

[13]  Tara Javidi,et al.  Resource Allocation in OFDMA with Time-Varying Channel and Bursty Arrivals , 2007, IEEE Communications Letters.

[14]  Murray Hill,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004 .

[15]  TeneketzisDemosthenis,et al.  ON THE OPTIMALITY OF AN INDEX RULE IN MULTICHANNEL ALLOCATION FOR SINGLE-HOP MOBILE NETWORKS WITH MULTIPLE SERVICE CLASSES , 2000 .

[16]  B. Hajek.  Optimal control of two interacting service stations , 1982, 1982 21st IEEE Conference on Decision and Control.

[17]  Eytan Modiano,et al.  Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity , 2007, IEEE Transactions on Information Theory.

[18]  Tara Javidi,et al.  Delay Optimal Transmission Policy in a Wireless Multiaccess Channel , 2008, IEEE Transactions on Information Theory.

[19]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[20]  N. Harris.  STOCHASTIC CONTROL , 2011 .

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

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

[23]  Ger Koole.  Convexity in tandem queues , 1999 .