PercolationNET: A multi-tree P2P overlay network supporting high coverage search

DOI10.1080/17445760903225668MaRDI QIDQ3550911zbMATH OpenOpenAlexFDO

Authors Ruixuan Li, Cuihua Zuo, Haiying Shen, Kunmei Wen, Xiwu Gu

Publication date 7 April 2010

Published in International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)

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

zbMATH Keywords

peer-to-peer networkflooding-based schemehigh coverage searchmulti-tree architecturesub-overlaytree-based scheme

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Novel approaches to efficient flooding search in peer-to-peer networks
• Broadcasting in unstructured peer-to-peer overlay networks
• On coverage bounds of unstructured peer-to-peer networks
• Divisional searching strategy based on degree in unstructured P2P networks
• Scalable percolation search on complex networks

Cited in

(3)

• On coverage bounds of unstructured peer-to-peer networks
• Broadcasting in unstructured peer-to-peer overlay networks
• Scalable percolation search on complex networks

Describes a project that uses

Uses Software

• Chord

This page was built for publication: PercolationNET: A multi-tree P2P overlay network supporting high coverage search

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