Skip to main content

A Graph-Based Mutual Exclusion Algorithm Using Tokens

  • Chapter
  • First Online:
  • 452 Accesses

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 116))

Abstract

In some of the earlier works, token-based algorithms for ME are presented for the distributed environment. These are for inverted tree topology. However, such a stable, hierarchical topology is quite unrealistic for many types of networks, e.g., mobile ad-hoc networks (MANET), due to frequent link failures.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Swaroop, A., Singh, A.K.: A Distributed group mutual exclusion algorithm for soft real-time systems. In: Proceedings of World Academy of Science, Engineering and Technology, vol. 26, pp. 138–143 (2007)

    Google Scholar 

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

    Article  Google Scholar 

  3. Madria, S.K.: Timestamp based approach for the detection and resolution of mutual conflicts in real-time distributed systems. Computer Science Technical Reports. Paper 1367, pp. 1–16 (1997)

    Google Scholar 

  4. Paris, J.-F., Darrell, D.E.: Long, efficient dynamic voting algorithms. In: Proceedings of the Fourth International Conference on Data Engineering, pp. 268–275 (1998)

    Google Scholar 

  5. Maekawa, M.: A √n algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985)

    Article  Google Scholar 

  6. Chaki, N., Chaki, R., Saha, B., Chattopadhyay, T.: A new logical topology based on barrel shifter network over an all optical network. In: Proceedings of 28th IEEE International Conference on Local Computer Networks (LCN’03), pp. 283–284 (2003)

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

  9. Zarafshan, F., Karimi, A., Al-Haddad, S.A.R., Saripan, M.I., Subramaniam, S.: A preliminary study on ancestral voting algorithm for availability improvement of mutual exclusion in partitioned distributed systems. In: Proceedings of International Conference on Computers and Computing (ICCC’11), pp. 61–69 (2011)

    Google Scholar 

  10. Agrawal, D., EL Abbadi, A.: An efficient solution to the distributed mutual exclusion problem. In: Proceeding of the 8th ACM Symposium on Principles of Distributed Computing, pp. 193–200 (1989)

    Google Scholar 

  11. Kanrar, S., Choudhury, S., Chaki, N.: A link-failure resilient token based mutual exclusion algorithm for directed graph topology. In: Proceedings of the 7th International Symposium on Parallel and Distributed Computing—ISPDC 2008 (2008)

    Google Scholar 

  12. Chen, W., Lin, S., Lian, Q., Zhang, Z.: Sigma: A fault-tolerant mutual exclusion algorithm in dynamic distributed systems subject to process crashes and memory losses. Microsoft Research Technical Report MSR-TR-2005-58 (2005)

    Google Scholar 

  13. Delporte-Gallet, C., Fauconnier, H., Guerraoui, R., Kouznetsov, P.: Mutual exclusion in asynchronous systems with failure detectors. Technical Report in Computer and Communication Sciences, id: 200227 (2002)

    Google Scholar 

  14. Lin, S., Lian, Q., Chen M., Zhang, Z.: A practical distributed mutual exclusion protocol in dynamic peer-to-peer systems. In: Proceeding of IPTPS’2004 (2004)

    Google Scholar 

  15. Kanrar, S., Chaki, N., Chattopadhyay, S.: A new link failure resilient priority based fair mutual exclusion algorithm for distributed systems. J. Network. Syst. Manage. (JONS) 21(1), 1–24 (2013). ISSN 1064-7570

    Google Scholar 

  16. 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. Int. J. Networks 5(1), 11–18 (2010). ISSN: 1796-2056

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sukhendu Kanrar .

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Kanrar, S., Chaki, N., Chattopadhyay, S. (2018). A Graph-Based Mutual Exclusion Algorithm Using Tokens. In: Concurrency Control in Distributed System Using Mutual Exclusion. Studies in Systems, Decision and Control, vol 116. Springer, Singapore. https://doi.org/10.1007/978-981-10-5559-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5559-1_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5558-4

  • Online ISBN: 978-981-10-5559-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics