Skip to main content
SpringerLink
Log in

Token-based approach in distributed mutual exclusion algorithms: a review and direction to future research

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The problem of mutual exclusion is a highly focused area in the distributed architecture. To avoid inconsistency in data, mutual exclusion ensures that no two processes running on different processors are allowed to enter into the same shared resource simultaneously in the system. In recent years, the consistent development of ongoing internet and mobile communication technologies, the devices, infrastructure and resources in networking systems like Ad Hoc Networks are becoming more complex and heterogeneous. Various algorithms have been introduced as a solution to mutual exclusion problem in the domain of distributed architecture over the past years. The performance and adaptability of these solutions depend on the different strategies used by them in the system. Various classifications of these strategies have been proposed such as token-based and non-token-based (also, permission-based). This paper presents a survey of various existing token-based distributed mutual exclusion algorithms (TBDMEA) in the focus of their performance measures and fault-tolerant capabilities which comprises the associated open challenges and directions to future research. In conjunction with traditional to latest proposed TBDMEA, token-based distributed group mutual exclusion algorithms (TBDGMEA) and token-based self-stabilizing distributed mutual exclusion algorithms (TBStDMEA) have also been surveyed in this paper as new variants of the token-based scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Tanenbaum AS, Maarten VS (2013) Distributed systems. Pearson Education, London

    MATH  Google Scholar 

  2. Srivastava A, Prakash J (2021) Future FANET with application and enabling techniques: anatomization and sustainability issues. Comput Sci Rev 39:100359. https://doi.org/10.1016/j.cosrev.2020.100359

    Article  MathSciNet  Google Scholar 

  3. Bekmezci I, Sahingoz OK, Temel Ş (2013) Flying Ad-Hoc Networks (FANETs): a survey. Ad Hoc Netw 11(3):1254–1270. https://doi.org/10.1016/j.adhoc.2012.12.004

    Article  Google Scholar 

  4. Chriki A, Touati H, Snoussi H, Kamoun F (2019) FANET: communication, mobility models and security issues. Comput Netw. https://doi.org/10.1016/j.comnet.2019.106877

    Article  Google Scholar 

  5. Dijkstra E (1965) Solution of a problem in concurrent programming control. Commun ACM 8:569. https://doi.org/10.1145/365559.365617

    Article  Google Scholar 

  6. Saxena PC, Rai J (2003) A survey of permission-based Distributed Mutual Exclusion Algorithms. Comput Stand Interfaces 25(2):159–181. https://doi.org/10.1016/S0920-5489(02)00105-8

    Article  Google Scholar 

  7. Ricart G, Agrawala AK (1981) An optimal algorithm for mutual exclusion in computer networks. Commun ACM 24(1):9–17. https://doi.org/10.1145/358527.358537

    Article  MathSciNet  Google Scholar 

  8. Suzuki I, Kasami T (1985) A Distributed Mutual Exclusion Algorithm. ACM Trans Comput Syst 3(4):344–349. https://doi.org/10.1145/6110.214406

    Article  Google Scholar 

  9. Singhal M (1989) A heuristically-aided algorithm for mutual exclusion in distributed systems. IEEE Trans Comput 38(5):651–662. https://doi.org/10.1109/12.24268

    Article  Google Scholar 

  10. Goscinski A (1990) Two algorithms for mutual exclusion in real-time distributed computer systems. J Parallel Distrib Comput 9(1):77–82. https://doi.org/10.1016/0743-7315(90)90114-5

    Article  Google Scholar 

  11. Mishra S, Srimani PK (1990) Fault-tolerant mutual exclusion algorithms. J Syst Softw 11(2):111–129. https://doi.org/10.1016/0164-1212(90)90056-r

    Article  Google Scholar 

  12. Nishio S, Li KF, Manning EG (1990) A resilient mutual exclusion algorithm for computer networks. IEEE Trans Parallel Distrib Syst 1(3):344–355. https://doi.org/10.1109/71.80161

    Article  Google Scholar 

  13. Chang Y-I, Singhal M, Liu MT (1991) A dynamic Token-Based Distributed Mutual Exclusion Algorithm. In: [1991 Proceedings] Tenth Annual International Phoenix Conference on Computers and Communications. https://doi.org/10.1109/pccc.1991.113817

  14. Makki K, Banta P, Been K, Pissinou N, Park EK (1992) A token based distributed k mutual exclusion algorithm. In: [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing. https://doi.org/10.1109/spdp.1992.242717

  15. Maekawa M (1985) A √N algorithm for mutual exclusion in decentralized systems. ACM Trans Comput Syst 3(2):145–159. https://doi.org/10.1145/214438.214445

    Article  Google Scholar 

  16. Agrawal D, Elabbadi A (1995) A Token-Based Fault-Tolerant Distributed Mutual Exclusion Algorithm. J Parallel Distrib Comput 24(2):164–176. https://doi.org/10.1006/jpdc.1995.1016

    Article  Google Scholar 

  17. Lamport L (1978) Time, clocks, and the ordering of events in a distributed system. Commun ACM 21(7):558–565. https://doi.org/10.1145/359545.359563

    Article  MATH  Google Scholar 

  18. Wu M (2002) An efficient Distributed Token-Based Mutual Exclusion Algorithm with central coordinator. J Parallel Distrib Comput 62(10):1602–1613. https://doi.org/10.1016/s0743-7315(02)91847-2

    Article  MATH  Google Scholar 

  19. Tanenbaum S (1992) Modern operating systems. Prentice-Hall Inc, Englewood Cliffs

    MATH  Google Scholar 

  20. Mohamed N, Michel T (1988) How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion. In: van Leeuwen J (ed) Distributed algorithms. WDAG 1987. Lecture notes in computer science, vol 312. Springer, Berlin. https://doi.org/10.1007/BFb0019802

    Chapter  Google Scholar 

  21. Raymond K (1989) A tree-based algorithm for Distributed Mutual Exclusion. ACM Trans Comput Syst 7(1):61–77. https://doi.org/10.1145/58564.59295

    Article  Google Scholar 

  22. Raymond K (1989) A distributed algorithm for multiple entries to a critical section. Inf Process Lett 30(4):189–193. https://doi.org/10.1016/0020-0190(89)90211-1

    Article  Google Scholar 

  23. Satyanarayanan R, Muthukrishnan DR (1992) A note on Raymond’s tree based algorithm for Distributed Mutual Exclusion. Inf Process Lett 43(5):249–255. https://doi.org/10.1016/0020-0190(92)90219-l

    Article  MathSciNet  MATH  Google Scholar 

  24. Dhamdhere DM, Kulkarni SS (1994) A token based k-resilient mutual exclusion algorithm for distributed systems. Inf Process Lett 50(3):151–157. https://doi.org/10.1016/0020-0190(94)00019-0

    Article  MATH  Google Scholar 

  25. Chang Y, Singhal M, Liu MT (1990) A fault tolerant algorithm for Distributed Mutual Exclusion. In: Proceedings Ninth Symposium on Reliable Distributed Systems, Huntsville, AL, USA, 1990, pp 146–154. https://doi.org/10.1109/RELDIS.1990.93960

  26. Helary J-M, Mostefaoui A, Raynal M (1994) A general scheme for token and tree-based Distributed Mutual Exclusion algorithms. IEEE Trans Parallel Distrib Syst 5(11):1185–1196. https://doi.org/10.1109/71.329670

    Article  Google Scholar 

  27. Thambu P, Wong J (1995) An efficient token-based mutual exclusion algorithm in a distributed system. J Syst Softw 28(3):267–276. https://doi.org/10.1016/0164-1212(94)00061-q

    Article  Google Scholar 

  28. Naimi M, Trehel M, Arnold A (1996) A log (N) Distributed Mutual Exclusion Algorithm based on path reversal. J Parallel Distrib Comput 34(1):1–13. https://doi.org/10.1006/jpdc.1996.0041

    Article  Google Scholar 

  29. Wagner C, Mueller F (2000) Token-based read/write-locks for Distributed Mutual Exclusion. Lect Notes Comput Sci. https://doi.org/10.1007/3-540-44520-x_167

    Article  Google Scholar 

  30. Sopena J, Arantes L, Bertier M, Sens P (2005) A fault-Tolerant Token-Based Mutual Exclusion Algorithm using a dynamic tree. In: Cunha JC, Medeiros PD (eds) Euro-Par 2005 parallel processing. Euro-Par 2005. Lecture notes in computer science, vol 3648. Springer, Berlin. https://doi.org/10.1007/11549468_72

    Chapter  Google Scholar 

  31. Naimi M, Trehel M (1987) (1987) How to detect a failure and regenerate the token in the log(n) distributed algorithm for mutual exclusion. Lect Notes Comput Sci LNCS 312:155–166. https://doi.org/10.1007/BFb0019802

    Article  MATH  Google Scholar 

  32. Mueller F (2001) Fault tolerance for token-based synchronization protocols. Workshop on fault-tolerant parallel and distributed systems, IEEE. https://doi.org/10.1109/IPDPS.2001.925101

  33. Lejeune J, Arantes L, Sopena J, Sens P (2015) (2015) A fair starvation-free prioritized mutual exclusion algorithm for distributed systems. J Parallel Distrib Comput. https://doi.org/10.1016/j.jpdc.2015.04.002

    Article  Google Scholar 

  34. Kanrar S, Chaki N (2010) Fapp: a new fairness algorithm for priority process mutual exclusion in distributed systems. JNW 5(1):11–18

    Article  Google Scholar 

  35. Mueller F (1999) Priority inheritance and ceilings for Distributed Mutual Exclusion. In: The 20th IEEE Real-Time Systems Symposium, 1999. Proceedings, pp 340–349. https://doi.org/10.1109/REAL.1999.818861

  36. Chang Y-I (1994) Design of mutual exclusion algorithms for real-time distributed systems. J Inf Sci Eng 11(4):527–548

    Google Scholar 

  37. Chang YI, Singhal M, Liu MT (1990) An improved O(log N) mutual exclusion algorithm for distributed systems. In” Proceedings of 1990 International Conference on Parallel Processing, vol III, pp 295–302, August 1990.

  38. Tamhane SA, Kumar M (2012) A token-based distributed algorithm for supporting mutual exclusion in opportunistic networks. Pervas Mobile Comput 2012:795–809. https://doi.org/10.1016/j.pmcj.2011.08.002

    Article  Google Scholar 

  39. Baldoni R, Virgilito A, Petrassi R (2002) A Distributed Mutual Exclusion Algorithm for mobile ad-hoc networks. In: International Symposium on Computers and Communications, pp 539–544

  40. Wu W, Cao J, Raynal M (2007) (2007) A dual-token-based fault tolerant mutual exclusion algorithm for MANETs. Mob Ad Hoc Sens Netw 4864(2007):572–583. https://doi.org/10.1007/978-3-540-77024-4_52

    Article  Google Scholar 

  41. Malpani N, Chen Y, Vaidya N, Welch J (2005) Distributed token circulation in mobile ad hoc networks. IEEE Trans Mob Comput. https://doi.org/10.1109/TMC.2005.25

    Article  Google Scholar 

  42. Derhab A, Badache N (2008) A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad-hoc networks. Int J Parallel Emergent Distrib Syst 23(3):197–218. https://doi.org/10.1080/17445760701536084

    Article  MathSciNet  MATH  Google Scholar 

  43. Walter JE, Welch JL, Vaidya NH (2001) (2001) A mutual exclusion algorithm for ad hoc mobile networks. Wirel Netw 7:585–600. https://doi.org/10.1023/A:1012363200403

    Article  MATH  Google Scholar 

  44. Wu W, Cao J, Yang J (2008) A fault tolerant mutual exclusion algorithm for mobile ad hoc networks. Pervasive Mob Comput 4(1):139–160. https://doi.org/10.1016/j.pmcj.2007.08.001

    Article  Google Scholar 

  45. Fakhfakh F, Tounsi M, Mohamed M (2020) Modeling and proving distributed algorithms for dynamic graphs. Future Gener Comput Syst 108:751–761. https://doi.org/10.1016/j.future.2020.03.003

    Article  Google Scholar 

  46. Chaudhuri P (1995) An algorithm for Distributed Mutual Exclusion. Inf Softw Technol 37(7):375–381. https://doi.org/10.1016/0950-5849(95)91493-j

    Article  Google Scholar 

  47. Chaudhuri P, Karaata MH (1998) An O(n1/3) Algorithm for Distributed Mutual Exclusion. J Syst Architect 45(5):409–420. https://doi.org/10.1016/s1383-7621(97)00087-8

    Article  Google Scholar 

  48. Neamatollahi P, Sedaghat Y, Naghibzadeh M (2017) A simple token-based algorithm for the mutual exclusion problem in distributed systems. J Supercomput 73(9):3861–3878. https://doi.org/10.1007/s11227-017-1985-y

    Article  Google Scholar 

  49. Saxena PC, Gupta S (1999) A token-based delay optimal algorithm for mutual exclusion in distributed systems. Comput Stand Interfaces 21(1):33–50. https://doi.org/10.1016/s0920-5489(99)00003-3

    Article  Google Scholar 

  50. Helary J, Plozeau N, Raynal M (1988) A distributed algorithm for mutual exclusion in an arbitrary network. Comput J 31(4):289–295. https://doi.org/10.1093/comjnl/31.4.289

    Article  MathSciNet  MATH  Google Scholar 

  51. Yan Y, Zhang X, Yang H (1996) A fast token chasing mutual exclusion algorithm in arbitrary network topologies. J Parallel Distrib Comput 35(1996):156–172. https://doi.org/10.1006/jpdc.1996.0078

    Article  Google Scholar 

  52. Loukantchevsky M (2020) Distributed ring-based mutual exclusion with failure recovery. In: Proceedings of the 21st International Conference on Computer Systems and Technologies '20 (CompSysTech '20). Association for Computing Machinery, New York, NY, USA, pp 111–115. https://doi.org/10.1145/3407982.3408014

  53. Taheri H, Neamatollahi P, Naghibzadeh M (2011) A hybrid token-based Distributed Mutual Exclusion Algorithm using wraparound two-dimensional array logical topology. Inf Process Lett 111(17):841–847. https://doi.org/10.1016/j.ipl.2011.05.021

    Article  MathSciNet  MATH  Google Scholar 

  54. Neamatollahi P, Taheri H, Naghibzadeh M (2012) Info-based approach in Distributed Mutual Exclusion Algorithms. J Parallel Distrib Comput 72(5):650–665. https://doi.org/10.1016/j.jpdc.2012.01.005

    Article  MATH  Google Scholar 

  55. Bertier M, Arantes L, Sens P (2004) Hierarchical token based mutual exclusion algorithms. In: IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004. https://doi.org/10.1109/ccgrid.2004.1336650.

  56. Zheng W, Song LS, Mei’an L (2007) Ad hoc Distributed Mutual Exclusion Algorithm based on token-asking. J Syst Eng Electron 2007:398–406. https://doi.org/10.1016/S1004-4132(07)60104-2

    Article  MATH  Google Scholar 

  57. Sharma B, Bhatia RS, Singh AK (2014) A token-based protocol for mutual exclusion in mobile Ad Hoc networks. J Inf Process Syst 10:36–54. https://doi.org/10.3745/JIPS.2014.10.1.036

    Article  Google Scholar 

  58. Khanna A, Rodrigues JJPC, Gupta N, Swaroop A, Gupta D, Saleem K, de Albuquerque VHC (2019) A mutual exclusion algorithm for flying Ad Hoc networks. Comput Electr Eng 76:82–93. https://doi.org/10.1016/j.compeleceng.2019.03.005

    Article  Google Scholar 

  59. Khanna A, Rodrigues JJPC, Gupta N, Swaroop A, Gupta D (2020) Local Mutual Exclusion algorithm using fuzzy logic for Flying Ad hoc Networks. Comput Commun 156:101–111. https://doi.org/10.1016/j.comcom.2020.03.036

    Article  Google Scholar 

  60. Chang Y-I (1992) A priority-based approach to mutual exclusion for real-time distributed systems. In: Proceedings of of the International Computer Symposium, vol 1, pp 36–43

  61. Fu SS, Tzeng N-F, Chung J-Y (2000) Empirical evaluation of mutual exclusion algorithms for distributed systems. J Parallel Distrib Comput 60(7):785–806. https://doi.org/10.1006/jpdc.2000.1635

    Article  Google Scholar 

  62. Neilsen ML, Mizuno M (1991) A dag-based algorithm for Distributed Mutual Exclusion. In: Proceedings of 11th International Conference on Distributed Computing Systems, pp 354–360. https://doi.org/10.1109/ICDCS.1991.148689

  63. Fu SS, Tzeng N-F (1995) Efficient Token-Based Approach to Mutual Exclusion in Distributed Memory Systems. Technical Report TR-95-8-1 CACS, Univ. Southwestern Louisiana, Lafayette, LA

  64. Dice D, Kogan A (2021) Hemlock: compact and scalable mutual exclusion. arXiv:2102.03863

  65. Srimani PK, Reddy RLN (1992) Another distributed algorithm for multiple entries to a critical section. Inf Process Lett 41(1):51–57. https://doi.org/10.1016/0020-0190(92)90079-b

    Article  MATH  Google Scholar 

  66. DeMent NS, Srimani PK (1994) A new algorithm for k mutual exclusions in distributed systems. J Syst Softw 26(2):179–191. https://doi.org/10.1016/0164-1212(94)90087-6

    Article  Google Scholar 

  67. Wang S, Lang SD (1994) A tree-based distributed algorithm for the K-entry critical section problem. In: Proceedings of 1994 International Conference on Parallel and Distributed Systems. https://doi.org/10.1109/icpads.1994.590400

  68. Bulgannawar S, Vaidya NH (1995) A distributed K-mutual exclusion algorithm. In: Proceedings of 15th International Conference on Distributed Computing Systems, Vancouver, BC, Canada, 1995, pp 153–160. https://doi.org/10.1109/ICDCS.1995.500014

  69. Chaudhuri P, Edward T (2008) An algorithm for k-mutual exclusion in decentralized systems. Comput Commun 31(14):3223–3235. https://doi.org/10.1016/j.comcom.2008.05.009

    Article  Google Scholar 

  70. Kakugawa H, Kamei S, Masuzawa T (2008) A Token-Based Distributed Group Mutual Exclusion Algorithm with quorums. IEEE Trans Parallel Distrib Syst 19(9):1153–1166. https://doi.org/10.1109/tpds.2008.22

    Article  Google Scholar 

  71. Joung Y-J (2000) Asynchronous Group Mutual Exclusion. Distrib Comput 13:189–206. https://doi.org/10.1007/PL00008918

    Article  MATH  Google Scholar 

  72. Joung Y-J (2002) The congenial talking philosophers problem in computer networks. Distrib Comput 15:155–175. https://doi.org/10.1007/s004460100069

    Article  MATH  Google Scholar 

  73. Mittal N, Mohan PK (2007) A Priority-based Distributed Group Mutual Exclusion Algorithm when group access is non-uniform. J Parallel Distrib Comput 67:797–815. https://doi.org/10.1016/j.jpdc.2007.02.005

    Article  MATH  Google Scholar 

  74. Atreya R, Mittal N, Peri S (2007) A quorum-based Group Mutual Exclusion Algorithm for a distributed system with dynamic group set. IEEE Trans Parallel Distrib Syst 18(10):1345–1360. https://doi.org/10.1109/TPDS.2007.1072

    Article  Google Scholar 

  75. Mizuno M, Neilsen ML, Rao R (1991) A Token-Based Distributed Mutual Exclusion Algorithm Based on Quorum Agreements. In: Proceeding of 11th IEEE International Conference on Distributed Computing Systems (ICDCS ’91), pp 361–368. https://doi.org/10.1109/ICDCS.1991.148690

  76. Mamun Q, Khan MA (2020) A Group Mutual Exclusion protocol for the use case of IoT-blockchain integration in work-safe scenario. In: 2020 10th Annual Computing and Communication Workshop and Conference (CCWC), Las Vegas, NV, USA, pp 0025–0030. https://doi.org/10.1109/CCWC47524.2020.9031277

  77. Belkhiria M, Bertier M, Tedeschi C (2020) Group Mutual Exclusion to scale distributed stream processing pipelines. In: 2020 IEEE/ACM 13th International Conference on Utility and Cloud Computing (UCC), Leicester, UK, pp 247–256. https://doi.org/10.1109/UCC48980.2020.00043

  78. Aravind A (2020) Symmetric Tokens based Group Mutual Exclusion. In: 49th International Conference on Parallel Processing—ICPP : Workshops (ICPP Workshops '20). Association for Computing Machinery, New York, NY, USA, Article 5, pp 1–10. https://doi.org/10.1145/3409390.3409395

  79. Hadzilacos V (2001) A note on Group Mutual Exclusion. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp 100–106

  80. Kiniwa J (2006) Request-based token passing for self-stabilizing mutual exclusion. Inf Sci 176(18):2603–2623. https://doi.org/10.1016/j.ins.2005.11.013

    Article  MathSciNet  MATH  Google Scholar 

  81. Chen Y, Welch JL (2005) Self-stabilizing dynamic mutual exclusion for mobile ad hoc networks. J Parallel Distrib Comput 65(9):1072–1089. https://doi.org/10.1016/j.jpdc.2005.03.009

    Article  MATH  Google Scholar 

  82. Chen Y, Welch JL (2002) Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks. In: The Sixth Annual International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM’2002), 2002. https://doi.org/10.1145/570810.570815

  83. Malpani N, Vaidya N, Welch J (2001) Distributed token circulation in mobile ad hoc networks. In: Proceedings of the Ninth International Conference on Network Protocols (ICNP)

  84. Beauquier J, Gradinariu M, Johnen C, Durand-Lose J (2002) Token-Based Self-Stabilizing Uniform Algorithms. J Parallel Distrib Comput 62(5):899–921. https://doi.org/10.1006/jpdc.2001.1832

    Article  MATH  Google Scholar 

  85. Aleliunas R, Karp RM, Lipton R, Lovasz L, Rackoff C (1979) Random walks, universal traversal sequences and the complexity of the maze problem. In: FOCS’79, Proceedings of the 20st Annual IEEE Symposium on Foundation of Computer Science, pp 218–223. https://doi.org/10.1109/SFCS.1979.34

  86. Alstein D, Hoepman JH, Olivier B, Put P (1995) Self-stabilizing mutual exclusion on directed graphs. Technical Report 9513, CWI Amsterdam

  87. Angluin D (1980) Local and global properties in networks of processors. In: STOC’80, Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pp 82–93. https://doi.org/10.1145/800141.804655

  88. Awerbuch B, Ostrovsky R (1994) Memory-efficient and self-stabilizing network reset. In: PODC’94, Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pp 254–263. https://doi.org/10.1145/197917.198104

  89. Beauquier J, Cordier S, Dela S et al (1995) Optimum probabilistic self-stabilization on uniform rings. In: WSS’95, Proceedings of the 2nd Workshop on Self-Stabilizing Systems, pp 15.1–15.15

  90. Beauquier J, Gradinariu M, Johnen C (1999) Memory space requirements for self-stabilizing leader election protocols. In: PODC’99, Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp 199–208. https://doi.org/10.1145/301308.301358

  91. Dijkstra E (1974) Self stabilizing systems in spite of distributed control. Commun Assoc Comput Mach 17(11):643–644. https://doi.org/10.1145/361179.361202

    Article  MATH  Google Scholar 

  92. Dhoked S, Mittal N (2020) An adaptive approach to recoverable mutual exclusion. In: Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC '20). Association for Computing Machinery, New York, NY, USA, pp 1–10. https://doi.org/10.1145/3382734.3405739

  93. Bouabdallah A, Laforest C (2000) A distributed token-based algorithm for the dynamic resource allocation problem. ACM SIGOPS Oper Syst Rev 34(3):60–68. https://doi.org/10.1145/506117.506125

    Article  Google Scholar 

  94. Shahryari O, Broumandnia A (2018) An improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm. J Comput Robot 11(2):49–58

    Google Scholar 

  95. Ismail DPII, Ja’afar MHF (2007). Mobile ad hoc network overview. In: 2007 Asia-Pacific Conference on Applied Electromagnetics. https://doi.org/10.1109/apace.2007.4603864

  96. Jain M, Saxena R (2017) Overview of VANET: Requirements and its routing protocols. In: 2017 International Conference on Communication and Signal Processing (ICCSP). https://doi.org/10.1109/iccsp.2017.8286742

  97. Khanna A, Singh AK, Swaroop A (2016) A Token-Based Solution to Group Local Mutual Exclusion Problem In Mobile Ad Hoc Networks. Arab J Sci Eng 41:5181–5194. https://doi.org/10.1007/s13369-016-2199-y

    Article  MathSciNet  MATH  Google Scholar 

  98. Rohit VR, Eswarathevar R (2019) Priority based hybrid Mutual Exclusion Algorithm with starvation avoidance for MANET. Proc Natl Acad Sci India Sect A Phys Sci 89:643–651. https://doi.org/10.1007/s40010-018-0513-7

    Article  MathSciNet  Google Scholar 

  99. Sharma B, Bhatia RS, Singh AK (2011) An O(1/n) protocol for supporting distributed mutual exclusion in Vehicular Ad Hoc Networks. In: Nagamalai D, Renault E, Dhanuskodi M (eds) Advances in parallel distributed computing. PDCTA 2011. Communications in computer and information science, vol 203. Springer, Berlin

    Google Scholar 

  100. Wu W, Zhang J, Luo A, Cao J (2015) Distributed Mutual Exclusion Algorithms for intersection traffic control. IEEE Trans Parallel Distrib Syst 26(1):65–74. https://doi.org/10.1109/TPDS.2013.2297097

    Article  Google Scholar 

  101. Lim J, Jeong YS, Park DS et al (2018) An efficient distributed mutual exclusion algorithm for intersection traffic control. J Supercomput 74:1090–1107. https://doi.org/10.1007/s11227-016-1799-3

    Article  Google Scholar 

  102. Shehu HA, Sharif MH, Ramadan RA (2020) Distributed Mutual Exclusion Algorithms for intersection traffic problems. IEEE Access 8:138277–138296. https://doi.org/10.1109/ACCESS.2020.3012573

    Article  Google Scholar 

  103. Jin X, Han J (2011) K-means clustering. In: Sammut C, Webb GI (eds) Encyclopedia of machine learning. Springer, Boston. https://doi.org/10.1007/978-0-387-30164-8_425

    Chapter  Google Scholar 

  104. Cunningham P, Cord M, Delany SJ (2008) Supervised learning. In: Cord M, Cunningham P (eds) Machine learning techniques for multimedia: cognitive technologies. Springer, Berlin. https://doi.org/10.1007/978-3-540-75171-7_2

    Chapter  Google Scholar 

  105. Sunyaev A (2020) Distributed ledger technology. In: Internet computing. Springer, Cham. https://doi.org/10.1007/978-3-030-34957-8_9

Download references

Funding

This study was not funded by any organization.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology, Yupia, Arunachal Pradesh, India

    Ashish Singh Parihar & Swarnendu Kumar Chakraborty

  2. School of Computing, DIT University, Dehradun, India

    Ashish Singh Parihar

Authors
  1. Ashish Singh Parihar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Swarnendu Kumar Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ashish Singh Parihar.

Ethics declarations

Conflict of interest

The authors have no conflict of interest in relation to this work.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendices

Appendix 1: Symbol notations

Symbol

Description

N

Number of nodes in the distributed network

L

(L \(\in\) Z+ , L > 1)

k/K

Number of token in the network

d (D)

Diameter of network topology

q

Number of neighbor nodes

e

total number of edges in network

M

Switch count between Pi and Pj

\(\omega\)

Average time unit after which a node regenerates the CS request for next time

\(\left| Q \right|\)

Size of quorum

T

Message propagation delay

\(\gamma\)

Poisson distribution with average rate

Appendix 2: List of abbreviations

FC

Fully connected

LRT

Logical rooted tree

MSUT

Minimal spanning unrooted tree

DRT

Dynamic rooted tree

TLTBA

Two-level trees based on arbitrators

DLT

Dynamic logical tree

DT

Directed tree

BST

BFS spanning tree

SLT

Static logical tree

G

Graph

DAG

Directed acyclic graph

EM

Equivalent Mesh

TDEM

Three-Dimensional Equivalent Mesh

TLS

Torus logical structure

CR

Chordal ring

VRT

Virtual ring topology

W2DA

Wraparound 2-D array

2DA

2-D array

HNT

Hierarchical network topology

ANT

Arbitrary network topology

AHN

Ad Hoc Network

DG

Dynamic graph

RB

Ring based

OG

Object graph

HLC

Hardware level circuit

DN

Directed network

I&IC

Inter and intra cluster

LS

Logical structure

CB

Coterie based

ASMM

Asynchronous shared memory model

MANET

Mobile Ad Hoc Network

FANET

Flying Ad Hoc Network

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Parihar, A.S., Chakraborty, S.K. Token-based approach in distributed mutual exclusion algorithms: a review and direction to future research. J Supercomput 77, 14305–14355 (2021). https://doi.org/10.1007/s11227-021-03802-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-03802-8

Keywords

Search

Navigation