Scheduling of a Generalized Switch: Heavy Traffic Regime

We consider a generalized switch model, which is a natural model of scheduling multiple data flows over a shared time-varying wireless environment. It also includes as special cases the input-queued cross-bar switch model, and a discrete time version of a parallel server queueing system.

[1]  W. Whitt.  Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.

[2]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[3]  M. Reiman.  A multiclass feedback queue in heavy traffic , 1988 .

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

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

[6]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[7]  Jan A. Van Mieghem,et al.  Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .

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

[9]  Ruth J. Williams,et al.  An invariance principle for semimartingale reflecting Brownian motions in an orthant , 1998, Queueing Syst. Theory Appl..

[10]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

[11]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[12]  J. Harrison.  Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies , 1998 .

[13]  James Williams.  On Dynamic Scheduling of a Parallel Server System With Complete Resource Pooling , 1999 .

[14]  J. Michael Harrison,et al.  Heavy traffic resource pooling in parallel‐server systems , 1999, Queueing Syst. Theory Appl..

[15]  Mor Armony,et al.  Queueing networks with interacting service resources , 1999 .

[16]  Balaji Prabhakar,et al.  The throughput of data switches with and without speedup , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[17]  J. Harrison.  Brownian models of open processing networks: canonical representation of workload , 2000 .

[18]  Harold J. Kushner,et al.  Control of mobile communications with time-varying channels in heavy traffic , 2002, IEEE Trans. Autom. Control..

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