检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:许淑华[1] XU Shu-hua(University of Jinan,Jinan Shandong,250022,China)
机构地区:[1]济南大学,山东济南250022
出 处:《计算机仿真》2024年第12期414-417,486,共5页Computer Simulation
基 金:山东省社会科学规划研究项目(21CSHJ01)。
摘 要:为了有效保证网络信任数据的顺利传输,提出一种无结构P2P网络信任数据传输路径构建算法。通过数据偏移量调整信任模型历史局限,利用事件数据流特点和历史信息精准区分“异常数据”,完成无结构P2P网络信任数据采集。结合切片模型对无结构P2P网络信任数据流量展开分配。通过社会关系权值建立通讯录,以无结构P2P网络历史节点的发送时延作为成功传输的依据,同时展开路由选择。利用节点最大副本数对队列展开调度,确定最终的传输路径,完成无结构P2P网络信任数据传输路径构建。实验结果表明,所提算法可以有效降低能量消耗和丢包率,提升网络节点存活数,减少发送时延。In order to effectively ensure the smooth transmission of network trust data,a trust data transmission path construction algorithm for unstructured P2P networks is proposed.By adjusting the historical limitations of the trust model through data offset,and utilizing the characteristics of event data flow and historical information to accurately distinguish"abnormal data",unstructured P2P network trust data collection is completed.Combining the slicing model to allocate trust data traffic in unstructured P2P networks.Establish a contact list through social relationship weights,and use the transmission delay of historical nodes in unstructured P2P networks as the basis for successful transmission,while also conducting routing selection.Utilize the maximum number of replicas of nodes to schedule the queue,determine the final transmission path,and complete the construction of trust data transmission path in unstructured P2P networks.The experimental results show that the proposed algorithm can effectively reduce energy consumption and packet loss rate,improve the survival number of network nodes,and reduce transmission delay.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.127.127