Two Step Algorithm for Virtual Machine Distributed Replication with Limited Bandwidth Problem
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.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
- 6.Ellrod, C.: Load Balancing - Least Connections. https://www.citrix.com/blogs/2010/09/02/load-balancing-least-connections/. Accessed 10 April 2016
- 8.Mell, P., Grance, T.: The NIST definition of cloud computing, Recommendations of the National Institute of Standards and Technology. http://faculty.winthrop.edu/domanm/csci411/Handouts/NIST.pdf. Accessed 03 April 2016