基于Gnutella的LRU查询算法改进  

An Improved Algorithm for Least Recently Used based on Gnutella

作　　者：王春枝[1] 孙航[1] 陈宏伟[1] 

机构地区：[1]湖北工业大学计算机学院,湖北武汉430068

出　　处：《湖北工业大学学报》2012年第2期15-18,共4页Journal of Hubei University of Technology

基　　金：国家自然科学基金项目(61170135);湖北省自然科学基金项目(2010CDA011);武汉市科技局项目(201050231084;201210421134);湖北省教育厅科研重点项目(D201114094)

摘　　要：Gnutella网络模型是无结构的P2P网络中一种采用范围受限的洪泛方式来扩散查询消息.随着网络规模的不断扩大,这些消息将耗费大量的节点处理时间、吞噬网络带宽,最终必然会导致网络的过载和拥塞.为解决此问题,采用一种基于小世界网络模型的LRU查询算法,该算法利用LRU的思想来维护邻居节点的信息.理论和仿真实验证明该算法能减少搜索时间、降低搜索开销和提高查询算法的效率.Gnutella network model is used to spread and inquire messages by a flooding method based on limited scope in the area of unstructured P2P networks.With the constant expansion of network,the messages will spend a lot of node processing time and network bandwidth,which will eventually lead to overloading and congestion of the networks.In order to solve this problem,a small-world network model was adopted,based on LRU inquiry algorithrm,using the idea of LRU,to maintain neighbor nodes information.Theory certification and simulation experiment results confirmed that the algorithm can reduce search time and cost,and increase the inquiry algorithm efficiency.

关 键 词：LRU 泛洪 小世界 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]