PercolationNET: a Multi-tree P2P Overlay Network Supporting High Coverage Search
摘要内容：
Flooding with a time-to-live constraint is a popular algorithmin unstructured peer-to-peer(P2P) networks. However, blind ?ooding may cause a large amount of networktraf?c.Moreover, it cannot guarantee acquiring all required data objects, especially for rareones. To mitigate these problems, this paper proposes PercolationNET, a multi-treesub-overlay, which is built on top of an existing P2P overlay (named original overlay).PercolationNET organises peers in a tree-based structure which facilitates reliable andef?cient message dissemination for search. The search process is divided into two stages.A query message is ?rst propagated on the original overlay, and then broadcast alongthe sub-overlay PercolationNET. PercolationNET combines the advantages of fastcoverage speed in ?ooding-based scheme and low traf?c cost in tree-based scheme.The experimental results of PercolationNET compared with FloodNet con?rm thesuperiority of PercolationNET in achieving faster coverage speed and lowermessage cost.
关键词：
- peer-to-peer network；high coverage search；multi-tree architecture
