Key-based routing
From Wikipedia, the free encyclopedia
 |
This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2009) |
 |
This article needs attention from an expert on the subject. See the talk page for details. WikiProject Computer networking or the Computer networking Portal may be able to help recruit an expert. (November 2008) |
Key-based routing (KBR) is a lookup method used in conjunction with distributed hash tables (DHTs) and certain other overlay networks. 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.[citation needed]
[edit] Key-based routing networks
[edit] See also
 |
This computer networking article is a stub. You can help Wikipedia by expanding it. |
