A user experience-based cloud service redeployment mechanism

Proceedings - 2011 IEEE 4th International Conference on Cloud Computing, CLOUD 2011

Volumn , Issue , 2011, Pages 227-234

  Kang, Yu ^a   Zhou, Yangfan ^a   Zheng, Zibin ^a   Lyu, Michael R ^a,b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CLOUD SERVICES; DATA SETS; END USERS; INTERNET APPLICATION; K-MEDIAN; OPTIMAL DEPLOYMENT; SERVICE INSTANCES; SERVICE INVOCATION; USER EXPERIENCE;

APPROXIMATION ALGORITHMS; DISTRIBUTED DATABASE SYSTEMS; OPTIMIZATION;

CLOUD COMPUTING;

EID: 80053155926     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLOUD.2011.20     Document Type: Conference Paper

References (15)

1. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, "A view of cloud computing," ACM Communication, vol. 53, no. 4, pp. 50-58, 2010.
2. L. Qian, Z. Luo, Y. Du, and L. Guo, "Cloud computing: An overview," in Proc. 1st International Conference on Cloud Computing, 2009, pp. 626-631.
3. (2010, Aug.) Amazon auto scaling developer guide. http://aws.amazon.com/ documentation/autoscaling/as-dg.pdf.
4. (2010, Jul.) Elastic load balancing developer guide. http://aws.amazon. com/documentation/elasticloadbalancing/elb-dg.pdf.
5. H. Ma, I. King, and M. R. Lyu, "Effective missing data prediction for collaborative filtering," in Proc. 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2007, pp. 39-46. (Pubitemid 350164942)
6. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, "Local search heuristic for k-median and facility location problems," in Proc. 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 21-29. (Pubitemid 32865714)
7. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan, "Algorithms for facility location problems with outliers," in Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 642-651.
8. U. Feige, "A threshold of in n for approximating set cover," Journal of the ACM, vol. 45, pp. 634-652, July 1998.
9. K. Jain and V. V. Vazirani, "Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation," Journal of the ACM, vol. 48, pp. 274-296, March 2001.
10. M. Charikar and S. Guha, "Improved combinatorial algorithms for the facility location and k-median problems," in Proc. 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 378-388. (Pubitemid 129306191)
11. K. Jain, M. Mahdian, and A. Saberi, "A new greedy approach for facility location problems," in Proc. 34th Annual ACM Symposium on Theory of Computing, 2002, pp. 731-740. (Pubitemid 35009436)
12. V. Chvatal, "A greedy heuristic for the set-covering problem," Mathematics of Operations Research, vol. 4, no. 3, pp. 233-235, 1979.
13. L. Lovász, "On the ratio of optimal integral and fractional covers," Discrete Mathematics, vol. 13, no. 4, pp. 383-390, 1975.
14. L. Qiu, V. Padmanabhan, and G. Voelker, "On the placement of web server replicas," in Proc. of 20th IEEE International Conference on Computer Communications, vol. 3, pp. 1587-1596.
15. Q. Zhang, J. Xiao, E. Grses, M. Karsten, and R. Boutaba, "Dynamic service placement in shared service hosting infrastructures," in NETWORKING 2010, ser. Lecture Notes in Computer Science, 2010, vol. 6091, pp. 251-264.