多线程电子通信网络对等数据节点选取仿真  

Multi-Threaded Electronic Communication Network Peer-to-Peer Data Node Selection Simulation

作　　者：张卓[1] ZHANG Zhuo(Collegeof Humanities&Information Changchun University of Technology,Changchun Jilin 130122,China)

机构地区：[1]长春工业大学人文信息学院

出　　处：《计算机仿真》2019年第11期276-279,326,共5页Computer Simulation

摘　　要：针对当前通信网络对等数据节点选取方法中存在的选取的节点数据检索时延较长,以及选取的节点易出现过负载状况等问题,提出多线程电子通信网络对等数据节点选取方法。对多线程电子通信网络及其节点布局进行分析,给出网络建模假设,结合网络内对等数据节点的应用带宽累积分布函数,分析对等数据节点数据接收速率的均匀分布状态,综合节点效益与开销,构建对等数据节点的效用函数;根据网络内各对节点的直接信任值与推荐信任值,进行综合信任评价计算与节点信誉值计算,结合网络内各节点的效用值,在候选节点中选取对等数据节点。实验结果表明,与当前节点选取方法相比,所提方法选取节点的数据检索时延明显缩短,节点负载能够比较稳定的处于均衡状态。In the current communication network peer data node selection methods, the retrieval delay of node data is too long and the selected nodes are prone to the overload. Therefore, this article focuses on a method to select peer-to-peer data node in multi-thread electronic communication network selection. The multi-thread electronic communication network and its node layout were analyzed. Then the network modeling hypothesis was given. Combined with the application bandwidth cumulative distribution function of peer-to-peer data nodes in network, the uniform distribution state of the data receiving rate of peer-to-peer node was analyzed. On the basis of integrating the benefits and costs of nodes, the utility functions of peer-to-peer data node were constructed. According to the direct trust value and the recommended trust value of each pair of nodes in network, the comprehensive trust evaluation and the node reputation value were calculated. After combining the utility values of all the nodes in network, the peer-to-peer data nodes were selected from the candidate nodes. Following conclusion can be drawn from experimental results. Compared with the current node selection method, the data retrieval delay of the proposed method is shortened greatly. Meanwhile, the node load can be relatively stable in equilibrium.

关 键 词：通信网络 对等节点 效用函数 信誉值 节点选取 

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