Skip to content


Personal tools
You are here: Home » Publications » Bounded version vectors

Bounded version vectors

Document Actions
Up one level
José Bacelar Almeida, Paulo Sérgio Almeida, Carlos Baquero. Bounded version vectors. In Rachid Guerraoui, editor, Proceedings of DISC 2004: 18th international symposium on distributed computing, number 3274 in LNCS, pages 102--116. 2004. Springer Verlag.

Version vectors play a central role in update tracking under optimistic distributed systems, allowing the detection of obsolete or inconsistent versions of replicated data. Version vectors do not have a bounded representation; they are based on integer counters that grow indefinitely as updates occur. Existing approaches to this problem are scarce; the mechanisms proposed are either unbounded or operate only under specific settings. This paper examines version vectors as a mechanism for data causality tracking and clarifies their role with respect to vector clocks. Then, it introduces bounded stamps and proves them to be a correct alternative to integer counters in version vectors. The resulting mechanism, bounded version vectors, represents the first bounded solution to data causality tracking between replicas subject to local updates and pairwise symmetrical synchronization.

View disc04.pdf (PDF document 223Kb)

   author = "Jos\'e Bacelar Almeida and Paulo S\'ergio Almeida and Carlos Baquero",
   title = "Bounded Version Vectors",
   booktitle = "Proceedings of {DISC} 2004: 18th International Symposium on
Distributed Computing",
    year =      2004,
    editor = "Rachid Guerraoui",
    pages = "102--116",
    publisher = "Springer Verlag",
    series = "LNCS",
    number = 3274,

Please read the Copyright Notice before downloading.
Created by gsd
Last modified 2004-10-11 05:51 PM
« May 2015 »
Su Mo Tu We Th Fr Sa
          1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30

Powered by Plone

This site conforms to the following standards: