Skip to main content
SpringerLink
Log in

A Distributed Transactional Memory Protocol for Dynamic Networks

  • Conference paper
  • First Online:
Book cover Computational Intelligence, Communications, and Business Analytics (CICBA 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 775))

Abstract

In this paper, we present a novel distributed transactional memory protocol called TRAIL using gossip based approach for dynamic networks. TRAIL supports the three basic operations for distributed transaction memory: publish, look up, and move. The protocol runs on a dynamic network where the network structure changes frequently. Maintaining a fixed structure (tree, clusters) on such networks is a considerable overhead. Our protocol uses an unstructured communication overlay and uses gossip based approach for delivery of messages to all the nodes in the network. TRAIL can handle concurrent requests by combining requests passing through the same node. The protocol supports safety, fairness and liveness properties on execution of the algorithms. Performance evaluation of the proposed protocol establishes our claim both for static and dynamic network scenarios.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Attiya, H., Gramoli, V., Milani, A.: A provably starvation free distributed directory protocol. In: Proceedings of the 12th International Conference on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 405–419 (2010)

    Google Scholar 

  2. Attiya, H., Gramoli, V., Milani, A.: Combine: an improved directory-based consistency protocol. Technical, LPD-2010-002, EPFL (2010)

    Google Scholar 

  3. Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195–208 (2007)

    Article  MATH  Google Scholar 

  4. Sharma, G., Busch, C., Srinivasagopalan, S.: Distributed transactional memory for general networks. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium (2012)

    Google Scholar 

  5. Zhang, B., Ravindran, B.: Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory. In: IEEE International Symposium on Parallel and Distributed Processing (IPDPS) (2010)

    Google Scholar 

  6. Zhang, B., Ravindran, B.: BA: relay: a cache-coherence protocol for distributed transactional memory. In: Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS), pp. 48–53 (2009)

    Google Scholar 

  7. Herlihy, M., Kuhn, F., Tirthapura, S., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. Theory Comput. Syst. 39, 875–901 (2006). Springer Science+Business Media, Inc.

    Article  MathSciNet  MATH  Google Scholar 

  8. Shah, D.: Gossip algorithms. Found. Trends Netw. 3(1), 1–125 (2008). doi:10.1561/1300000014

    MathSciNet  Google Scholar 

  9. Iwanicki, K., van Steen, M., Voulgaris, S.: Gossip-based clock synchronization for large decentralized systems. In: Keller, A., Martin-Flatin, J.-P. (eds.) SelfMan 2006. LNCS, vol. 3996, pp. 28–42. Springer, Heidelberg (2006). doi:10.1007/11767886_3

    Google Scholar 

  10. Tang, S., Jaho, E., Stavrakakis, I., Koukoutsidis, I., Van Mieghem, P.: Modeling Gossip-based content dissemination and search in distributed networking. Comput. Commun. 34, 765–779 (2011). Elsevier

    Article  Google Scholar 

  11. Newman, M.: Networks: An Introduction. Oxford University Press Inc., New York (2010)

    Book  MATH  Google Scholar 

  12. Márk Jelasity “Gossip”: Springer, 2011. Preprint version of: Di Marzo Serugendo, G., Gleizes, M.-P., Karageorgos, A. (eds.): Self-Organising Software: From Natural to Artificial Adaptation. Natural Computing Series, pp. 139–162. Springer, Heidelberg (2011). doi:10.1007/978-3-642-17348-6_7

  13. Sharma, G., Busch, C.: An analysis framework for distributed hierarchical directories. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, Rudrapatna K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 378–392. Springer, Heidelberg (2013). doi:10.1007/978-3-642-35668-1_26

    Chapter  Google Scholar 

  14. Sharma, G., Busch, C.: Distributed queuing in dynamic networks. In: Censor-Hillel, K., King, V. (eds.) Ninth International Workshop on Foundations of Mobile Computing 2013 (FOMC 2013). EPTCS, vol. 132, pp. 1–19 (2013). doi:10.4204/EPTCS.132.1

  15. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., Van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. (TOCS) 25(3), 8 (2007). TOCS Homepage archive

    Article  Google Scholar 

  16. Voulgaris, S., Jelasity, M., van Steen, M.: A robust and scalable peer-to-peer gossiping protocol. In: Moro, G., Sartori, C., Singh, Munindar P. (eds.) AP2PC 2003. LNCS, vol. 2872, pp. 47–58. Springer, Heidelberg (2004). doi:10.1007/978-3-540-25840-7_6

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Calcutta, Kolkata, West Bengal, India

    Moumita Chatterjee & Sanjit K. Setua

Authors
  1. Moumita Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sanjit K. Setua
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moumita Chatterjee .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal, India

    J. K. Mandal

  2. Department of Computer and System Sciences, Visva Bharati University, Bolpur Santiniketan, West Bengal, India

    Paramartha Dutta

  3. Department of Information Technology, Calcutta Business School, Kolkata, India

    Somnath Mukhopadhyay

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Chatterjee, M., Setua, S.K. (2017). A Distributed Transactional Memory Protocol for Dynamic Networks. In: Mandal, J., Dutta, P., Mukhopadhyay, S. (eds) Computational Intelligence, Communications, and Business Analytics. CICBA 2017. Communications in Computer and Information Science, vol 775. Springer, Singapore. https://doi.org/10.1007/978-981-10-6427-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6427-2_22

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6426-5

  • Online ISBN: 978-981-10-6427-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation