检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]青岛农业大学理学与信息科学学院,青岛266109 [2]华南农业大学信息学院,广州510642
出 处:《计算机科学》2013年第2期129-132,144,共5页Computer Science
基 金:国家自然科学基金项目(60573043;60773175);广东省科技计划基金项目(2008B021300010;2009020315014)资助
摘 要:为了降低P2P文件共享的交易风险,提高交易成功率,促进网络良性持续发展,构造了一种基于节点兴趣分组的信誉模型,并建立了与之相应的节点信誉计算方法、文件共享过程、访问控制策略。本模型借鉴人类社区的思想,利用节点兴趣聚簇的特性,避开现有的全局信任模型和局部信任模型的局限性,将节点按照所需资源的类型划分成兴趣组,以此达到提高资源定位率及交易成功率、增强网络安全的目的。通过模拟仿真和分析表明,本模型具有正确性、可行性的特点,并且较已有的信任模型在完备性和安全性等方面有较大改进,达到了预期的设计目标。In order to decrease the risk of exchange, increase the rate of successful exchange, and make the P2P file sha- ring system to develop continually, a reputation model based on interest group was proposed, and relevant peer reputa- tion calculating method, file exchanging process, access controlling strategy were designed. The reputation model is de- rived from the thought of human community, and keeps away from the shortage of the whole trust model and the partial trust model. All peers are grouped by the type of their resources, thus the efficiency of file exchange is higher, and the security of the network is stronger. Our simulation experiments and theoretical analysis of the reputation model prove that our model has the characteristics of correctness and feasibility. Compared with the former trust models, the model has higher maturity and security.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7