Key-based routing

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
gollark: Meaning?
gollark: Print a few million lines of colored text perhaps?
gollark: What would a good benchmark be?
gollark: Sure, why not.
gollark: If you want to implement *loads* of features, it may make sense to just call into lua from another language, but that is probably unnecessary.

See also

References
  1. "FreeNet - key based distributed file system".
  2. "P2P Networking and Applications - John Buford, Heather Yu, Eng Keong Lua - Google Książki".
  3. "Distributed and Cloud Computing: From Parallel Processing to the Internet of ... - Kai Hwang, Jack Dongarra, Geoffrey C. Fox - Google Książki".
  4. "Medical Imaging Informatics - Google Książki".


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.