Asymptotic Properties of Proportional-Fair Sharing Algorithms: Extensions of the Algorithm
暂无分享,去创建一个
[1] Hal L. Smith,et al. Monotone Dynamical Systems: An Introduction To The Theory Of Competitive And Cooperative Systems (Mathematical Surveys And Monographs) By Hal L. Smith , 1995 .
[2] Harold J. Kushner,et al. Stochastic Approximation Algorithms and Applications , 1997, Applications of Mathematics.
[3] Matthew S. Grob,et al. CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..
[4] Jack M. Holtzman,et al. Asymptotic analysis of proportional fair algorithm , 2001, 12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598).
[5] Rajeev Agrawal,et al. Optimality of Certain Channel Aware Scheduling Policies , 2002 .
[6] David Tse,et al. Opportunistic beamforming using dumb antennas , 2002, IEEE Trans. Inf. Theory.
[7] H. Kushner,et al. Asymptotic Properties of Proportional-Fair Sharing Algorithms , 2002 .
[8] User-level performance of channel-aware scheduling algorithms in wireless data networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[9] Philip A. Whiting,et al. Convergence of proportional-fair sharing algorithms under general conditions , 2004, IEEE Transactions on Wireless Communications.
[10] Sem C. Borst. User-level performance of channel-aware scheduling algorithms in wireless data networks , 2005, IEEE/ACM Transactions on Networking.