By Topic

A Link-failure Resilient Token based Mutual Exclusion Algorithm for Directed Graph Topology

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
$31 $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)
Kanrar, S. ; Dept. of Comput. Sci., Narasingha Dutta Coll., Howrah, India ; Choudhury, S. ; Chaki, N.

This paper proposes a new token-based mutual exclusion algorithm for directed graph topology, with or without cycles. In one of our earlier works, we have introduced a token based algorithm assuming an inverted tree topology. Such a stable, hierarchical topology is quite unrealistic for mobile networks due to frequent link failures and node mobility. The proposed solution overcomes this. Besides maintaining the correctness in terms of liveness and safety, the proposed algorithm ensures fairness in allocating the token amongst the competing processes. The algorithm offers solution paths even in presence of link failures.

Published in:

Parallel and Distributed Computing, 2008. ISPDC '08. International Symposium on

Date of Conference:

1-5 July 2008