Abstract
Virtualization can deliver significant benefits for cloud computing by enabling VM migration to improve utilization, balance load and alleviate hotspots. While several mechanisms exist to migrate VMs, few efforts have focused on optimizing migration policies in a multi-rooted tree datacenter network. The general problem has multiple facets, two of which map to generalizations of well-studied problems: (1) Migration of VMs in a bandwidth-oversubscribed tree network generalizes the maximum multicommodity flow problem in a tree, and (2) Migrations must meet load constraints at the servers, mapping to variants of the matching problem – generalized assignment and demand matching. While these problems have been individually studied, a new fundamental challenge is to simultaneously handle the packing constraints of server load and tree edge capacities. We give approximation algorithms for several versions of this problem, where the objective is to alleviate a maximal number of hot servers. In the full version of this work [5], we empirically demonstrate the effectiveness of these algorithms through large scale simulations on real data.
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
Chekuri, C., Mydlarz, M., Shepherd, F.: Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms (TALG) 3(3), 27–es (2007)
Clark, C., Fraser, K., Hand, S., Hansen, J.G., Jul, E., Limpach, C., Pratt, I., Warfield, A.: Live migration of virtual machines. In: NSDI (2005)
Garg, N., Vazirani, V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)
Greenberg, A., Hamilton, J., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D., Patel, P., Sengupta, S.: VL2: a scalable and flexible data center network. In: SIGCOMM (2009)
Jain, N., Menache, I., Naor, S., Shepherd, F.: Topology-aware VM migration in bandwidth oversubscribed datacenter networks. Technical report (May 2012), http://research.microsoft.com/apps/pubs/?id=162997
Lagar-Cavilla, H.A., Whitney, J., Scannell, A., Patchin, P., Rumble, S.M., de Lara, E., Brudno, M., Satyanarayanan, M.: Snowflock: Rapid virtual machine cloning for cloud computing. In: Eurosys (2009)
Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons (1998)
Shepherd, F., Vetta, A.: The demand-matching problem. Mathematics of Operations Research 32(3), 563 (2007)
Shmoys, D., Tardos, É.: An approximation algorithm for the generalized assignment problem. Mathematical Programming 62(1), 461–474 (1993)
Sundararaj, A., Sanghi, M., Lange, J., Dinda, P.: An optimization problem in adaptive virtual environments. ACM SIGMETRICS Performance Evaluation Review 33(2), 6–8 (2005)
Wood, T., Shenoy, P.J., Venkataramani, A., Yousif, M.S.: Black-box and gray-box strategies for virtual machine migration. In: NSDI (2007)
Xu, H., Li, B.: Egalitarian stable matching for VM migration in cloud computing. In: INFOCOM Workshops, pp. 631–636 (2011)
Xu, Y., Sekiya, Y.: Virtual machine migration strategy in federated cloud. In: Internet Conference (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, N., Menache, I., Naor, J.(., Shepherd, F.B. (2012). Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31585-5_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-31585-5_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31584-8
Online ISBN: 978-3-642-31585-5
eBook Packages: Computer ScienceComputer Science (R0)