摘要
针对非结构化P2P网络基本洪泛算法中冗余消息数过多、搜索效率低等问题,提出了一种新资源搜索策略R2SB2N,该算法通过在节点中引入邻居-邻居节点表来存储当前节点邻居的邻居信息,同时结合邻居节点的活跃程度和资源命中数,利用转移公式转发查询消息。仿真结果表明,新策略可以降低消息冗余率,提高资源搜索成功率,是一种有效的资源搜索策略。
For the problem of the unstructured peer-to-peer networks that there are too many redundant messages and the searchefficiency is too low in traditional algorithms,the article proposed a resource searching mechanic which named R2SB2 N.The new al-gorithm introduced neighbor-neighbor node information,meanwhile considered of neighbor nodes' activeness and resource hit num-bers to forward search messages.Experimental results show that the new strategy can reduce the message redundancy rate and im-prove the resource search success rate which is an efficient resource search mechanic.
出处
《电脑知识与技术(过刊)》
2015年第6X期229-230 232,232,共3页
Computer Knowledge and Technology