Jump to content

Key-based routing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bender the Bot (talk | contribs) at 23:36, 15 August 2019 (top: switch to .com for Google Books; same content, but more trustworthy top-level domain, replaced: https://books.google.pl/ → https://books.google.com/ (3), hl=pl& → hl=en& (3)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

  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".