Abstract
In a replication system, version vectors are logged with replicas to detect conflicts among operations. Dynamic replications where replicas are frequently created and destroyed suffer from expensive logging overhead caused by inactive entries of version vectors. Although the rigmarole of pruning vectors can delete inactive entries, the vectors may be incompatible without additional information, which also causes another overhead. This paper proposes a novel version vector called loǵ (log-prime) consisting of only three entries. By encoding based on the characteristics of prime numbers, loǵ version vectors of fixed size can be logged concisely with no pruning technique at a little sacrifice in accuracy. Simulation studies show that loǵ version vectors are accurate enough to detect almost all conflicts in the replication systems where all replicas are fully synchronizing.
| Original language | English |
|---|---|
| Pages (from-to) | 614-620 |
| Number of pages | 7 |
| Journal | Information Processing Letters |
| Volume | 110 |
| Issue number | 14-15 |
| DOIs | |
| State | Published - 1 Jul 2010 |
| Externally published | Yes |
Keywords
- Distributed computing
- Distributed systems
- Loǵ version vector
- Replication system
- Version vector
Fingerprint
Dive into the research topics of 'Loǵ version vector: Logging version vectors concisely in dynamic replication'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver