Network aware resource allocation in distributed clouds

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 963-971

  Alicherry, Mansoor ^a   Lakshman, T V ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION ALGORITHM; CLOUD SYSTEMS; COMMUNICATION COST; COMPUTATIONAL TASK; DATA CENTERS; EFFICIENT RESOURCE ALLOCATION; MAXIMUM DISTANCE; OPTIMAL ALGORITHM; OPTIMAL SELECTION; RESOURCE ALLOCATION ALGORITHMS; SERVER SELECTION; VIRTUAL MACHINES;

APPROXIMATION ALGORITHMS; COMPUTER SIMULATION; OPTIMIZATION; RESOURCE ALLOCATION; TELECOMMUNICATION SYSTEMS; TREES (MATHEMATICS); WIDE AREA NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84861624273     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195847     Document Type: Conference Paper

References (16)

1. Y. Asahiro, E. Miyano, and K. Samizo. Approximating maximum diameter-bounded subgraphs. LATIN' 10, pages 615-626, 2010.
2. C. E. Ferreira, A. Martin, C. de Souza, R. Weismantel, and L. Wolsey. The node capacitated graph partitioning problem: A computational study. Mathematical Programming, pages 229-256, 1998. (Pubitemid 128393279)
3. C. Fiduccia and R. Mattheyses. A linear-time heuristic for improving network partitions. Design Automation Conference, 1982.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.
5. O. Goldschmidt and D. Hochbaum. Polynomial algorithm for the k-cut problem. IEEE Symp. on Foundations of Comput. Sci., 1988.
6. A. Gottlieb. Beware the network cost gotchas of cloud computing. Cloud Computing Journal, June 2011.
7. A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim, P. Lahiri, D. A. Maltz, P. Patel, and S. Sengupta. V12: a scalable and flexible data center network. ACM SIGCOMM, 2009.
8. C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu. Bcube: a high performance, server-centric network architecture for modular data centers. ACM SIGCOMM, 2009.
9. N. Guttmann-Beck and R. Hassin. Approximation algorithms for minimum k-cut. Algorithmica, page 198207, 1999.
10. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Siam J. on Scientific Computing, 1999.
11. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal, 1970.
12. T. Leighton. Improving performance on the internet. Commun. ACM, 52, February 2009.
13. X. Meng, V. Pappas, and L. Zhang. Improving the scalability of data center networks with traffic-aware virtual machine placement. INFOCOM, 2010.
14. R. Niranjan Mysore, A. Pamboris, N. Farrington, N. Huang, P. Miri, S. Radhakrishnan, V. Subramanya, and A. Vahdat. Portland: a scalable fault-tolerant layer 2 data center network fabric. ACM SIGCOMM, 2009.
15. H. Saran and V. Vazirani. Finding k-cuts within twice the optimal. IEEE Symp. on Foundations of Compul. Sci., 1991.
16. SCOPE Alliance. Telecom grade cloud computing. www.scopealliance.org, 2011.