"분산 해시 테이블"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎노트: 새 문단)
 
1번째 줄: 1번째 줄:
 +
==관련된 항목들==
 +
* [[카뎀리아]]
 +
* [[비트토렌트]]
 +
 +
 +
 
== 노트 ==
 
== 노트 ==
  

2020년 12월 16일 (수) 19:59 판

관련된 항목들


노트

  • So how does Kademlia implement a distributed hash table?[1]
  • In a distributed implementation, known as a distributed hash table, or DHT, the hash table is distributed among a set of nodes.[2]
  • Meanwhile, the Distributed Hash Table (DHT) is adopted as the underlying structure to construct the basic UID management methodology.[3]
  • In computing, Chord is a protocol and algorithm for a peer-to-peer distributed hash table.[4]
  • A Distributed Hash Table is a decentralized data store that looks up data based on key-value pairs.[5]
  • Every node in a distributed hash table is responsible for a set of keys and their associated values.[5]
  • A distributed hash table provides incremental scalability of throughput and data capacity as more nodes are added to the cluster.[6]
  • All components of the distributed hash table are built using an asynchronous, event-driven programming style.[6]

소스