A Dynamic Resource Balance Algorithm for Multi-tenant Placement Problem in SaaS

Author

Xianzhang Chen ; Xiaoping Li

Author_Institution

Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China

fYear

2013

fDate

11-13 April 2013

Firstpage

123

Lastpage

128

Abstract

In this paper, we consider the Online Tenant Placement Problem(OTPP) Software-as-a-Service level of cloud computing systems. Online boarded tenants are optimally places on limited nodes (or servers) to maximize the total supported number of tenants without violating their Service-Level Agreements (SLAs). The application combination based dynamic tenant dispatch heuristic (ATH for short) is proposed for OTPP, which is a problem feature related strategy combining with a greedy one. To shorten the tenant dispatch time, a new method is introduced for computing the distance between resource vectors. As compared with the best existing method so far for OTPP, simulated experimental results show that ATH disposes more tenants using less dispatch time within limited resources, especially on large instance.

Keywords

cloud computing; resource allocation; ATH; OTPP; SLA; SaaS; cloud computing system; dynamic resource balance algorithm; dynamic tenant dispatch heuristic; multitenant placement problem; online tenant placement problem; problem feature related strategy; service level agreement; software-as-a-service; Computational modeling; Equations; Estimation; Servers; Software as a service; Time factors; Vectors; multi-tenancy; resource allocation; web service;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Sciences (ICSS), 2013 International Conference on

Conference_Location

Shenzhen

ISSN

2165-3836

Print_ISBN

978-1-4673-6258-0

Type

conf

DOI

10.1109/ICSS.2013.13

Filename

6519775