A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems
暂无分享,去创建一个
[1] Raj Jain,et al. Congestion control with explicit rate indication , 1995, Proceedings IEEE International Conference on Communications ICC '95.
[2] E. Kalai,et al. OTHER SOLUTIONS TO NASH'S BARGAINING PROBLEM , 1975 .
[3] Danny Raz,et al. Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[4] Dimitris Bertsimas,et al. On the Efficiency-Fairness Trade-off , 2012, Manag. Sci..
[5] Baruch Awerbuch,et al. Greedy distributed optimization of multi-commodity flows , 2007, PODC '07.
[6] Gil Zussman,et al. Max-min Fair Rate Allocation and Routing in Energy Harvesting Networks: Algorithmic Analysis , 2016, Algorithmica.
[7] Shlomi Dolev,et al. Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..
[8] Mihalis Yannakakis,et al. Linear programming without the matrix , 1993, STOC.
[9] Neal E. Young,et al. Sequential and parallel algorithms for mixed packing and covering , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[10] Yossi Azar,et al. Fast load balancing via bounded best response , 2008, SODA '08.
[11] Noam Nisan,et al. A parallel approximation algorithm for positive linear programming , 1993, STOC.
[12] Ashutosh Sabharwal,et al. An Axiomatic Theory of Fairness in Network Resource Allocation , 2009, 2010 Proceedings IEEE INFOCOM.
[13] Amit Kumar,et al. Fairness measures for resource allocation , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[14] Jeffrey M. Jaffe,et al. Bottleneck Flow Control , 1981, IEEE Trans. Commun..
[15] Baruch Awerbuch,et al. Stateless distributed gradient descent for positive linear programs , 2008, SIAM J. Comput..
[16] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[17] Jean C. Walrand,et al. Fair end-to-end window-based congestion control , 2000, TNET.
[18] Zeyuan Allen Zhu,et al. Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel , 2014, SODA.
[19] Marc Teboulle,et al. An $O(1/k)$ Gradient Method for Network Resource Allocation Problems , 2014, IEEE Transactions on Control of Network Systems.
[20] Fernando Paganini,et al. Internet congestion control , 2002 .
[21] Mung Chiang,et al. Multiresource Allocation: Fairness–Efficiency Tradeoffs in a Unifying Framework , 2012, IEEE/ACM Transactions on Networking.
[22] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[23] Peter Ashwood-Smith,et al. Real time alpha-fairness based traffic engineering , 2014, HotSDN.
[24] Zeyuan Allen Zhu,et al. Nearly-Linear Time Positive LP Solver with Faster Convergence Rate , 2015, STOC.
[25] Leandros Tassiulas,et al. Fair allocation of discrete bandwidth layers in multicast networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[26] Fabian Kuhn,et al. The price of locality: exploring the complexity of distributed coordination primitives , 2005 .
[27] Benjamin Hindman,et al. Dominant Resource Fairness: Fair Allocation of Multiple Resource Types , 2011, NSDI.
[28] Jean-Yves Le Boudec,et al. A Unified Framework for Max-Min and Min-Max Fairness With Applications , 2007, IEEE/ACM Transactions on Networking.
[29] Tim Roughgarden,et al. Fully Distributed Algorithms for Convex Optimization Problems , 2007, SIAM J. Optim..
[30] Jochen Könemann,et al. Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems , 2007, SIAM J. Comput..
[31] Nikhil R. Devanur,et al. Tatonnement beyond gross substitutes?: gradient descent to the rescue , 2013, STOC '13.
[32] Éva Tardos,et al. Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[33] Mung Chiang,et al. Stochastic network utility maximisation - a tribute to Kelly's paper published in this journal a decade ago , 2008, Eur. Trans. Telecommun..
[34] Vijay V. Vazirani,et al. Eisenberg-Gale markets: algorithms and structural properties , 2007, STOC '07.
[35] Naveen Garg,et al. On-line end-to-end congestion control , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[36] Jochen Könemann,et al. Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[37] Fernando Paganini,et al. Congestion control for high performance, stability, and fairness in general networks , 2005, IEEE/ACM Transactions on Networking.
[38] Thomas Bonald,et al. Multi-Resource Fairness , 2014, SIGMETRICS.
[39] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[40] Frank Kelly,et al. Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..
[41] Lisa Fleischer,et al. Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..
[42] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[43] Kamesh Munagala,et al. Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints , 2014, STOC.
[44] Nimrod Megiddo,et al. Optimal flows in networks with multiple sources and sinks , 1974, Math. Program..
[45] F. Bourguignon. On the Measurement of Inequality , 2003 .