Statements (50)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:architecture
gptkb:distributed_system |
| gptkbp:advantage |
fault tolerance
complexity high availability network overhead security risks churn management data consistency challenges low lookup latency vulnerability to Sybil attacks |
| gptkbp:enables |
load balancing
efficient data retrieval node addition and removal |
| gptkbp:example |
gptkb:CAN
gptkb:dessert gptkb:tapestry gptkb:Kademlia Chord |
| gptkbp:feature |
decentralization
self-organization no central coordinator resilience to node failure scalable routing |
| gptkbp:handles |
data consistency
data replication network partitioning dynamic membership large-scale systems |
| gptkbp:numberOfLocations |
data across multiple nodes
|
| gptkbp:proposedBy |
late 1990s
|
| gptkbp:provides |
scalability
fault tolerance key-value storage decentralized lookup |
| gptkbp:relatedTo |
gptkb:Ethereum
gptkb:Cassandra gptkb:Freenet gptkb:Amazon_Dynamo gptkb:BitTorrent gptkb:IPFS NoSQL databases |
| gptkbp:usedIn |
gptkb:cryptocurrency
file sharing peer-to-peer networks decentralized storage |
| gptkbp:uses |
hash functions
|
| gptkbp:bfsParent |
gptkb:Distributed_Computing
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Distributed Hash Table
|