Network aware resource allocation in distributed clouds
暂无分享,去创建一个
[1] Dorit S. Hochbaum,et al. Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[2] Vipin Kumar,et al. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..
[3] Vijay V. Vazirani,et al. Finding k-cuts within twice the optimal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Yuichi Asahiro,et al. Approximating Maximum Diameter-Bounded Subgraphs , 2010, LATIN.
[5] R. M. Mattheyses,et al. A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.
[6] Laurence A. Wolsey,et al. The node capacitated graph partitioning problem: A computational study , 1998, Math. Program..
[7] Brian W. Kernighan,et al. An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..
[8] Frank Thomson Leighton,et al. Improving performance on the internet , 2008, CACM.
[9] Haitao Wu,et al. BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.
[10] Amin Vahdat,et al. PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Albert G. Greenberg,et al. VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.
[13] Vasileios Pappas,et al. Improving the Scalability of Data Center Networks with Traffic-aware Virtual Machine Placement , 2010, 2010 Proceedings IEEE INFOCOM.
[14] Refael Hassin,et al. Approximation Algorithms for Minimum K -Cut , 2000, Algorithmica.