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]
Key-based routing networks[]
See also[]
- Public-key cryptography
- Distributed Hash Table - Overlay Network
- Anonymous P2P
References[]
- ^ Buford, John; Yu, Heather; Lua, Eng Keong (11 March 2009). P2P Networking and Applications - John Buford, Heather Yu, Eng Keong Lua - Google Książki. ISBN 9780080921198.
- ^ Hwang, Kai; Dongarra, Jack; Fox, Geoffrey C. (18 December 2013). Distributed and Cloud Computing: From Parallel Processing to the Internet of ... - Kai Hwang, Jack Dongarra, Geoffrey C. Fox - Google Książki. ISBN 9780128002049.
- ^ Bui, Alex A. T.; Taira, Ricky K. (December 2009). Medical Imaging Informatics - Google Książki. ISBN 9781441903853.
 | This computer networking article is a stub. You can help Wikipedia by . |
Categories:
- Anonymity networks
- Routing
- File sharing networks
- Distributed data storage
- Network architecture
- Cryptography
- Cryptographic protocols
- Key-based routing
- Computer network stubs