Randomized oblivious integral routing for minimizing power cost
暂无分享,去创建一个
Jie Wu | Zhiyong Liu | Fa Zhang | Yangguang Shi | Jie Wu | Yangguang Shi | Fa Zhang | Zhiyong Liu
[1] Leslie G. Valiant,et al. A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..
[2] Mohammad,et al. On Matrix Norms , 1989 .
[3] J. Jensen. Sur les fonctions convexes et les inégalités entre les valeurs moyennes , 1906 .
[4] Carl D. Meyer,et al. Matrix Analysis and Applied Linear Algebra , 2000 .
[5] Noga Alon,et al. Eigenvalues and expanders , 1986, Comb..
[6] Hong Liu,et al. Energy proportional datacenter networks , 2010, ISCA.
[7] Harald Räcke,et al. Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.
[8] Lei Shi,et al. Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.
[9] Lisa Zhang,et al. Routing for Power Minimization in the Speed Scaling Model , 2012, IEEE/ACM Transactions on Networking.
[10] Navin Goyal,et al. Dynamic vs. Oblivious Routing in Network Design , 2010, Algorithmica.
[11] R. Salem,et al. A Convexity Theorem. , 1948, Proceedings of the National Academy of Sciences of the United States of America.
[12] Lisa Zhang,et al. Bounds on fiber minimization in optical networks with fixed fiber capacity , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[13] akXk. IMPROVED BOUNDS ON BELL NUMBERS AND ON MOMENTS OF SUMS OF RANDOM VARIABLES , 2010 .
[14] Matthew Andrews,et al. Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke Decompositions , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[15] Harald Räcke,et al. Oblivious Routing for the Lp-norm , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[16] Mohammad Taghi Hajiaghayi,et al. Oblivious network design , 2006, SODA '06.
[17] Evripidis Bampis,et al. Energy-efficient scheduling and routing via randomized rounding , 2013, Journal of Scheduling.
[18] Jessica L. Heier. Multicommodity Flows , 2007 .
[19] Peter G. Doyle,et al. Random Walks and Electric Networks: REFERENCES , 1987 .
[20] B. Dhoedt,et al. Multi-Granular Optical Cross-Connect: Design, Analysis, and Demonstration , 2009, IEEE/OSA Journal of Optical Communications and Networking.
[21] Aditya Bhaskara,et al. Approximating matrix p-norms , 2010, SODA '11.
[22] Maxim Sviridenko,et al. Solving Optimization Problems with Diseconomies of Scale via Decoupling , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[23] G. Lawler,et al. Mixing times and e p bounds for oblivious routing , 2009 .
[24] Lachlan L. H. Andrew,et al. Power-Aware Speed Scaling in Processor Sharing Systems , 2009, IEEE INFOCOM 2009.
[25] G. O. Thorin. Convesity theorems generalizing those of M. Riesz and Hadamard with some applications , 1948 .
[26] Petar Maymounkov,et al. Electric Routing and Concurrent Flow Cutting , 2009, ISAAC.
[27] Satish Rao,et al. A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.
[28] Haitao Wu,et al. BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.
[29] Kirk Pruhs,et al. Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling , 2011, WAOA.
[30] Harald Räcke. Survey on Oblivious Routing Strategies , 2009, CiE.
[31] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[32] Yair Bartal,et al. Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[33] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[34] M. Riesz. Sur les maxima des formes bilinéaires et sur les fonctionnelles linéaires , 1926 .
[35] Thomas P. Hayes,et al. Minimizing average latency in oblivious routing , 2008, SODA '08.
[36] Zhiyong Liu,et al. Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost , 2014, FAW.
[37] Manish Gupta,et al. Power-Aware Microarchitecture: Design and Modeling Challenges for Next-Generation Microprocessors , 2000, IEEE Micro.
[38] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[39] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[40] R.S. Tucker,et al. The Role of Optics and Electronics in High-Capacity Routers , 2006, Journal of Lightwave Technology.
[41] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.