Top

Journal of Network and Systems Management

Published in:

01-03-2013

A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems

Authors: Sukhendu Kanrar, Samiran Chattopadhyay, Nabendu Chaki

Published in: Journal of Network and Systems Management | Issue 1/2013

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

This paper aims towards designing a new token-based mutual exclusion algorithm for distributed systems. In some of the earlier work, token based algorithms for mutual exclusion are proposed for the distributed environment assuming inverted tree topology. In a wireless setup, such a stable, hierarchical topology is quite unrealistic due to frequent link failures. The proposed token-based algorithm works for processes with assigned priorities on any directed graph topology with or without cycles. The proposed algorithm, in spite of considering priorities of processes, ensures liveness in terms of token requests from low priority processes. Moreover, the algorithm keeps control message traffic reasonably low. The simulation results exhibit the performance of the proposed algorithm under varied contexts besides presenting a comparative performance with other recent algorithms for mutual exclusion like FAPP (Fairness Algorithm for Priority Process).

next article Deploying Circuit Emulation Services (CES) Over EPON Using Preemptive Priority Medium Access Controller

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Lin, D., Moh, T.S., Moh, M.: Brief announcement: improved asynchronous group mutual exclusion in token passing networks. In: Proceedings of Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 275–275. ACM, Las Vegas (2005)

Mittal, N., Mohan, P.K.: A priority-based distributed group mutual exclusion algorithm when group access is non-uniform. J. Parallel Distrib. Comput. 67(7), 797–815 (2007)MATHCrossRef

Joung, Y.J.: Asynchronous group mutual exclusion (extended abstract). In: Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 51–60. ACM, Puerto Vallarta, Mexico (1998)

Karnar, S., Chaki, N.: Modified raymond’s algorithm for priority (MRA-P) based mutual exclusion in distributed systems. In: Proceedings of ICDCIT 2006, LNCS 4317, pp. 325–332 (2006)

Swaroop, A., Singh, A.K.: A Distributed group mutual exclusion algorithm for soft real-time systems. Proc. World Acad. Sci., Eng. Technol. 26, 138–143 (2007)

Housini, A.: M. Trehel, pp. 253–259. Distributed mutual exclusion token-permission based by prioritized groups, Proc. ACS/IEEE Int. Confer. (2001)

Walter, J.E., Welch, J.L., Vaidya, M.H.: Mutual exclusion algorithm for adhoc mobile networks. Wirel. Netw. 7(6), 585–600 (2001)MATHCrossRef

Mueller, F.: Prioritized token-based mutual exclusion for distributed systems. In: Proceedings of the 9th Symposium on Parallel and Distributed Processing, pp. 791–795. IEEE CS, Orlando, FL (1998)

Singhal, M.: A heuristically-aided algorithm for mutual exclusion for distributed systems. IEEE Trans. Comput. 38(5), 70–78 (1989)CrossRef

10.

Attreya, R., Mittal, N.: A dynamic group mutual exclusion algorithm using surrogate quorums. In: Proceedings of the 25th IEEE Conference on Distributed Computing Systems (ICDCS’05), pp. 251–260. IEEE CS, Columbus, Ohio (2005)

11.

Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9–17 (1981)MathSciNetCrossRef

12.

Lamport, L.: Time, Clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)MATHCrossRef

13.

Carvalho, O.S.F., Roucairol, G.: On mutual exclusion in computer network. Commun. ACM 26(2), 46–147 (1983)

14.

Sanders, B.: The information structure of distributed mutual exclusion algorithm. ACM Comput. Syst. 5(3), 284–299 (1987)CrossRef

15.

Lodha, S., Kshemkalyani, A.: A fair distributed mutual exclusion algorithm. IEEE Trans. Parallel Distrib. Syst. 11(6), 537–549 (2000)CrossRef

16.

Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7, 61–77 (1989)CrossRef

17.

Bernabeu-Auban, J.M., Ahamad, M.: Applying a path-compression technique to obtain an efficient distributed mutual exclusion algorithm. LNCS 392, 33–44 (1989)MathSciNet

18.

Suzuki, I, Kasami, T.: An optimality theory for mutual exclusion algorithms. In: Proceedings of the 3rd International Conference on Distributed Computing Systems (Oct. 18–22, Fort Lauderdale, Fla.), pp. 365–370. IEEE, NY (1982)

19.

Naimi, M., Thiare, O.: Distributed mutual exclusion based on causal ordering. J. Comput. Sci. 5(5), 398–404 (2009). (ISSN 1549-3636)

20.

Singhal, M.: A dynamic information structure mutual exclusion in distributed system. IEEE Trans. Parallel Distrib. Syst. 3(1), 121–125 (1992)CrossRef

21.

Naimi, M., Trehel, M., Arnold, A.: A log(N) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput. 34(1), 1–13 (1996)CrossRef

22.

Sil, S., Das, S.: An energy efficient algorithm for distributed mutual exclusion in mobile Ad-hoc networks. World Acad. Sci. Eng. Technol. 64, 17–522 (2010)

23.

Kanrar, S., Choudhury, S., Chaki, N.: A link-failure resilient token based mutual exclusion algorithm for directed graph topology. In: Proceedings of the International Symposium on Parallel and Distributed Computing, pp. 65–72. IEEE CS, Cracow, Poland (2008)

24.

Kanrar, S., Chaki, N.: “FAPP: a new fairness algorithm for priority process mutual exclusion in distributed systems”; Special Issue on Recent Advances in Network and Parallel Computing, International Journal of Networks; 5(1): 11–18. ISSN: 1796–2056, (2010)

Title: A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Authors: Sukhendu Kanrar
Samiran Chattopadhyay
Nabendu Chaki
Publication date: 01-03-2013
Publisher: Springer US
Published in: Journal of Network and Systems Management / Issue 1/2013
Print ISSN: 1064-7570
Electronic ISSN: 1573-7705
DOI: https://doi.org/10.1007/s10922-011-9218-9

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Other articles of this Issue 1/2013

Service Control Layer (SCL): Enabling Rule-based Control and Enrichment in Next-Generation Telecom Service Delivery

RepCIDN: A Reputation-based Collaborative Intrusion Detection Network to Lessen the Impact of Malicious Alarms

Deploying Circuit Emulation Services (CES) Over EPON Using Preemptive Priority Medium Access Controller

On Game-Theoretic Network Security Provisioning

A Framework for Internet Media Services Delivery to the Home Environment

Premium Partner