A Survey of Scheduling Theory in Wireless Data Networks
暂无分享,去创建一个
[1] Rafail Ostrovsky,et al. Adaptive packet routing for bursty adversarial traffic , 1998, STOC '98.
[2] M. Andrews,et al. Joint Optimization of Scheduling and Congestion Control in Communication Networks , 2006, 2006 40th Annual Conference on Information Sciences and Systems.
[3] M. Andrews,et al. Scheduling Over Nonstationary Wireless Channels With Finite Rate Sets , 2006, IEEE/ACM Transactions on Networking.
[4] Eytan Modiano,et al. Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.
[5] Leandros Tassiulas,et al. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .
[6] Matthew Andrews,et al. Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..
[7] 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).
[8] H. Kushner,et al. Asymptotic Properties of Proportional-Fair Sharing Algorithms , 2002 .
[9] Alexander L. Stolyar,et al. Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..
[10] Jon M. Kleinberg,et al. Stability of load balancing algorithms in dynamic adversarial systems , 2002, STOC '02.
[11] Alexander L. Stolyar,et al. Optimal utility based multi-user throughput allocation subject to throughput constraints , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[12] Ness B. Shroff,et al. A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.
[13] Alexander L. Stolyar,et al. On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..
[14] Eytan Modiano,et al. Power and server allocation in a multi-beam satellite with time varying channels , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[15] J. M. Holtzman. CDMA forward link waterfilling power control , 2000, VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026).
[16] Rajeev Agrawal,et al. Optimality of Certain Channel Aware Scheduling Policies , 2002 .
[17] Baruch Awerbuch,et al. Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.
[18] Christian Scheideler,et al. Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[19] Matthew Andrews,et al. Maximizing profit in overloaded networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[20] Lisa Zhang,et al. Routing and scheduling in multihop wireless networks with time-varying channels , 2004, SODA '04.
[21] Matthew S. Grob,et al. CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..
[22] Nabil Kahale,et al. Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.
[23] M. Andrews,et al. Instability of the proportional fair scheduling algorithm for HDR , 2004, IEEE Transactions on Wireless Communications.
[24] R. Srikant,et al. Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control , 2005, IEEE/ACM Transactions on Networking.
[25] Lisa Zhang,et al. Scheduling over a time-varying user-dependent channel with applications to high-speed wireless data , 2005, JACM.
[26] Leandros Tassiulas,et al. Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.