Skip to main content
SpringerLink
Log in

Bounded Version Vectors Using Mazurkiewicz Traces

  • Chapter
  • First Online:
Advanced Computing and Systems for Security

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1178))

  • 258 Accesses

Abstract

Version vectors constitute an essential feature of distributed systems that enable the computing elements to keep track of causality between the events of the distributed systems. In this article, we study a variant named Bounded Version Vectors. We define the semantics of version vectors using the framework of Mazurkiewicz traces. We use these semantics along with the solution for the gossip problem to come up with a succinct bounded representation of version vectors in distributed environments where replicas communicate via pairwise synchronization.

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

Access this chapter

Log in via an institution
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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Almeida, J.B., Almeida, P.S., Baquero, C.: Bounded version vectors. In: DISC, pp. 102–116 (2004)

    Google Scholar 

  2. Gilbert, Seth, Lynch, Nancy A.: Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51–59 (2002)

    Article  Google Scholar 

  3. Mukund, M., Narayan Kumar, K., Milind A. Sohoni. Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1), 221–239 (2003)

    Google Scholar 

  4. Mukund, Madhavan, Sohoni, Milind A.: Keeping track of the latest gossip in a distributed system. Distrib. Comput. 10(3), 137–148 (1997)

    Article  Google Scholar 

  5. Saito, Yasushi, Shapiro, Marc: Optimistic replication. ACM Comput. Surv. 37(1), 42–81 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chennai Mathematical Institute, Chennai, India

    Madhavan Mukund, Gautham Shenoy R. & S. P. Suresh

  2. CNRS UMI 2000 ReLaX, Chennai, India

    Madhavan Mukund & S. P. Suresh

Authors
  1. Madhavan Mukund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gautham Shenoy R.
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. P. Suresh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Madhavan Mukund .

Editor information

Editors and Affiliations

  1. A.K. Choudhury School of Information Technology, University of Calcutta, Kolkata, West Bengal, India

    Rituparna Chaki

  2. DAIS, Ca' Foscari University, Venezia, Italy

    Agostino Cortesi

  3. Faculty of Computer Science, Bialystok University of Technology, Bialystok, Poland

    Khalid Saeed

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

    Nabendu Chaki

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Mukund, M., Shenoy R., G., Suresh, S.P. (2021). Bounded Version Vectors Using Mazurkiewicz Traces. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 1178. Springer, Singapore. https://doi.org/10.1007/978-981-15-5747-7_3

Download citation

Publish with us

Policies and ethics

Search

Navigation