抖动环境下文件复制节点选择算法

发布时间：2019-04-26 09:08

【摘要】：文件复制技术是把负载分散在复制节点上,避免服务器超载,减少服务器响应延迟和查询路径的长度,以达到较高查询率的有效方法。因此文件复制节点的选择就成为了首要考虑的问题。P2P文件共享系统因为节点的加入和离开,甚至节点失效造成拓扑结构会不断地变换,选择一个文件处理性能好,抖动性弱的节点作为复制节点就显得非常重要。提出一种新的文件复制节点选择算法NDC(New Dynamic and Capacity Algorithm),通过在复制节点的选取上考虑抖动性因素,减少节点离开或者失效造成较长的通信延迟和用户体验的降级,提高文件击中率。由于网络的热点文件不断变化,会出现不同倾斜查询的情况,对NPC处理倾斜性查询文件的能力进行了分析。通过在P2Psim上进行的大量实验表明,NPC算法选出的节点处理文件性能好,抖动性弱,可以提供更精确的文件复制节点。
[Abstract]:File replication is an effective method to spread the load on the replication node, avoid the overload of the server, reduce the response delay and the length of the query path, so as to achieve a higher query rate. Therefore, the selection of file replication nodes has become the primary concern. P2P file sharing system because of the addition and departure of nodes, and even the failure of nodes caused by topological structure will be constantly changed, select a file processing performance is good. It is very important to use weak trembling nodes as replication nodes. A new file replication node selection algorithm, NDC (New Dynamic and Capacity Algorithm), is proposed to reduce the long communication delay and user experience degradation caused by node departure or failure by considering the buffeting factor in the selection of replication nodes. Increase the hit rate of documents. Due to the continuous change of hot-spot files in the network, there will be different skew queries. The ability of NPC to deal with tilting query files is analyzed in this paper. A large number of experiments on P2Psim show that the node selected by NPC algorithm has good processing performance and weak buffeting ability, which can provide more accurate file copy nodes.
【作者单位】：山东师范大学信息与工程学院;山东工商学院计算机科学与技术学院;
【基金】：国家自然科学基金项目(61070175)
【分类号】：TP393.02

【二级参考文献】