云计算中基于Chord算法的研究与改进

发布时间：2018-04-24 14:48

本文选题：云计算 + 对等网络　；参考：《计算机工程与设计》2013年10期

【摘要】：定义了云服务器为P2P网络拓扑结构的基本节点,引进Chord协议对其进行资源定位与搜索。由于Chord算法一方面没有考虑节点异构的问题,另一方面其查询路由表存在着较大的冗余信息,因此从这两方面着手,对Chord算法进行了改进。建立了一个基于主从式结构的多Chord环模型,对环中节点的查询路由表进行分析研究,提出一个新的路由表计算公式,在删除冗余信息的基础上,充分利用查询路由表的空间资源,将节点的路由查找的覆盖范围从Chord环的1/2提升到3/4,最终提升到整个Chord环。实验结果表明,改进后的算法在平均路由跳数和平均网络延迟都有明显的减少,从而提高了资源搜索的效率。
[Abstract]:This paper defines cloud server as the basic node of P2P network topology, and introduces Chord protocol to locate and search its resources. Since the Chord algorithm does not consider the problem of heterogeneous nodes on the one hand, and the routing table query has a large amount of redundant information on the other hand, the Chord algorithm is improved from these two aspects. A multi- ring model based on master-slave structure is established. The query routing table of nodes in the ring is analyzed and studied. A new formula for calculating the routing table is proposed, on the basis of deleting redundant information. By making full use of the spatial resources of the query routing table, the coverage of routing lookup of nodes is raised from 1 / 2 of the Chord loop to 3 / 4, and finally to the whole Chord ring. Experimental results show that the improved algorithm can significantly reduce the average number of routing hops and the average network delay, thus improving the efficiency of resource search.
【作者单位】：重庆邮电大学计算机科学与技术学院;
【分类号】：TP393.02

【参考文献】