JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness

DOI10.1080/15427951.2008.10129165MaRDI QIDQ3400886zbMATH OpenOpenAlexFDO

Authors Jan Zich, Yoshiharu Kohayakawa, Vojtěch Rödl, Vaidy S. Sunderam

Publication date 27 January 2010

Published in Internet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/15427951.2008.10129165

zbMATH Keywords

peer-to-peer networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• \(\mathrm{SKIP}^{+}\), a self-stabilizing skip graph
• Random walk search in unstructured P2P
• Adding structure to unstructured peer-to-peer networks: the use of small-world graphs
• Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
• Optimizing random walk search algorithms in P2P networks

Cited in

(1)

• Stability of peer-to-peer networks under greedy peering

This page was built for publication: JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness

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