检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]防灾科技学院信息工程系,河北三河065201
出 处:《科技通报》2015年第10期254-257,共4页Bulletin of Science and Technology
基 金:中央高校基本科研业务费资助(ZY20140213)
摘 要:对P2P网络信誉模型的研究是保证P2P网络稳定运行的基本因素。P2P网络通过节点的直接交换来共享计算机资源和服务,需要进行节点优化选择保证P2P网络的信誉和稳定性。传统方法采用粒子滤波算法实现节点自动控制,当存在多重节点反复组合时,对P2P网络的信誉度评价准确性不好。提出一种基于最优化网格分配节点信息覆盖的P2P网络信誉模型设计方法,构建网络的最优节点选择机制,采用自顶向下的方式分层构造数据聚集树,进行节点信誉信息表征和数学模型构建,实现算法改进。仿真实验表明,采用该模型能有效提高对P2P网络的信誉评价精度,优化网络的节点分布,实现节点最优选择,能够有效抵抗外界干扰和攻击,稳定性较好。The P2P reputation model is studied to ensure the stable operation of the basic factors of P2P network. P2P network through the direct exchange of the nodes to share computer resources and services, we need for a node optimization to ensure the credibility and stability of P2P network. The traditional method of particle filter algorithm is adopted to realize the automatic control of nodes, when there are multiple nodes repeatedly are combined, reputation evaluation accuracy of P2P network is not good. An optimized grid distribution node information covering the reputation of P2P network model design method is proposed based on the optimal node selection mechanism, the construction of network, using the hierarchical structure of the data aggregation tree top-down manner, to build the node reputation information representation and mathematic model, the improved algorithm. Simulation results show that, using this model can effectively improve the accuracy of credit assessment on P2P network, the node distribution network optimization, the realization of peer selection, can effectively resist the external disturbances and attack, good stability.
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.110.128