Divisional searching strategy based on degree in unstructured P2P networks
Chang Yu-cun · Journal of Computer Applications · 2008
Flooding is widely used in current unstructured P2P systems because of its simplicity.Although it is effective in content search,flooding is very inefficient because it results in a great number of redundant messages.This greatly restricts the scalability of the networks.The existing improved search mechanism can reduce the redundant messages but also usually significantly shrink the query coverage range.DSearch,a divisional search strategy based on degree was proposed,with the objective of minimizing the number of redundant messages and retaining the same message propagating scope as that of standard flooding.DSearch divided the searching into two stages.At each stage DSearch controlled the number of messages to forward by a function,and then it chose objects to send according to its neighbors' degree.Analysis and simulation results show that the DSearch provides a low overhead broadcasting facility that can be effectively used in P2P searching.