Although it is very effective in content search, standard flooding mechanism is very inefficient because it results in a great amount of redundant messages which greatly restricts the scalability of networks. To solve the issue of redundancy message increasing quickly but coverage growing slowly when hop is high, this paper proposes a new lightweight partial flooding strategy named PartialFlood. In PartialFlood, when node receives a message it will not send the message to all its neighbors but select only part of them randomly as the object to forward. Analysis and simulation results show that the PartialFlood can greatly minimize the number of redundant messages while retaining the same message propagating scope as that of standard flooding, and it can be effectively used in P2P searching.%标准洪泛机制在内容搜索方面有很高的效率,但同时产生了大量的冗余消息,严重制约网络的可扩展性.针对标准洪泛算法中高跳时冗余消息数量迅速增加而覆盖范围增长缓慢的问题,提出新的轻量级部分洪泛搜索策略PartialFlood,PartialFlood在跳数较高时不再向所有邻居转发查询消息,仅随机选取部分节点作为转发对象.分析和实验结果表明:PartialFlood能够在保持高覆盖范围的前提下,大大减少冗余消息的数量,高效应用于P2P搜索.
展开▼
