In this paper, we consider a hierarchical cloud topology and address the problem of optimally placing a group of logical entities according to some policy constraining the allocation of the members of the group at the various levels of the hierarchy. We introduce a simple group hierarchical placement policy, parametrized by lower and upper bounds, that is generic enough to include several existing policies such as collocation and anti-collocation, among others, as special cases. We present an efficient placement algorithm for this group hierarchical placement policy and demonstrate a six-fold speed improvement over existing algorithms. In some cases, there exists a degree of freedom which we exploit to quantitatively obtain a placement solution, given the amount of group spreading preferred by the user. We demonstrate the quality and scalability of the algorithm using numerical examples.
CITATION STYLE
Tantawi, A. N. (2015). Quantitative placement of services in hierarchical clouds. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9259, pp. 195–210). Springer Verlag. https://doi.org/10.1007/978-3-319-22264-6_13
Mendeley helps you to discover research relevant for your work.