<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=TomP2P</id>
	<title>TomP2P - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=TomP2P"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=TomP2P&amp;action=history"/>
	<updated>2026-05-15T08:08:22Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.32.0</generator>
	<entry>
		<id>http://en.zaoniao.it/index.php?title=TomP2P&amp;diff=7247&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;'''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...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=TomP2P&amp;diff=7247&amp;oldid=prev"/>
		<updated>2019-07-28T13:13:49Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;TomP2P&amp;#039;&amp;#039;&amp;#039; is a &lt;a href=&quot;/Distributed_hash_table&quot; title=&quot;Distributed hash table&quot;&gt;distributed hash table&lt;/a&gt; which provides a decentralized key-value infrastructure for distributed applications. Each peer has a table that can be configured...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''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.&lt;br /&gt;
&lt;br /&gt;
== Overview and Key Concept ==&lt;br /&gt;
&lt;br /&gt;
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 &amp;lt;code&amp;gt;get(...)&amp;lt;/code&amp;gt; or &amp;lt;code&amp;gt;put(...)&amp;lt;/code&amp;gt; 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.&lt;br /&gt;
&lt;br /&gt;
== Features ==&lt;br /&gt;
&lt;br /&gt;
* Java 6 DHT implementation with non-blocking IO (java.nio) and a binary protocol&lt;br /&gt;
* XOR-based iterative routing with an ID space of 160bit as in [[Kademlia]]&lt;br /&gt;
* Data replication and best effort data protection&lt;br /&gt;
* Distributed tracker and Mesh-based distributed tracker (B-Tracker)&lt;br /&gt;
* NAT traversal via UPNP and NAT-PMP&lt;br /&gt;
&lt;br /&gt;
== See also ==&lt;br /&gt;
* [[Kademlia]]&lt;br /&gt;
* [[Pastry (DHT)]]&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>