A User Experience-Based Cloud Service Redeployment Mechanism
Authors:
- Yu KangYKYu Kang
- Yangfan ZhouYZYangfan Zhou
- Zibin ZhengZZZibin Zheng
- Michael R. LyuMLMichael R. Lyu
- 1 July 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21596182,p. 227-234
Abstract
Cloud computing has attracted much interest recently from both industry and academic. Nowadays, more and more Internet applications are moving to the cloud environment. Making optimal deployment of cloud applications is critical for providing good performance to attract users. Optimizing user experience is usually required for cloud service deployment. However, it is a challenging task to know the user experience of end users, since there is generally no proactive connection between a user to the machine that will host the service instance. To attack this challenge, in this paper, we first propose a framework to model cloud features and capture user experience. Then based on the collected user connection information, we formulate the redeployment of service instances as k-median and max k-cover problems. We proposed several approximation algorithms to efficiently solve these problems. Comprehensive experiments are conducted by employing a real-world QoS dataset of service invocation. The experimental results show the effectiveness of our proposed redeployment approaches.Keywords
This publication has 10 references indexed in Scilit:
- A view of cloud computingCommunications of the ACM, 2010
- Dynamic Service Placement in Shared Service Hosting InfrastructuresLecture Notes in Computer Science, 2010
- Effective missing data prediction for collaborative filtering2007
- Improved combinatorial algorithms for the facility location and k-median problems2003
- A new greedy approach for facility location problems2002
- Local search heuristic for k-median and facility location problems2001
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975