Abstract
We address the data-center consolidation problem: given a working data-center, the goal of the problem is to choose which software applications must be deployed on which servers in order to minimize the number of servers to use while avoiding the overloading of system resources and satisfying availability constraints. This in order to tradeoff between quality of service issues and data-center costs. The problem is approached through a robust model of the data-center which exploits queueing networks theory. Then, we propose two mixed integer linear programming formulations of the problem able to capture novel aspects such as workload partitioning (load-balancing) and availability issues. A simple heuristic is proposed to compute solutions in a short time. Experimental results illustrate the impact of our approach with respect to a real-world consolidation project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anselmi, J., Amaldi, E., Cremonesi, P.: Service consolidation with end-to-end response time constraints. In: Software Engineering and Advanced Applications, 2008. SEAA 2008. 34th Euromicro Conference, September 3-5, pp. 345–352 (2008)
Baskett, F., Chandy, K., Muntz, R., Palacios, F.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22(2), 248–260 (1975)
Bichler, M., Setzer, T., Speitkamp, B.: Capacity planning for virtualized servers. In: Proceedings of the Workshop on Information Technologies and Systems, Milwaukee, Wisconsin, USA (2006)
Cardellini, V., Casalicchio, E., Grassi, V., Mirandola, R.: A framework for optimal service selection in broker-based architectures with multiple qos classes. In: SCW 2006: Proceedings of the IEEE Services Computing Workshops, pp. 105–112. IEEE Computer Society, Washington (2006)
Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Duxbury Press (November 2002)
Lazowska, E.D., Zahorjan, J., Graham, G.S., Sevcik, K.C.: Quantitative system performance: computer system analysis using queueing network models. Prentice-Hall, Inc., Upper Saddle River (1984)
Liu, Z., Wynter, L., Xia, C.H., Zhang, F.: Parameter inference of queueing models for it systems using end-to-end measurements. Perform. Eval. 63(1), 36–60 (2006)
Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0-1 knapsack problem (1997)
Menasce, D.A.: Virtualization: Concepts, applications, and performance modeling. The volgenau school of information technology and engineering (2005)
Menasce, D.A., Almeida, V.A.F., Dowdy, L.W.: Performance by Design: Computer Capacity Planning by Example: Computer Capacity Planning. Prentice Hall International, Englewood Cliffs
Menasce, D.A., Dowdy, L.W., Almeida, V.A.F.: Performance by Design: Computer Capacity Planning By Example. Prentice Hall PTR, Upper Saddle River (2004)
Rolia, J., Andrzejak, A., Arlitt, M.F.: Automating enterprise application placement in resource utilities. In: Brunner, M., Keller, A. (eds.) DSOM 2003. LNCS, vol. 2867, pp. 118–129. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anselmi, J., Cremonesi, P., Amaldi, E. (2009). On the Consolidation of Data-Centers with Performance Constraints. In: Mirandola, R., Gorton, I., Hofmeister, C. (eds) Architectures for Adaptive Software Systems. QoSA 2009. Lecture Notes in Computer Science, vol 5581. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02351-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-02351-4_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02350-7
Online ISBN: 978-3-642-02351-4
eBook Packages: Computer ScienceComputer Science (R0)