Key-based routing
 | This article needs additional citations for verification. (September 2019) |
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.[1][2][3][4]
Key-based routing networks
See also
References
- ^ "FreeNet - key based distributed file system".
- ^ "P2P Networking and Applications - John Buford, Heather Yu, Eng Keong Lua - Google Książki".
- ^ "Distributed and Cloud Computing: From Parallel Processing to the Internet of ... - Kai Hwang, Jack Dongarra, Geoffrey C. Fox - Google Książki".
- ^ "Medical Imaging Informatics - Google Książki".
 | This computer networking article is a stub. You can help Wikipedia by expanding it. |