View source for 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.

== Overview 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|API]]. Thus, an operation such as <code>get(...)</code> or <code>put(...)</code> will return immediately and the user of the [[Api|API]] can either block the operation to wait for the completion or add a listener that gets notified when the operation completes.

== Features ==

* Java 6 DHT implementation with non-blocking IO (java.nio) and a binary protocol
* XOR-based iterative routing with an ID space of 160bit 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

== See also ==
* [[Kademlia]]
* [[Pastry (DHT)]]

==Source==
[http://wikipedia.org/ http://wikipedia.org/]