2008 journal article

Shortest-path routing in randomized DHT-based Peer-to-Peer systems

COMPUTER NETWORKS, 52(18), 3307–3317.

By: C. Wang n & K. Harfoush n

author keywords: Distributed hash tables; Randomized networks; Shortest-path routing
TL;DR: A novel routing protocol, RASTER, that approximates shortest overlay routes between nodes in randomized DHTs and provides a forwarding overhead of merely a small constant number of bitwise operations, a routing performance close to optimal, and a better resilience to churn. (via Semantic Scholar)
Source: Web Of Science
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.