Abstract
One major service provided by cloud computing is Software as a Service (SaaS). As competition in the SaaS market intensifies, it becomes imperative for a SaaS provider to design and configure its computing system properly. This paper studies the application placement problem encountered in computer clustering in SaaS networks. This problem involves deciding which software applications to install on each computer cluster of the provider and how to assign customers to the clusters in order to minimize total cost. Given the complexity of the problem, we propose two algorithms to solve it. The first one is a probabilistic greedy algorithm which includes randomization and perturbation features to avoid getting trapped in a local optimum. The second algorithm is based on a reformulation of the problem where each cluster is to be assigned an application configuration from a properly generated subset of configurations. We conducted an extensive computational study using large data sets with up to 300 customers and 50 applications. The results show that both algorithms outperform a standard branch-and-bound procedure for problem instances with large sizes. The probabilistic greedy algorithm is shown to be the most efficient in solving the problem.
Similar content being viewed by others
References
Gaast JP, Rietveld CA, Gabor AF, Zhang Y (2014) A Tabu Search Algorithm for application placement in computer clustering. Comput Oper Res 50:38–46
Gartner Research (2005) http://www.gartner.com/newsroom/id/1963815
Haouari M, Chaouachi JS (2002) A probabilistic greedy search algorithm for combinatorial optimization with application to the set covering problem. J Oper Res Soc 53(7):792–799
IBM ILOG CPLEX Optimization Studio 12.5, IBM (2012)
Kwok T, Mohindra A (2008) Resource calculations with constraints, and placement of tenants and instances for multi-tenant SaaS applications. In: Proceedings of the international conference on service oriented computing. pp 633–648
Lan G, DePuy GW, Whitehouse GE (2007) An effective and simple heuristic for the set covering problem. Eur J Oper Res 176(3):1387–1403
Lian JW, Yen DC, Wang YT (2014) An exploratory study to understand the critical factors affecting the decision to adopt cloud computing in Taiwan hospital. Int J Inf Manag 34(1):28–36
Liu Z, Hacigumus H, Moon HJ, Chi Y, Hsiung WP (2013) PMAX: tenant placement in multitenant databases for profit maximization. In: Proceedings of the 16th international conference on extending database technology. pp 442–453
Marston S, Li Z, Bandyopadhyay S, Zhang J, Ghalsasi A (2011) Cloud computing: the business perspective. Decis Support Syst 51(1):176–189
Mazzola JB, Neebe AW (1999) Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type. Eur J Oper Res 115(2):285–299
Urgaonkar B, Rosenberg AL, Shenoy PJ (2007) Application placement on a cluster of servers. Int J Found Comput Sci 18(5):1023–1041
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Amiri, A. Application placement in computer clustering in software as a service (SaaS) networks. Inf Technol Manag 18, 161–173 (2017). https://doi.org/10.1007/s10799-016-0261-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10799-016-0261-9