Jump to content

Key-based routing

Edit links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Ffffrr (talk | contribs) at 19:12, 5 November 2022 (Importing Wikidata short description: "Technique used in computer networking"). 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]

Key-based routing networks

See also

References

  1. ^ 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.
  2. ^ 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.
  3. ^ Bui, Alex A. T.; Taira, Ricky K. (December 2009). Medical Imaging Informatics - Google Książki. ISBN 9781441903853.
Stub icon

This computer networking article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Key-based_routing&oldid=1120208345"