Home / Current Issue / Paper 1710338
Balancing CAP: Achieving Eventual Consistency in Distributed Systems using CRDTs and Kademlia DHT
Subject area: Science,Engineering and Technology · Area of research: Distributed Systems
DOI: 10.64388/IREV9I2-1710338-8995
Abstract
Distributed systems face fundamental challenges when balancing consistency, availability, and partition tolerance as described by the CAP theorem. While Kademlia Distributed Hash Tables (KDHT) provide excellent availability and partition tolerance, they struggle with consistency guarantees. This paper explores how Conflict-free Replicated Data Types (CRDTs) can be integrated into KDHT architectures to achieve eventual consistency without compromising high availability, enabling the development of resilient distributed applications that preserve data integrity even in the presence of network partitions. I present a comprehensive theoretical framework, detailed implementation strategies, performance analysis, and demonstrate the approach through multiple case studies, including distributed counters, and collaborative text editing. Our analysis shows that this integration provides strong eventual consistency guarantees while maintaining the scalability and fault tolerance benefits of decentralized systems.
Keywords
Consistency, CRDT, DHT, Eventual Consistency, Kademlia
References
[1] Brewer, E. A. (2000). Towards robust distributed systems. In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing (PODC '00), Portland, Oregon, USA.
[2] Maymounkov, P., & Mazieres, D. (2002). Kademlia: A peer-to-peer information system based on the XOR metric. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA.
[3] Shapiro, M., Preguiça, N., Baquero, C., & Zawirski, M. (2011). Conflict-free replicated data types. In Proceedings of the 13th International Conference on Stabilization, Safety, and Security of Distributed Systems (SSS '11), Grenoble, France.
[4] Żmuda, M., Opioła, Ł., Dutka, Ł., Słota, R., & Kitowski, J. (2016). Kademlia with consistency checks as a foundation of borderless collaboration in open science services. Future Generation Computer Systems, 54, 234-244.
[5] Almeida, P. S., Shoker, A., & Baquero, C. (2018). Delta state replicated data types. Journal of Parallel and Distributed Computing, 111, 162-173.
[6] Kleppmann, M., & Beresford, A. R. (2017). A conflict-free replicated JSON datatype. IEEE Transactions on Parallel and Distributed Systems, 28(10), 2733-2746.
[7] Preguiça, N., Marquès, J. M., Shapiro, M., & Letia, M. (2009). A commutative replicated data type for cooperative editing. In Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS '09), Montreal, Quebec, Canada.
[8] Sanjuan, H., Poyhtari, S., & Teixeira, P. (2019). Merkle-CRDTs: Merkle-DAGs meet CRDTs. arXiv preprint arXiv:1910.06270.
[9] Baquero, C., Almeida, P. S., & Shoker, A. (2014). Making operation-based CRDTs operation-based. In Proceedings of the First Workshop on Principles and Practice of Eventual Consistency (PaPEC '14), Amsterdam, Netherlands.
[10] Gilbert, S., & Lynch, N. (2002). Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. ACM SIGACT News, 33(2), 51-59.
How to cite this paper
@article{1710338,
author = {Kelechi M Onyekwere},
title = {Balancing CAP: Achieving Eventual Consistency in Distributed Systems using CRDTs and Kademlia DHT},
journal = {Iconic Research And Engineering Journals},
year = {2025},
volume = {9},
number = {2},
pages = {1130-1149},
issn = {2456-8880},
url = {https://www.irejournals.com/formatedpaper/1710338.pdf},
abstract = {Distributed systems face fundamental challenges when balancing consistency, availability, and partition tolerance as described by the CAP theorem. While Kademlia Distributed Hash Tables (KDHT) provide excellent availability and partition tolerance, they struggle with consistency guarantees. This paper explores how Conflict-free Replicated Data Types (CRDTs) can be integrated into KDHT architectures to achieve eventual consistency without compromising high availability, enabling the development of resilient distributed applications that preserve data integrity even in the presence of network partitions. I present a comprehensive theoretical framework, detailed implementation strategies, performance analysis, and demonstrate the approach through multiple case studies, including distributed counters, and collaborative text editing. Our analysis shows that this integration provides strong eventual consistency guarantees while maintaining the scalability and fault tolerance benefits of decentralized systems.},
keywords = {Consistency, CRDT, DHT, Eventual Consistency, Kademlia},
month = {August},
doi = {https://doi.org/10.64388/IREV9I2-1710338-8995}
}