Abstract:
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.

BibTeX Entry:

@InProceedings{AAB04disc,
   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,
}