Danial Rahdari

Work place: Department of computer Engineering, Science and Research Branch, Islamic Azad University

E-mail: d.rahdary@srbiau.ac.ir


Research Interests: Computer systems and computational processes, Computer Architecture and Organization, Distributed Computing, Information Systems, Data Structures and Algorithms, Algorithm Design


Danial Rahdari received his B.S. in computer engineering from Sistan and Balouchestan University, in 2010 and he is studying computer engineering in M.S. at IAU University. His research interests are in the areas of distributed systems, cloud services, quality of service, load balancing and resource allocations algorithm in cloud computing and ad hoc networks.

Author Articles
A Distributed Fault Tolerance Global Coordinator Election Algorithm in Unreliable High Traffic Distributed Systems

By Danial Rahdari Amir Masoud Rahmani Niusha Aboutaleby Ali Sheidaei Karambasti

DOI: https://doi.org/10.5815/ijitcs.2015.03.01, Pub. Date: 8 Feb. 2015

Distributed systems consist of several management sites which have different resource sharing levels. Resources can be shared among inner site and outer site processes at first and second level respectively. Global coordinator should exist in order to coordinate access to multi site’s shared resources. Moreover; some other coordinators should manage access to inner site’s shared resources so that exerting appropriate coordinator election algorithms in each level is crucial to achieve most efficient system. In this paper a hierarchical distributed election algorithm is proposed which eliminates single point of failure of election launcher. Meanwhile traffic is applied to network at different times and the number of election messages is extremely decreased as well which applies more efficiency especially in high traffic networks. A standby system between coordinators and their first alternative is considered to induct less wait time to processes which want to communicate with coordinator.

[...] Read more.
Power Aware Reliable Virtual Machine Coordinator Election Algorithm in Service Oriented Systems

By Danial Rahdari Mahdi Golmohammadi Abas Pirmoradi

DOI: https://doi.org/10.5815/ijieeb.2013.03.04, Pub. Date: 8 Sep. 2013

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.

[...] Read more.
Fault Tolerant Message Efficient Coordinator Election Algorithm in High Traffic Bidirectional Ring Network

By Danial Rahdari Amir Masoud Rahmani Afsane Arabshahi

DOI: https://doi.org/10.5815/ijitcs.2013.01.02, Pub. Date: 8 Dec. 2012

Nowadays use of distributed systems such as internet and cloud computing is growing dramatically. Coordinator existence in these systems is crucial due to processes coordinating and consistency requirement as well. However the growth makes their election algorithm even more complicated. Too many algorithms are proposed in this area but the two most well known one are Bully and Ring. In this paper we propose a fault tolerant coordinator election algorithm in typical bidirectional ring topology which is twice as fast as Ring algorithm although far fewer messages are passing due to election. Fault tolerance technique is applied which leads the waiting time for the election reaching to zero.

[...] Read more.
Other Articles