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

DOI10.1016/J.COMNET.2008.07.014MaRDI QIDQ2518512zbMATH OpenOpenAlexWikidataFDO

Authors Chih-Chiang Wang, Khaled Harfoush

Publication date 16 January 2009

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2008.07.014

zbMATH Keywords

distributed hash tablesrandomized networksshortest-path routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Routing networks for distributed hash tables
• scientific article; zbMATH DE number 1950682
• Degree-optimal routing for P2P systems
• scientific article; zbMATH DE number 1931792
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks

Cited in

(1)

• Degree-optimal routing for P2P systems

This page was built for publication: Shortest-path routing in randomized DHT-based peer-to-peer systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2518512)