DistHash: A robust P2P DHT-based system for replicated objects
Ciprian Dobre, Florin Pop, Valentin Cristea

TL;DR
DistHash is a P2P overlay network designed for efficient, consistent, and fault-tolerant sharing of replicated objects in large-scale, dynamic environments, addressing challenges of complex, decentralized systems.
Contribution
The paper introduces DistHash, a novel P2P system with optimized routing, consistency, and fault tolerance for large-scale distributed object sharing.
Findings
Achieves optimal message routing in hop-count and throughput
Provides an effective consistency model among replicas
Ensures fault tolerance in highly dynamic infrastructures
Abstract
Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution and application-level multicast applications. In this paper we present DistHash, a P2P overlay network designed to share large sets of replicated distributed objects in the context of large-scale highly dynamic infrastructures. We present original solutions to achieve optimal message routing in hop-count and throughput, provide an adequate consistency approach among replicas, as well as provide a fault-tolerant substrate.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPeer-to-Peer Network Technologies · Caching and Content Delivery · Opportunistic and Delay-Tolerant Networks
