By Topic

A two-layer hierarchical permission based mutual exclusion algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Mohammad Ashiqur Rahman ; Dept. of Computer Science and Engineering, Ahsanullah University of Science and Technology, Bangladesh ; Md. Mostofa Akbar ; Mohammad Shafiul Alam

Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster based algorithms are scalable by nature. Several of them are quorum based solutions. All of these solutions exploit the idea of coordinator/leader of cluster. Thus, fault tolerance of these algorithms is low. If any coordinator fails, election of new one is required. Here we propose a two-layer hierarchical cluster based solution where no coordinator is used. We simulate our proposed algorithm and show that it outperforms related ME algorithms.

Published in:

Computers and Information Technology, 2009. ICCIT '09. 12th International Conference on

Date of Conference:

21-23 Dec. 2009