Skip to main content

Advertisement

SpringerLink
Log in

Hybrid algorithms for placement of virtual machines across geo-separated data centers

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Cloud computing has emerged as a new paradigm for hosting and supplying services over the Internet. This technology has brought many benefits, such as eliminating the need for maintaining expensive computing hardware. With an increasing demand for cloud computing, providing performance guarantees for applications that run over cloud become important. Applications can be abstracted into a set of virtual machines with certain guarantees depicting the quality of service of the application. In this paper, we consider the placement of these virtual machines across multiple data centers (VMPlacement), meeting the quality of service requirements while minimizing the bandwidth cost of the data centers. This problem is a generalization of the NP-hard generalized quadratic assignment problem (GQAP). In this paper, we present a greedy randomized adaptive search procedure and a biased random-key genetic algorithm, both hybridized with a path-relinking strategy and a local search based on variable neighborhood descent for solving this problem. The hybrid heuristics are also tested on instances of the GQAP. We show that both algorithms are effective in quickly solving small and large instances of VMPlacement problem, especially when the path-relinking is used. For GQAP, the results outperform the previous state-of-the-art algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. http://aws.amazon.com/ec2/.

  2. www.cplex.com.

References

  • Aiex RM, Resende MGC, Ribeiro CC (2007) TTT plots: a perl program to create time-to-target plots. Optim Lett 1(4):355–366

    Article  MathSciNet  MATH  Google Scholar 

  • Alicherry M, Lakshman T (2012) Network aware resource allocation in distributed clouds. In: 2012 Proceedings IEEE INFOCOM. IEEE, pp 963–971

  • Andrade CE, Resende MGC, Zhang W, Sinha RK, Reichmann KC, Doverspike RD, Miyazawa FK (2015) A biased random-key genetic algorithm for wireless backhaul network design. Appl Soft Comput 33:150–169

    Article  Google Scholar 

  • Armentano VA, Shiguemoto A, Løkketangen A (2011) Tabu search with path relinking for an integrated production-distribution problem. Comput Oper Res 38(8):1199–1209

    Article  MathSciNet  MATH  Google Scholar 

  • Ballani H, Costa P, Karagiannis T, Rowstron A (2011) Towards predictable datacenter networks. ACM SIGCOMM Comput Commun Rev 41(4):242

    Article  Google Scholar 

  • Basseur M, Seynhaeve F, Talbi E-G (2005) Path relinking in pareto multi-objective genetic algorithms. In: Coello Coello C, Hernández Aguirre A, Zitzler E (eds) Evolutionary multi-criterion optimization SE-9, vol 3410. Springer, Berlin, pp 120–134

    Chapter  MATH  Google Scholar 

  • Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. INFORMS J Comput 6(2):154–160

    Article  MATH  Google Scholar 

  • Biran O, Corradi A, Fanelli M, Foschini L, Nus A, Raz D, Silvera E (2012) A stable network-aware VM placement for cloud systems. In: 2012 12th IEEE/ACM international symposium on cluster, cloud and grid computing (ccgrid 2012). IEEE, pp 498–506

  • Cordeau JF, Gaudioso M, Laporte G, Moccia L (2006) A memetic heuristic for the generalized quadratic assignment problem. INFORMS J Comput 18(4):433–443

    Article  MathSciNet  MATH  Google Scholar 

  • Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67–71

    Article  MathSciNet  MATH  Google Scholar 

  • Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 6(2):109–133

    Article  MathSciNet  MATH  Google Scholar 

  • Feo TA, Resende MGC, Smith SH (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper Res 42(5):860–878. https://doi.org/10.1287/opre.42.5.860

    Article  MATH  Google Scholar 

  • Ferone D, Festa P, Resende MG (2016) Hybridizations of grasp with path relinking for the far from most string problem. Int Trans Oper Res 23(3):481–506

    Article  MathSciNet  MATH  Google Scholar 

  • Festa P (2013) A biased random-key genetic algorithm for data clustering. Math Biosci 245(1):76–85 (SI: BIOCOMP 2012)

    Article  MathSciNet  MATH  Google Scholar 

  • Festa P, Pardalos P, Resende M, Ribeiro C (2002) Randomized heuristics for the Max-Cut problem. Optim Methods Softw 17(6):1033–1058

    Article  MathSciNet  MATH  Google Scholar 

  • Festa P, Pardalos PM, Pitsoulis LS, Resende MGC (2006) Grasp with path relinking for the weighted maxsat problem. J Exp Algorithmics 11:1–16

    MathSciNet  MATH  Google Scholar 

  • Festa P, Resende MGC (2013) Hybridizations of GRASP with path-relinking. In: Talbi E-G (ed) Hybrid metaheuristics. Studies in computational intelligence, vol 434. Springer, Berlin, pp 135–155

    Chapter  Google Scholar 

  • Fischer A, Botero JF, Beck MT, de Meer H, Hesselbach X (2013) Virtual network embedding: a survey. IEEE Commun Surv Tutor 15(4):1888–1906

    Article  Google Scholar 

  • Fischetti M, Monaci M (2014) Exploiting erraticism in search. Oper Res 62(1):114–122

    Article  MathSciNet  MATH  Google Scholar 

  • Frieze A, Yadegar J (1983) On the quadratic assignment problem. Discrete Appl Math 5(1):89–98

    Article  MathSciNet  MATH  Google Scholar 

  • Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190–206

    Article  MathSciNet  MATH  Google Scholar 

  • Glover F (1997) Tabu search and adaptive memory programming—advances, applications and challenges. In: Barr R, Helgason R, Kennington J (eds) Interfaces in computer science and operations research. Operations research/computer science interfaces series, vol 7. Springer, New York, pp 1–75

    Chapter  Google Scholar 

  • Glover F (2014) Exterior path relinking for zero-one optimization. Int J Appl Metaheuristic Comput 5(3):1–8

    Article  Google Scholar 

  • Glover F, Laguna M (1993) Tabu search. In: Reeves CR (ed) Modern heuristic techniques for combinatorial problems. Blackwell Scientific Publishing, Oxford, pp 70–150

    Google Scholar 

  • Glover F, Laguna M, Martí R (2000) Fundamentals of scatter search and path relinking. Control Cybern 29(3):653–684

    MathSciNet  MATH  Google Scholar 

  • Glover F, Laguna M, Martí R (2003) Scatter search and path relinking: advances and applications. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. International series in operations research & management science, vol 57. Springer, New York, pp 1–35

    Google Scholar 

  • Gonçalves JF, Resende MGC (2011) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17(5):487–525

    Article  Google Scholar 

  • Greenberg A, Hamilton JR, Jain N, Kandula S, Kim C, Lahiri P, Maltz Da, Patel P, Sengupta S (2009) VL2: a scalable and flexible data center network. ACM SIGCOMM Comput Commun Rev 39(4):51

    Article  Google Scholar 

  • Guo C, Lu G, Wang HJ, Yang S, Kong C, Sun P, Wu W, Zhang Y (2010) SecondNet: a data center network virtualization architecture with bandwidth guarantees. In: International conference on—Co-NEXT, vol 10, New York. ACM, p 12

  • Guo T, Shenoy P, Ramakrishnan KK, Gopalakrishnan V (2017) Latency-aware virtual desktops optimization in distributed clouds. Multimed Syst 0(0):22

    Google Scholar 

  • Hansen P, Mladenović N, Moreno Pérez JA (2010) Variable neighbourhood search: methods and applications. Ann Oper Res 175(1):367–407

    Article  MathSciNet  MATH  Google Scholar 

  • Hoos HH, Stützle T (1998) Evaluating Las Vegas algorithms: pitfalls and remedies. In: Conference on uncertainty in artificial intelligence. Morgan Kaufmann, San Francisco, vol 14, pp 238–245

  • Hoos HH, Stützle T (1998) On the empirical evaluation of Las Vegas algorithms. Technical report, Computer Science Department, University of British Columbia

  • Kaufman L, Broeckx F (1978) An algorithm for the quadratic assignment problem using Bender’s decomposition. Eur J Oper Res 2(3):207–211

    Article  MATH  Google Scholar 

  • Koopmans TC, Beckmann MJ (1957) Assignment problems and the location of economic activities. Econometrica 25(1):53–76

    Article  MathSciNet  MATH  Google Scholar 

  • Laguna M, Martí R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11(1):44–52

    Article  MATH  Google Scholar 

  • Lee CG, Ma Z (2004) The generalized quadratic assignment problem. Technical report, Department of Mechanical and Industrial Engineering at the University of Toronto, Toronto, Ontario, M5S 3G8, Canada

  • Martí R, Laguna M, Glover F (2006) Principles of scatter search. Eur J Oper Res 169(2):359–372

    Article  MathSciNet  MATH  Google Scholar 

  • Martí R, Resende MGC, Ribeiro CC (2013) Multi-start methods for combinatorial optimization. Eur J Oper Res 226(1):1–8

    Article  MathSciNet  MATH  Google Scholar 

  • Mateus GR, Resende MGC, Silva RMA (2010) GRASP with path-relinking for the generalized quadratic assignment problem. J Heuristics 17(5):527–565

    Article  MATH  Google Scholar 

  • Mittelmann HD, Salvagnin D (2015) On solving a hard quadratic 3-dimensional assignment problem. Math Program Comput 7(2):219–234. https://doi.org/10.1007/s12532-015-0077-3

    Article  MathSciNet  MATH  Google Scholar 

  • Oliveira CAS, Pardalos PM, Resende MGC (2004) GRASP with path-relinking for the quadratic assignment problem. In: Ribeiro CC, Martins SL (eds) Experimental and efficient algorithms. Lecture notes in computer science, vol 3059. Springer, Berlin, pp 356–368

    Chapter  Google Scholar 

  • Pessoa AA, Hahn PM, Guignard M, Zhu Y-R (2010) Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique. Eur J Oper Res 206(1):54–63

    Article  MathSciNet  MATH  Google Scholar 

  • Piao JT, Yan J (2010) A network-aware virtual machine placement and migration approach in cloud computing. In: 2010 Ninth international conference on grid and cloud computing. IEEE, pp 87–92

  • Resende MG, Ribeiro CC (2016) Optimization by GRASP. Springer, New York

    Book  MATH  Google Scholar 

  • Resende MGC, Ribeiro CC (2005) GRASP with path-relinking: recent advances and applications. Metaheuristics: progress as real problem solvers, vol 1. Springer, New York, pp 29–63

    Chapter  Google Scholar 

  • Resende MGC, Ribeiro CC (2010) Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics. International series in operations research & management science, vol 146. Springer, New York, pp 283–319

    Google Scholar 

  • Resende MGC, Ribeiro CC (2014) GRASP: greedy randomized adaptive search procedures. In: Burke EK, Kendall G (eds) Search methodologies. Springer, New York, pp 287–312

    Chapter  Google Scholar 

  • Resende MGC, Ribeiro CC, Glover F, Martí R (2010) Scatter search and path-relinking: Fundamentals, advances, and applications. In: Handbook of metaheuristics, pp 87–107

  • Spears WM, DeJong KA (1991) On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, pp 230–236

  • Stefanello F, Aggarwal V, Buriol LS, Gonçalves JF, Resende MGC (2015) A biased random-key genetic algorithm for placement of virtual machines across geo-separated data centers. In: Conference on genetic and evolutionary computation, Madrid, vol 15. ACM, pp 1–8

  • Stefanello F, Buriol LS, Aggarwal V, Resende MGC (2015) A new linear model for placement of virtual machines across geo-separated data centers. In: Simpósio Brasileiro de Pesquisa Operacional, vol 47. Porto de Galinhas, PE. Sociedade Brasileira de Pesquisa Operacional, pp 1–11

  • Stefanello F, Buriol LS, Hirsch MJ, Pardalos PM, Querido T, Resende MGC, Ritt M (2017) On the minimization of traffic congestion in road networks with tolls. Ann Oper Res 249(1–2):119–139

    Article  MathSciNet  MATH  Google Scholar 

  • Toso R, Resende M (2015) A C++ application programming interface for biased random-key genetic algorithms. Optim Methods Softw 30(1):81–93

    Article  Google Scholar 

  • Vallada E, Ruiz R (2010) Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 38(1–2):57–67

    Article  Google Scholar 

  • Xie D, Hu YC (2012) The only constant is change: incorporating time-varying network reservations in data centers. In: Sigcomm, 12, SIGCOMM’12, New York. ACM, pp 199–210

Download references

Acknowledgements

This work has been partially supported by CAPES, CNPq Project 462425/2014-2, PRH PB-217 Petrobras S.A. from Brazil. We thank to K. Joshi at AT&T Labs-Research for many helpful discussions. The work of Vaneet Aggarwal and Mauricio G.C. Resende was done when both were employed at AT&T Labs Research.

Author information

Authors and Affiliations

  1. Instituto de Informática, Federal University of Rio Grande do Sul, Porto Alegre, RS, Brazil

    Fernando Stefanello & Luciana S. Buriol

  2. School of Industrial Engineering, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, 47907, USA

    Vaneet Aggarwal

  3. Amazon.com, Seattle, WA, 98109, USA

    Mauricio G. C. Resende

  4. Industrial and Systems Engineering, University of Washington, Seattle, WA, 98105, USA

    Mauricio G. C. Resende

Authors
  1. Fernando Stefanello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vaneet Aggarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Luciana S. Buriol
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fernando Stefanello.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Stefanello, F., Aggarwal, V., Buriol, L.S. et al. Hybrid algorithms for placement of virtual machines across geo-separated data centers. J Comb Optim 38, 748–793 (2019). https://doi.org/10.1007/s10878-019-00411-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-019-00411-3

Keywords

Search

Navigation