Approximate majorization and fair online load balancing
暂无分享,去创建一个
[1] Ashish Goel,et al. Combining Fairness with Throughput: Online Routing with Multiple Objectives , 2001, J. Comput. Syst. Sci..
[2] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[3] I. Olkin,et al. Inequalities: Theory of Majorization and Its Applications , 1980 .
[4] Yishay Mansour,et al. Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms , 1999, J. Algorithms.
[5] Ingram Olkin,et al. Inequalities: Theory of Majorization and Its Application , 1979 .
[6] Amit Kumar,et al. Fairness measures for resource allocation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[7] R. Jackson. Inequalities , 2007, Algebra for Parents.
[8] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[9] M. O. Lorenz,et al. Methods of Measuring the Concentration of Wealth , 1905, Publications of the American Statistical Association.
[10] Yossi Azar,et al. The competitiveness of on-line assignments , 1992, SODA '92.
[11] Amos Fiat,et al. On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.
[12] Ashish Goel,et al. Combining fairness with throughput: online routing with multiple objectives , 2000, STOC '00.
[13] Amos Fiat,et al. On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.
[14] Baruch Awerbuch,et al. Converging to approximated max-min flow fairness in logarithmic time , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.
[15] Yuval Rabani,et al. Allocating bandwidth for bursty connections , 1997, STOC '97.
[16] Yishay Mansour,et al. Phantom: A Simple and Effective Flow Control Scheme , 1996, SIGCOMM.