MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic
暂无分享,去创建一个
[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] C. Laws. Resource pooling in queueing networks with dynamic routing , 1992, Advances in Applied Probability.
[5] Leandros Tassiulas,et al. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .
[6] F. P. Kelly,et al. Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling , 1993, Queueing Syst. Theory Appl..
[7] Leandros Tassiulas,et al. Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.
[8] Leandros Tassiulas,et al. Adaptive back-pressure congestion control based on local information , 1995, IEEE Trans. Autom. Control..
[9] Jean C. Walrand,et al. Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[10] Nick McKeown,et al. A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .
[11] Jan A. Van Mieghem,et al. Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .
[12] Garrett van Ryzin,et al. Optimal Control of a Multiclass, Flexible Queueing System , 1997, Oper. Res..
[13] Nabil Kahale,et al. Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.
[14] Ruth J. Williams,et al. An invariance principle for semimartingale reflecting Brownian motions in an orthant , 1998, Queueing Syst. Theory Appl..
[15] G. V. van Ryzin,et al. Optimal dynamic scheduling of a general class of parallel-processing queueing systems , 1998, Advances in Applied Probability.
[16] Ruth J. Williams,et al. Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..
[17] Maury Bramson,et al. State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..
[18] J. Harrison. Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies , 1998 .
[19] James Williams. On Dynamic Scheduling of a Parallel Server System With Complete Resource Pooling , 1999 .
[20] J. Michael Harrison,et al. Heavy traffic resource pooling in parallel‐server systems , 1999, Queueing Syst. Theory Appl..
[21] Ronald J. Williams,et al. Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy , 2001 .
[22] R. J. Williams,et al. Dynamic Scheduling of a System with Two Parallel Servers in Heavy Traac with Complete Resource Pooling: Asymptotic Optimality of a Continuous Review Threshold Policy 1 , 1999 .
[23] Mor Armony,et al. Queueing networks with interacting service resources , 1999 .
[24] Ruth J. Williams,et al. On dynamic scheduling of stochastic networks in heavy traffic and some new results for the workload process , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).
[25] 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).
[26] Alexander L. Stolyar,et al. Scheduling for multiple flows sharing a time-varying channel: the exponential rule , 2000 .
[27] 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).
[28] J. Harrison. Brownian models of open processing networks: canonical representation of workload , 2000 .
[29] L. Tassiulas,et al. Allocation of interdependent resources for maximal throughput , 2000 .
[30] J. Dai,et al. Heavy Traffic Limits for Some Queueing Networks , 2001 .
[31] Harold J. Kushner,et al. Control of mobile communications with time-varying channels in heavy traffic , 2002, IEEE Trans. Autom. Control..
[32] Philip A. Whiting,et al. SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.
[33] Alexander L. Stolyar,et al. Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..
[34] S. Ethier,et al. Markov Processes: Characterization and Convergence , 2005 .
[35] A. Stolyar. On the Stability of Multiclass Queueing Networks: A Relaxed SuÆcient Condition via Limiting Fluid Processes , .