TomP2P
TomP2P is a distributed hash table which provides a decentralized key-value infrastructure for distributed applications. Each peer has a table that can be configured either to be disk-based or memory-based to store its values.
01Overview and key concept
TomP2P stores key-value pairs in a distributed hash table. To find the peers and store the data in the distributed hash table, TomP2P uses an iterative routing approach. The underlying protocol for all the communication with other peers uses state-less request-reply messaging. Since TomP2P uses non-blocking communication, a future object is required to keep track of future results. This key concept is used for all the communication (iterative routing and DHT operations, such as storing a value on multiple peers) in TomP2P and it is also exposed in the API. Thus, an operation such as get(...) or put(...) will return immediately and the user of the API can either block the operation to wait for the completion or add a listener that gets notified when the operation completes.
02Features
- Java 6 DHT implementation with non-blocking IO (java.nio) and a binary protocol
- XOR-based iterative routing with an ID space of 160-bit as in Kademlia
- Data replication and best effort data protection
- Distributed tracker and Mesh-based distributed tracker (B-Tracker)
- NAT traversal via UPNP and NAT-PMP
Sources and credits
This article is adapted from the Wikipedia article “TomP2P”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.