Using Tapestry algorithm in Elixir to construct a fault-tolerant distributed hash table for sharing files in a p2p network
-
Updated
Aug 15, 2020 - Elixir
Using Tapestry algorithm in Elixir to construct a fault-tolerant distributed hash table for sharing files in a p2p network
Distributed Hash Tables (DHT) Implementation // Pastry + Chord
Implementation of Pastry Algorithm
An Elixir implementation of Pastry Protocol
A simulation of Pastry protocol: a scalable, decentralized object location and routing protocol for large-scale peer-to-peer systems
Implemented distributed hash table(DHT) with pastry protocol
Add a description, image, and links to the pastry-protocol topic page so that developers can more easily learn about it.
To associate your repository with the pastry-protocol topic, visit your repo's landing page and select "manage topics."