Skip to main content

A Mobile Agent Enabled Fully Distributed Mutual Exclusion Algorithm

  • Conference paper
  • First Online:
Mobile Agents (MA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2535))

Included in the following conference series:

Abstract

In this paper, we present a fully distributed algorithm using mobile agents to achieve mutual exclusion in a networking environment. The algorithm is designed within a framework for mobile agent enabled distributed server groups (MADSG), where cooperating mobile agents (CMA) are used to achieve coordination among the servers. When it requests to execute in the critical section (CS), to achieve mutual exclusion, a node dispatches a mobile agent to obtain permissions from other nodes. The agent will travel across the nodes and exchange information with them until it obtains enough permissions to decide its order to enter the CS. The algorithm is based on the well-known Majority Consensus Voting (MCV) scheme but, under heavy demand, an agent needs not to contact a majority number of nodes. We show that the proposed algorithm achieves mutual exclusion and is free from deadlock and starvation. We also present the performance analysis in terms of the number of agent migrations and the synchronization delay.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Agrawal and A. El Abbadi, "An efficient and fault-tolerant solution for distributed mutual exclusion," ACM Transactions on Computer Systems, vol. 9, no. 1, Feb. 1991, 1–20.

    Article  Google Scholar 

  2. J. Cao, G. H. Chan, W. Jia, and T. Dillon, "Checkpointing and Rollback of Wide-area Distributed Applications Using Mobile Agents", Proc. IEEE 2001 International Parallel and Distributed Processing Symposium (IPDPS2001), San Francisco, USA, Apr. 2001.

    Google Scholar 

  3. J. Cao, T. S. Chan and J. Wu, "Achieving Replication Consistency using Cooperating Mobile Agents", Proc. IPPC 2001 Workshop on Wireless Networks and Mobile Computing (IEEE Computer Society Press), Valencia, Spain. Sep. 2001.

    Google Scholar 

  4. Y. I. Chang, "A simulation study on distributed mutual exclusion", Journal of Parallel and Distributed Computing, vol. 33, 1996, 107–121.

    Article  Google Scholar 

  5. E. W. Felten and M. Rabinovich, "A centralized token-based algorithm for distributed mutual exclusion", Univ. of Washington technical report TR-92-02-02.

    Google Scholar 

  6. H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed system," Journal of the ACM, vol. 32, no. 4, 1985, 841–860.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. Lamport, "Time, clocks, and the order of events in a distributed system," Communications of the ACM, vol. 21, no. 7, Jul. 1978, 558–565.

    Article  MATH  Google Scholar 

  8. D. B. Lange and M. Oshima, "Seven Good Reasons for Mobile Agents", Communication of the ACM, vol. 42, no. 3, Mar. 1999, 88–89.

    Article  Google Scholar 

  9. M. Maekawa, "A sqrt(n) algorithm for mutual exclusion in decentralized systems," ACM Transactions on Computer Systems, vol. 3, no. 2, May 1985, 145–159.

    Article  Google Scholar 

  10. M. Mizuno, M. L. Neilsen and R. Rao, "A Token based distributed mutual exclusion algorithm based on Quorum Agreements," 11th Intl. Conference on Distributed Computing Systems, May 1991, 361–368.

    Google Scholar 

  11. M. Naimi, M. Trehel and A. Arnold, "A log(n) distributed mutual exclusion algorithm based on path reversal", Journal of Parallel and Distributed Computing, vol. 34, 1996, 1–13.

    Article  Google Scholar 

  12. M. L. Neilsen, and M. Mizuno, "A DAG-based algorithm for distributed mutual exclusion," 11th Intl. Conference on Distributed Computing Systems, May, 1991, 354–360.

    Google Scholar 

  13. V. A. Pham and A. Karmouch, "Mobile Software Agents: An Overview", IEEE Communications Magazine, Jul. 1988, 26–37.

    Google Scholar 

  14. K. Raymond, "A tree-based algorithm for distributed Mutual Exclusion," ACM Transactions on Computer Systems, vol. 7, no. 1, Feb. 1989, 61–77.

    Article  MathSciNet  Google Scholar 

  15. G. Ricart and A. Agrawala, "An optimal algorithm for mutual exclusion in computer networks," Communications of the ACM, vol. 24, no. 1, Jan. 1981, 9–17.

    Article  MathSciNet  Google Scholar 

  16. B. Sanders, "The information structure of distributed mutual exclusion algorithms," ACM Transactions on Computer Systems, vol. 5, no. 3, Aug. 1987, 284–299.

    Article  Google Scholar 

  17. M. Singhal, "A heuristically-aided algorithm for mutual exclusion in distributed systems," IEEE Transactions on Computers, vol. 38, no. 5, May 1989, 651–662.

    Article  Google Scholar 

  18. M. Singhal, "A dynamic information-structure mutual exclusion algorithm for distributed systems," IEEE Transactions on Parrallel and Distributed Systems, vol. 3, no. 1, Jan. 1992, 121–125.

    Article  Google Scholar 

  19. M. Singhal, "A Taxonomy of Distributed Mutual Exclusion", Journal of Parallel and Distributed Computing, vol. 18, 1993, 94–101.

    Article  MATH  Google Scholar 

  20. Suzuki and T. Kasami, "A distributed mutual exclusion algorithm," ACM Transactions on Computer Systems, vol. 3, no. 4, Nov. 1985, 344–349.

    Article  Google Scholar 

  21. R. H. Thomas, "A majority consensus approach to concurrency control for multiple copy databases," ACM Transactions on Database Systems, vol. 4, no. 2, Jun. 1979, 180–209.

    Article  Google Scholar 

  22. C. Xu and D. Tao, "Building Distributed Applications with Aglet", http://www.cs.duke.edu/chong/aglet

  23. N. Minar, K.H. Kramer and P. Maes, "Cooperative Mobile Agents for Dynamic network Routing", in Software Agents for Future Communication Systems, Springer-Verlag, 1999.

    Google Scholar 

  24. J. Cao, X.B. Wang, and S.K. Das, "A Framework of Using Cooperating Mobile Agents to Achieve Load Sharing in Distributed Web Server Groups", to appear Proc. 5th Int–l Conference on Algorithms and Architectures for Parallel Processing (ICA3PP), Oct. 2002, Beijing, China.

    Google Scholar 

  25. J. Cao, X.B. Wang, S. Lo and S.K. Das, "A Consensus Algorithm for Synchronous Distributed Systems using Mobile Agent", to appear in Proc. 2002 Pacific Rim Int–l Symposium on Dependent Computing, Tskuba, Japan, Dec. 2002.

    Google Scholar 

  26. R. S. Gray, G. Cybenko, D. Kotz, and D. Rus. "Mobile agents: Motivations and State of the Art", In Jeffrey Bradshaw, editor, Handbook of Agent Technology, AAAI/MIT Press, 2001.

    Google Scholar 

  27. S. Lodha and A. Kshemkalyani, "A Fair Distributed Mutual Exclusion Algorithm", IEEE Trans. On Parallel and Distributed Systems, Vol. 11, No. 6, June 2000, pp. 537–549.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cao, J., Wang, X., Wu, J. (2002). A Mobile Agent Enabled Fully Distributed Mutual Exclusion Algorithm. In: Suri, N. (eds) Mobile Agents. MA 2002. Lecture Notes in Computer Science, vol 2535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36112-X_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-36112-X_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00085-3

  • Online ISBN: 978-3-540-36112-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics