Key-based routing

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by imported>Citation bot at 18:37, 21 December 2023 (Add: publisher. | Use this bot. Report bugs. | Suggested by Abductive | Category:Computer network stubs | #UCB_Category 120/547). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Refimprove

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

<templatestyles src="Reflist/styles.css" />

  1. Script error: No such module "citation/CS1".
  2. Script error: No such module "citation/CS1".
  3. Script error: No such module "citation/CS1".

Script error: No such module "Check for unknown parameters".

Template:Asbox