Key-based routing

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Key-based routing" – news · newspapers · books · scholar · JSTOR (September 2019) (Learn how and when to remove this message)

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]

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

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

• v
• t
• e