Open Access   Article Go Back

Optimizing Virtual Machine Placement Using Intelligent Water Drop and Simulating Algorithm

V.O. Ramakant1 , A. Victor2

Section:Research Paper, Product Type: Journal Paper
Volume-5 , Issue-4 , Page no. 14-21, Apr-2017

Online published on Apr 30, 2017

Copyright © V.O. Ramakant, A. Victor . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: V.O. Ramakant, A. Victor, “Optimizing Virtual Machine Placement Using Intelligent Water Drop and Simulating Algorithm,” International Journal of Computer Sciences and Engineering, Vol.5, Issue.4, pp.14-21, 2017.

MLA Style Citation: V.O. Ramakant, A. Victor "Optimizing Virtual Machine Placement Using Intelligent Water Drop and Simulating Algorithm." International Journal of Computer Sciences and Engineering 5.4 (2017): 14-21.

APA Style Citation: V.O. Ramakant, A. Victor, (2017). Optimizing Virtual Machine Placement Using Intelligent Water Drop and Simulating Algorithm. International Journal of Computer Sciences and Engineering, 5(4), 14-21.

BibTex Style Citation:
@article{Ramakant_2017,
author = {V.O. Ramakant, A. Victor},
title = {Optimizing Virtual Machine Placement Using Intelligent Water Drop and Simulating Algorithm},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {4 2017},
volume = {5},
Issue = {4},
month = {4},
year = {2017},
issn = {2347-2693},
pages = {14-21},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=1234},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=1234
TI - Optimizing Virtual Machine Placement Using Intelligent Water Drop and Simulating Algorithm
T2 - International Journal of Computer Sciences and Engineering
AU - V.O. Ramakant, A. Victor
PY - 2017
DA - 2017/04/30
PB - IJCSE, Indore, INDIA
SP - 14-21
IS - 4
VL - 5
SN - 2347-2693
ER -

VIEWS PDF XML
839 634 downloads 440 downloads
  
  
           

Abstract

Developing approaches intended to produce top notch answers for tackle troublesome computational enhancement issues by playing out a pursuit over the space of heuristics as opposed to looking the arrangement space specifically. Significant progress in developing search methodologies for a huge variety of application areas still require specialists to integrate their expertise in every problem domain. Researchers have need for developing automated systems to replace the role of a human expert. A hyper-heuristic for the most part goes for diminishing the measure of area information in the inquiry system. Coming about approach ought to be shabby and quick to execute, requiring less mastery in either the issue area or heuristic techniques and it would be vigorous. Resulting approach is cheap and fast to implement, requiring less expertise in either the problem domain as well as hyper heuristic methods and it would be robust.

Key-Words / Index Term

Hyper-Heuristic Algorithms, Virtual Machine Placement problem, Genetic Algorithms, Energy efficient

References

[1] N. Bobroff, A. Kochut, K. Beaty, “Dynamic Placement of Virtual Machines for Managing SLA Violations”, 10th IFIP/IEEE International Symposium on Integrated Network Management, Munich, pp.119-128, 2007.
[2] M. Wang, X. Meng, L. Zhang, “Consolidating virtual machines with dynamic bandwidth demand in data centers”, Proceedings IEEE INFOCOM, Shanghai, pp. 71-75, 2011.
[3] J. W. Jiang, T. Lan, S. Ha, M. Chen, M. Chiang, “Joint VM placement and routing for data center traffic engineering”, Proceedings IEEE INFOCOM, Orlando, pp. 2876-2880, 2012.
[4] Cowling, Peter, Graham Kendall, Eric Soubeiga, “A hyperheuristic approach to scheduling a sales summit”, International Conference on the Practice and Theory of Automated Timetabling, Berlin Heidelberg, pp. 176-190, 2000.
[5] K. Edmund, “Hyper-heuristics: A survey of the state of the art”, Journal of the Operational Research Society, Vol.64, Issue.12, pp.1695-1724, 2013.
[6] K. Edmund, “A classification of hyper-heuristic approaches”, Handbook of metaheuristics, Springer US, pp.449-468, 2010.
[7] E. Ozcan, Y. Bykov, M. Birben, E. K. Burke, “Examination timetabling using late acceptance hyper-heuristics”, 2009 IEEE Congress on Evolutionary Computation, Trondheim, pp. 997-1004, 2009.
[8] M. Ayob, G. Kendall, “A Monte Carlo hyper-heuristic to optimize component placement sequencing for multi head placement machine”, In Proceedings of the International Conference on Intelligent Technologies (ISTRD), Thailand, pp 132–141, 2003.
[9] M Misir, W Vancroonenburg, K Verbeeck, GV. Berghe, “A selection hyper-heuristic for scheduling deliveries of ready-mixed concrete”, In Proceedings of the Metaheuristics International Conference, Itly, pp.289-298, 2011.
[10] Özcan, Ender, Burak Bilgin, EE Korkmaz, “A comprehensive analysis of hyper-heuristics”, Intelligent Data Analysis, Vol.12, Issue.1, pp.3-23, 2008.
[11] EK Burke, G Kendall, E Soubeiga, “A tabu-search hyperheuristic for timetabling and rostering”, Journal of Heuristics, Vol. 9, Issue.6, pp.451-470, 2003
[12] Nadarajen Veerapen, Dario Landa-Silva, Xavier Gandibleux, “Hyperheuristic as Component of a Multi-Objective Metaheuristic”, Do toral Symposium on Engineering Sto hasti Lo al Sear h Algorithms, Belgium, pp.51-55, 2009.
[13] K McClymont, EC Keedwell, “Markov chain hyper-heuristic (MCHH): an online selective hyper-heuristic for multi-objective continuous problems “, Proceedings of the 13th annual conference on Genetic and evolutionary computation, Ireland, pp. 2003-2010, 2011.
[14] J Gomez, H Terashima-Marín, “Approximating multi-objective hyper-heuristics for solving 2d irregular cutting stock problems”, Mexican International Conference on Artificial Intelligence, Berlin, pp.349-360, 2010.
[15] G. Miranda, J. de Armas, C. Segura, C. León, “Hyperheuristic codification for the multi-objective 2D Guillotine Strip Packing Problem”, IEEE Congress on Evolutionary Computation, Barcelona, pp.1-8, 2010.
[16] Furtuna Renata, Silvia Curteanu, Florin Leon, “Multi-objective optimization of a stacked neural network using an evolutionary hyper-heuristic”, Applied Soft Computing, Vol.12, Issue.1, pp.133-144, 2012.
[17] Vázquez Rodríguez, José Antonio, Sanja Petrovic, “Calibrating continuous multi-objective heuristics using mixture experiments”, Journal of Heuristics, Vol.18, Issue.5, pp.699-726, 2012.
[18] A.C. Kumari, K. Srinivas M.P. Gupta, “Software module clustering using a hyper-heuristic based multi-objective genetic algorithm”, 3rd IEEE International Advance Computing Conference (IACC), Ghaziabad, pp. 813-818, 2013.
[19] C León, G Miranda, C Segura, “Hyperheuristics for a dynamic-mapped multi-objective island-based model”, International Work-Conference on Artificial Neural Networks, Berlin, pp.41-59, 2009.
[20] JA Vrugt, BA Robinson, “Improved evolutionary optimization from genetically adaptive multimethod search”, National Academy of Sciences, Vol.104, Issue.3, pp.708-711, 2007.
[21] Raad, Darian, Alexander Sinske, JV Vuuren, “Multiobjective optimization for water distribution system design using a hyperheuristic”, Journal of Water Resources Planning and Management, Vol.136, Issue.5, pp.592-596, 2010.
[22] X Zhang, R Srinivasan, MV Liew, “On the use of multi‐algorithm, genetically adaptive multi‐objective method for multi‐site calibration of the SWAT model”, Hydrological Processes, Vol.24, Issue.8, pp.955-969, 2010.
[23] Yu Wang, Li Bin, “Multi-strategy ensemble evolutionary algorithm for dynamic multi-objective optimization”, Memetic Computing, Vol.2, Issue.1, pp.3-24, 2010.
[24] AF Rafique, S Sivasundaram, “Multiobjective hyper heuristic scheme for system design and optimization”, AIP Conference Proceedings-American Institute of Physics, Vol.1493, No.1, pp.764-769, 2012.
[25] Ruibin Bai, “A new model and a hyper-heuristic approach for two-dimensional shelf space allocation”, 4OR, Vol.11, Issue.1, pp.31-55, 2013.
[26] Ruibin Bai, “An investigation of novel approaches for optimising retail shelf space allocation”, Docotral Disssertation of University of Nottingham, Nottingham, pp.1-220, 2005.
[27] E López-Camacho, H Terashima-Marin, P Ross, “A unified hyper-heuristic framework for solving bin packing problems”, Expert Systems with Applications, Vol.41, Issue.15, pp.6876-6889, 2014.
[28] Peter Ross, “Hyper-heuristics: learning to combine simple heuristics in bin-packing problems”, Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation, NY, pp.942-948,2002.
[29] Matthew Hyde, “A genetic programming hyper-heuristic approach to automated packing”, Docotral Dissertation University of Nottingham, Nottingham, pp.1-175, 2010.
[30] Kevin Sim, “Novel Hyper-heuristics Applied to the Domain of Bin Packing”, Docotral Dissertation of Edinburgh Napier University, singapore, pp.1-149, 2014.
[31] J. Dong, X. Jin, H. Wang, Y. Li, P. Zhang, S. Cheng, “Energy-Saving Virtual Machine Placement in Cloud Data Centers”, 2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, Netherlands, pp. 618-624, 2013.