Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

Full Text (PDF, 219KB), PP.34-40

Views: 0 Downloads: 0


Danial Rahdari 1,* Mahdi Golmohammadi 2 Abas Pirmoradi 3

1. Department of computer Engineering, Science and Research Branch, Islamic Azad University

2. Department of Computer Science,TehranPayameNur university, Shahr Rey branch, Tehran, Iran

3. Department of Computer Science, ShahidBeheshti University, Tehran, Iran

* Corresponding author.

DOI: https://doi.org/10.5815/ijieeb.2013.03.04

Received: 10 Jun. 2013 / Revised: 4 Jul. 2013 / Accepted: 10 Aug. 2013 / Published: 8 Sep. 2013

Index Terms

Cloud, Election Algorithm, Service Oriented, Energy Efficient


Service oriented systems such as cloud computing are emerging widely even in people’s daily life due to its magnificent advantages for enterprise and clients. However these computing paradigms are challenged in many aspects such as power usage, availability, reliability and especially security. Hence a central controller existence is crucial in order to coordinate Virtual Machines (VM) placed on physical resources. In this paper an algorithm is proposed to elect this controller among various VM which is able to tolerate multiple numbers of faults in the system and reduce power usage as well. Moreover the algorithm exchanges dramatically fewer messages than other relevant proposed algorithms.

Cite This Paper

DanialRahdari, Mahdi Golmohammadi, AbasPirmoradi, "Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems", International Journal of Information Engineering and Electronic Business(IJIEEB), vol.5, no.3, pp.34-40, 2013. DOI:10.5815/ijieeb.2013.03.04


[1]M. D. Dikaiakos, D.Kataros, P. Mehra, G. palis and A.Vakali. “Cloud Computing: Distributed Internet computing for IT and Scientific Researches”, IEEE Internet Computing, vol. 13, no. 5, 10-13, 2009.

[2]Y. Afek and A. Gafni. “Time and message bounds for election in synchronous and asynchronous complete networks”, Proceeding of 4th Annual ACM Symposium on Principles of distributed computing of Distributed Computing, Minaki, Canada, pp. 186-195, 1985.

[3]R. Gallager, P. Humblet and P. Spira,. “A Distributed Algorithm for Minimum Weight Spanning Trees”, ACM Transactions on Programming Languages and Systems, vol.4, no.1, pages 66-77, 1983.

[4]N. Malpani, J. Welch and N. Vaidya. “Leader Election Algorithms for Mobile Ad Hoc Networks”, Fourth International Workshop onDiscrete Algorithms and Methods for Mobile Computing and Communications, 2000.

[5]P. Basu, N. Khan and T. Little. “A Mobility basedmetric for clustering in mobile ad hoc networks”. International Workshop on Wireless Networks and Mobile Computing, 658 – 663, 2001

[6]A. A, Obeidat and A. Gubarev, V. “Leader Election in peer to peer systems”, Siberian conference on control and communications, 25-31, 2009.

[7]P. Scheihing. “Creating Energy efficient datacenters”. Data Center Facilities and Engineering Conference, 2007.

[8]J. Markov and S.Lohr. “Intel’s huge bet turns iffy”. New York Times Technology Sections,2002.

[9]K. H. Kim, A. Beloglazov, R. Buyya. “Power-aware Provisioning of Cloud Resources for Real-time Services”. Proceedings of the 7th International Workshop on Middleware for Grids, Clouds and e-Science, 2009. 

[10]G. Molina et al. “Elections in a Distributed Computing System”, IEEE Trans. Comp, vol. 31, no. 1, 48-59, 1982.

[11]Fredrickson, N and Lynch, N. “Electing a Leader in Asynchronous Ring”, Journal of ACM, vol. 34, no. 1, 98-115, 1987.

[12]Datta, A.K. Larmore, L.L. Vemula, P.“An O(n)–time self–stabilizing leader election algorithm”, Journal of Parallel Distributed Computing, vol. 71, no. 11, 1532-1544, 2011.

[13]Shi, W. Srimani, P. K., 2005. “Leader election in hierarchical star network”, Journal Parallel Distributed Computing, vol. 65, no. 11, 1435-1442, 2005.

[14]Bakhshi, R. Endrullis, J. Fokkink, W. Pang, J. “Fast leader election in anonymous rings with bounded expected delay”, Journal of Information Processing Letters, vol. 111, no. 17, 864-870, 2011.

[15]Delporte-Gallet, C. Devismes, B. Fauconnier, H. “Stabilizing leader election in partial synchronous system with crash failure”, Journal of Parallel and Distributed Computing, vol. 70, no. 1, 45-58, 2010.

[16]Derhab, A. Badache, N. “A self-stabilizing Leader Election Algorithm in Highly Dynamic Ad Hoc Network”, IEEE Transaction Parallel and Distributed Systems, vol. 19, no. 7, 926-939, 2008.

[17]Boukerche, A. Abrougui, K. “An efficient leader election protocol for mobile networks”, Proceedings of the 2006 international conference on Wireless communications and mobile computing, 1129-1134, 2006.

[18]Melit, L. Badache, N. “An energy efficient leader election algorithm for mobile ad hoc networks”,10th International Symposium on Programing and Systems (ISPS), 54-59, 2011