Niusha Aboutaleby

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



Research Interests: Real-Time Computing, Network Architecture, Computing Platform, Data Structures and Algorithms, Analysis of Algorithms


Niusha. Aboutaleby: Received her B.S in computer engineering from Iran University of Science & Technology, in 2009 and she is studying computer engineering in M.S at IAU University. Her research interests are in the area of distributed systems, cloud services, load balancing and scheduling algorithms in cloud computing, ad hoc and sensor 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:, 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.
Other Articles