摘要
随着网页数量的快速增长,集中式的网络搜索引擎已经不能在性能上满足需求。为此提出了一种新的基于P2P网络的分布式PageRank算法。该算法引入了间接消息发送机制来降低存在于各个网络结点之间的网络拥塞。同时讨论了该算法的收敛时间和带宽消耗。实验证明该算法提供了新的方式能在提高精确度的基础上降低通信量。
With the rapid increase of the web pages,the centralized network search engine can not satisfy the capability.In this situation,a distributed PageRank algorithm based on P2P network is proposed.Indirect transmission is introduced in this paper to reduce communication overhead between net nodes and to achieve scalable communication.The relationship between convergence time and bandwidth consumed are also discussed.The experiments verify that this algorithm provides a novel way to reduce the network traffic w...
出处
《微计算机信息》
北大核心
2008年第3期104-105,108,共3页
Control & Automation
基金
国防预研(编号不公开)
