<?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=Key-based_routing</id>
	<title>Key-based routing - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://en.zaoniao.it/index.php?action=history&amp;feed=atom&amp;title=Key-based_routing"/>
	<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Key-based_routing&amp;action=history"/>
	<updated>2026-05-15T10:21:25Z</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=Key-based_routing&amp;diff=5621&amp;oldid=prev</id>
		<title>Admin: Created page with &quot;{{#seo: |title= Key-based routing. All about cryptocurrency - zaoniaoWiki |keywords=Key, based, routing, KBR, method, hash, tables |description=Key-based routing (KBR) is a lo...&quot;</title>
		<link rel="alternate" type="text/html" href="http://en.zaoniao.it/index.php?title=Key-based_routing&amp;diff=5621&amp;oldid=prev"/>
		<updated>2019-06-07T05:37:43Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;{{#seo: |title= Key-based routing. All about cryptocurrency - zaoniaoWiki |keywords=Key, based, routing, KBR, method, hash, tables |description=Key-based routing (KBR) is a lo...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{#seo:&lt;br /&gt;
|title= Key-based routing. All about cryptocurrency - zaoniaoWiki&lt;br /&gt;
|keywords=Key, based, routing, KBR, method, hash, tables&lt;br /&gt;
|description=Key-based routing (KBR) is a lookup method used in conjunction with distributed hash tables and certain other overlay networks. While DHTs provide a method to find a host responsible for a certain piece of data.&lt;br /&gt;
}}&lt;br /&gt;
&lt;br /&gt;
'''Key-based routing''' ('''KBR''') is a lookup method used in conjunction with [[distributed hash table]]s (DHTs) and certain other [[overlay network]]s. While DHTs provide a method to find a host responsible for a certain piece of data, KBR provides a method to find the ''closest'' host for that data, according to some defined metric. This may not necessarily be defined as physical distance, but rather the number of network hops.&lt;br /&gt;
&lt;br /&gt;
==Key-based routing networks==&lt;br /&gt;
* [[Freenet]]&lt;br /&gt;
* [[GNUnet]]&lt;br /&gt;
* [[Kademlia]]&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
&lt;br /&gt;
* [[Distributed_hash_table#Overlay_network|Distributed Hash Table - Overlay Network]]&lt;br /&gt;
* [[Anonymous P2P]]&lt;br /&gt;
&lt;br /&gt;
==Source==&lt;br /&gt;
&lt;br /&gt;
[http://wikipedia.org/ http://wikipedia.org/]&lt;br /&gt;
[[Category:Data storage]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
		
	</entry>
</feed>