检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:金瑜[1] 顾进广[2] 赵红武[2] 古志民[1]
机构地区:[1]北京理工大学计算机科学技术学院,北京100081 [2]武汉科技大学计算机科学与技术学院,湖北武汉430081
出 处:《华中科技大学学报(自然科学版)》2008年第1期44-48,共5页Journal of Huazhong University of Science and Technology(Natural Science Edition)
基 金:中国博士后科研基金资助项目(20060400275);江苏省博士后科研基金资助项目(0601009B);湖北省教育厅科研资助项目(Q200711004)
摘 要:针对现有对等网中声誉管理的不足,基于预投票的声誉管理协议,提出了一个适用于超级节点对等网SP2PRep,在SP2PRep中,叶子节点预先向超级节点汇报声誉投票,声誉查询仅在超级节点层进行.给出了SP2PRep协议描述、实现的消息格式和体系结构.分析和仿真表明:SP2PRep既满足了声誉投票的安全性需求,又能够减少网络带宽消耗、提高声誉查询效率和快速识别恶意节点.SP2PRep协议能够很好地改善超级节点P2P系统的安全状况,促进它们的应用.Disadvantages of current protocols for reputation management in peer-to-peer networks were studied. On the basis of pre-voting, SP2PRep (supernode peer-to-peer reputation) protocol was presented in its application for super-peer networks. In SP2PRep, the votes on the reputation were reported to their supermodes by the leaf modes in advance and inquiring about the reputation was carried out in the level of supermodes only. The protocol, its message formats and architecture for the imple- mentation were described. Simulation results showed that SP2PRep protocol not only meets the requirement of security of reputation votes but also improves the performance of reputation management significantly. For example, in SP2PRep protocol the network cost was small, the efficiency of reputation searches was great and the speed of identifying malicious nodes was fast. Hereafter SP2PRep could improve the security status of super-peer systems and accelerate the application of them.
分 类 号:TP393.01[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7