Jump to content

Key-based routing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Nethgirb (talk | contribs) at 22:22, 19 July 2007 (dab). 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. KBR improves the efficiency of decentralized information retrieval in peer-to-peer networks.

Key based routing networks

See also