Using uncertainty DHT to solve non-transitive connectivity problems in overlay network

DOI10.3724/SP.J.1087.2008.00575MaRDI QIDQ3643607zbMATH OpenOpenAlexFDO

Authors Wang Xiang-Hui Guo-Yin Zhang

Publication date 9 November 2009

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2008.00575

zbMATH Keywords

distributed hash tables (DHT)non-transitivity connectivity (NTC)P2Predirection

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Algorithms for overlay networks.
• Building self-stabilizing overlay networks with the transitive closure framework
• Degree-optimal routing for P2P systems
• On Stabilizing Departures in Overlay Networks
• A novel constant degree and constant congestion DHT scheme for peer-to-peer networks

This page was built for publication: Using uncertainty DHT to solve non-transitive connectivity problems in overlay network

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