Two Step Algorithm for Virtual Machine Distributed Replication with Limited Bandwidth Problem

  • Wojciech Bożejko
  • Piotr Nadybski
  • Mieczysław Wodecki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9842)


This article presents a proposal of solution for the problem of optimization of the virtual machine (VM) backup or replication process in architecture with multiple locations where efficient bandwidth usage and maximal tardiness for single VM are objectives. The two step algorithm is considered, where in the first step a set of tasks is partitioned into smaller subsets for load balancing. In the second step - tabu search algorithm is used to minimize weighted sum of tardiness. The paper contains the results of computational experiments on the scalability of the presented method.


  1. 1.
    Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., Konwinski, A., Zaharia, M.: A view of cloud computing. Commun. ACM 53(4), 50–58 (2010)Google Scholar
  2. 2.
    Bożejko, W., Wodecki, M.: On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2), 227–231 (2006). Elsevier Science LtdMathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bożejko, W., Wodecki, M.: Solving permutational routing problems by population-based metaheuristics. Comput. Ind. Eng. 57, 269–276 (2009)CrossRefGoogle Scholar
  4. 4.
    Bożejko, W., Wodecki, M.: Parallel genetic algorithm for minimizing total weighted completion time. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 400–405. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Bulbul, K.: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Comput. Oper. Res. 38, 967–983 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Ellrod, C.: Load Balancing - Least Connections. Accessed 10 April 2016
  7. 7.
    Lin, Y.K., Chong, C.S.: A tabu search algorithm to minimize total weighted tardiness for the job shop scheduling problem. J. Ind. Manage. Optim. 12(2), 703–713 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Mell, P., Grance, T.: The NIST definition of cloud computing, Recommendations of the National Institute of Standards and Technology. Accessed 03 April 2016
  9. 9.
    Wu, F., Wu, Q., Yousong, T.: Workflow scheduling in cloud: a survey. J. Supercomput. 71(9), 3373–3418 (2015)CrossRefGoogle Scholar
  10. 10.
    Wodecki, M.: A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem. Int. J. Adv. Manuf. Technol. 37(9–10), 996–1004 (2008)CrossRefGoogle Scholar
  11. 11.
    Wodecki, M.: A block approach to earliness-tardiness scheduling problems. Int. J. Adv. Manuf. Technol. 40, 797–807 (2009)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2016

Authors and Affiliations

  • Wojciech Bożejko
    • 1
  • Piotr Nadybski
    • 2
  • Mieczysław Wodecki
    • 3
  1. 1.Institute of Computer Engineering, Control and RoboticsWrocław University of TechnologyWrocławPoland
  2. 2.Faculty of Technical and Economic ScienceWitelon State University of Applied Sciences in LegnicaLegnicaPoland
  3. 3.Institute of Computer ScienceUniversity of WrocławWrocławPoland

Personalised recommendations