Practical Mechanism Relocation Scheduling in Software-Defined Networks

Authors(2) :-P. Venkata Ramana, P. Prasad Babu

Live migration could be a key technique for virtual machine (VM) management in knowledge center networks that allows flexibility in resource optimization, fault tolerance, and cargo reconciliation. Despite its quality, the live migration still introduces performance degradations throughout the migration method. Thus, there have been continuous efforts in reducing the migration time in order to attenuate the impact. From the network’s perspective, the migration time is decided by the quantity of information to be migrated and also the obtainable information measure used for such transfer. In this paper, we examine the matter of the way to schedule the migrations and the way to assign network resources for migration when multiple VMs have to be compelled to be migrated at identical time. We consider the matter within the Software-defined Network (SDN) context since it provides versatile management on routing. More specifically, we have a tendency to propose a way that computes the optimal migration sequence and network information measure used for each migration. we formulate this drawback as a mixed whole number programming, that is NP-hard. to form it computationally feasible for big scale knowledge centers, we have a tendency to propose associate approximation scheme via linear approximation and totally polynomial time approximation, and procure its theoretical performance sure and machine complexness. Through intensive simulations, we demonstrate that our totally polynomial time approximation (FPTA) algorithmic program includes a sensible performance compared with the optimal answer of the first programming drawback and two progressive algorithms. That is, our projected FPTA algorithm approaches to the optimum answer of the first programming drawback with but 100 percent variation and far less computation time. Meanwhile, it reduces the whole migration time and repair period of time by up to four-hundredth and two hundredth compared with the progressive algorithms, severally.

Authors and Affiliations

P. Venkata Ramana
Department of MCA, Mother Theresa Institute of Computer Applications, Palamaner, India
P. Prasad Babu
Department of MCA, Mother Theresa Institute of Computer Applications, Palamaner, India

VM migration planning, Software-defined Network (SDN), Migration sequence, Minimum migration time.

  1. P. Barham, B. Dragovic, K. Fraser, "Xen and the art of virtualization", ACM SIGOPS Operating Systems Review, vol. 37, no. 5, pp. 164-177, 2003.
  2. C. Clark, K. Fraser, and S. Hand, "Live migration of virtual machines", in Proc. 2nd NSDI, 2005, pp. 273–286.
  3. M. Tsugawa, R. Figueiredo, J. Fortes, "On the use of virtualization technologies to support uninterrupted IT services: A case study with lessons learned from the Great East Japan Earthquake", in Proc. of IEEE ICC, 2012, pp. 6324–6328.
  4. A. Fischer, A. Fessi, G. Carle, "Wide-area virtual machine migration as resilience mechanism", in Proc. of IEEE SRDSW, 2011, pp. 72–77.
  5. M. F. Zhani, Q. Zhang, G. Simona, "VDC Planner: Dynamic migrationaware virtual data center embedding for clouds", in Proc. of IFIP/IEEE IM, 2013, pp. 18-25.
  6. T. Wood, P. J. Shenoy, A. Venkataramani, "Black-box and Gray-box Strategies for Virtual Machine Migration", in NSDI, 2007, pp. 17.
  7. K. Ye, X. Jiang, D. Huang, "Live migration of multiple virtual machines with resource reservation in cloud computing environments" in Proc. of IEEE CLOUD, 2011, pp. 267-274.
  8. C. Mastroianni, M. Meo, G. Papuzzo, "Self-economy in cloud data centers: Statistical assignment and migration of virtual machines", Euro-Par 2011 Parallel Processing. Springer Berlin Heidelberg, 2011, pp. 407-418.
  9. M. F. Bari, M. F. Zhani, Q. Zhang Q, "CQNCR: Optimal VM Migration Planning in Cloud Data Centers", in IFIP Networking Conference, 2014, pp. 1-9.
  10. B. Boughzala, R. Ben Ali, M. Lemay, "OpenFlow supporting interdomain virtual machine migration", in Proc. of IEEE/IFIP WOCN, 2011, pp. 1-7.
  11. S. Ghorbani, M. Caesar, "Walk the line: consistent network updates with bandwidth guarantees", in Proc. of HotSDN, 2012, pp. 67-72.
  12. S. Lo, M. Ammar, E. Zegura, "Design and analysis of schedules for virtual network migration", in IFIP Networking Conference, 2013, pp. 1- 9.
  13. S. Agarwal, M. Kodialam, T. V. Lakshman, "Traffic engineering in software defined networks", in Proc. of IEEE INFOCOM, 2013, pp. 2211- 2219.
  14. A. Sridharan, R. Guerin, C. Diot, "Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks", IEEE/ACM Transactions on Networking (TON), vol. 13, no. 2, pp. 234-247, 2005. 15A. Tootoonchian, M. Ghobadi, Y. Ganjali, "OpenTM: traffic matrix estimator for OpenFlow networks", in International Conference on Passive and Active Network Measurement, Springer Berlin Heidelberg, pp. 201-210, 2010

Publication Details

Published in : Volume 4 | Issue 2 | March-April 2018
Date of Publication : 2018-03-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 421-424
Manuscript Number : CSEIT184113
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

P. Venkata Ramana, P. Prasad Babu, "Practical Mechanism Relocation Scheduling in Software-Defined Networks", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.421-424, March-April-2018.
Journal URL :

Article Preview