当前位置:主页 > 管理论文 > 移动网络论文 >

Kademlia DHT网络活跃节点的测量与应用研究

发布时间:2018-05-06 08:37

  本文选题:Kademlia + 活跃节点 ; 参考:《华中科技大学》2014年博士论文


【摘要】:自2002年Kademlia协议算法被提出后,基于Kademlia的DHT网络研究与应用备受关注,各类系统及应用软件层出不穷。支持该协议的DHT网络文件分享系统常常拥有百万级的用户数,使得Kademlia成为实际应用最广泛的文件分享网络协议之一。与其它P2P网络系统一样,节点动态参与网络的特性影响了Kademlia DHT网络的性能。然而在KademliaDHT网络中,有些节点长时间参与网络,无私的进行网络文件分享,成为网络中的核心节点,我们称其为活跃节点。本文将基于Kademlia DHT网络中这些活跃节点的特性,针对目前研究与应用中的几个核心问题进行展开: ·节点在线行为分析与预测:在Kademlia DHT网络中,节点的在线情况和参与网络的行为直接决定了整个网络的性能。所以节点的在线行为分析与预测一直是研究的关注点。 ·内容发布与查询性能提升:目前各类支持Kademlia DHT网络的客户端软件主要用于文件分享。所以在Kademlia DHT网络的测量研究中,如何利用测量结果提升内容发布与查询性能一直备受关注。现有的Kademlia DHT网络虽然支撑了百万级用户的实时内容发布与查询,但还是有部分内容发布后查询不到,性能还有待提高。 ·基于Kademlia DHT网络的衍生服务:在Kademlia DHT网络中,参与节点把自身拥有的带宽、存储、计算等网络资源贡献出来共同组成了现在的文件分享网络。如何更好的去利用这些通过Kademlia DHT网络集结的网络资源衍生更多的网络服务是一个新的研究方向。 本文针对上述问题,基于活跃节点对KAD网络和Mainline DHT网络进行了测量分析。本文的研究从以下三个方面展开:(1)Kademlia DHT网络中活跃节点的获取;(2)基于活跃节点的内容发布与查询算法改进;(3)基于Kademlia DHT稳定节点的Web缓存系统。这些工作得到国家自科基金No.61301127、No.61371080和No.61370231的支持;以及国家“十二五”科技支撑计划项目No.2011BAK08B01和No.2011BAK08B02-01的资助。 本文取得的研究成果包括以下几个方面: 1. Kademlia DHT网络中活跃节点的快速获取机制:本文对KAD网络和Mainline D-HT网络进行了测量分析,发现可以使用节点ID在路由表中的出现频率来表征节点在网络中的活跃度,并给出了活跃节点的快速定位获取算法。通过该算法获得的活跃节点较为稳定,较长时问持续参与网络。 2.基于活跃节点的内容发布与查询算法:本文测量分析了Kademlia DHT网络的内容发布与查询过程,提出了基于活跃节点的内容发布与查询算法,通过该算法,能显著地提高内容发布与查询的性能。 3.基于KAD稳定节点的Web缓存系统:针对基于Kademlia DHT的Web缓存系统中缓存节点的稳定问题,本文提出了基于活跃节点的缓存节点选择算法,选择KAD网络中较为稳定的节点来担当Web缓存节点,从而提高系统性能。
[Abstract]:Since the Kademlia protocol algorithm was proposed in 2002, the research and application of DHT network based on Kademlia have attracted much attention. The DHT network file sharing system which supports this protocol often has millions of users, which makes Kademlia one of the most widely used file sharing protocols in practice. Like other P2P networks, the dynamic participation of nodes affects the performance of Kademlia DHT networks. However, in the KademliaDHT network, some nodes participate in the network for a long time, selfless network file sharing, become the core node in the network, we call it an active node. Based on the characteristics of these active nodes in Kademlia DHT network, this paper aims at several core problems in current research and application. Node online behavior analysis and prediction: in Kademlia DHT network, the performance of the whole network is directly determined by the online behavior of the node and the behavior of the participating network. Therefore, the online behavior analysis and prediction of nodes has been the focus of research. Content publishing and query performance improvement: at present, all kinds of client software supporting Kademlia DHT network are mainly used for file sharing. Therefore, in the measurement research of Kademlia DHT network, how to use the measurement results to improve the performance of content publishing and query has attracted much attention. Although the existing Kademlia DHT network supports the real-time content publishing and querying of millions of users, there are still some contents that can not be queried after publishing, and the performance still needs to be improved. Derivative Services based on Kademlia DHT Network: in Kademlia DHT network, participating nodes contribute their own bandwidth, storage, computing and other network resources to form the present file sharing network. How to make better use of these network resources accumulated through Kademlia DHT network to derive more network services is a new research direction. In this paper, KAD network and Mainline DHT network are measured and analyzed based on active nodes. In this paper, the following three aspects of research are carried out: getting active nodes in Kademlia DHT network) improving the content publishing and query algorithm based on active nodes and improving the Web cache system based on Kademlia DHT stable nodes. The work is supported by the National Science and Technology Foundation No. 61301127 No. 61371080 and No.61370231; and supported by the National 12th Five-Year Plan for Science and Technology support Project No.2011BAK08B01 and No.2011BAK08B02-01. The research results of this paper include the following aspects: 1. The Fast access Mechanism of active nodes in Kademlia DHT Networks: this paper measures and analyzes the KAD network and Mainline D-HT network, and finds that the frequency of node ID appearing in the routing table can be used to characterize the node activity in the network. A fast location acquisition algorithm for active nodes is presented. The active nodes obtained by this algorithm are stable and participate in the network continuously for a long time. 2. Content publishing and querying algorithm based on active nodes: this paper measures and analyzes the content publishing and querying process of Kademlia DHT network, and puts forward the content publishing and querying algorithm based on active nodes. It can significantly improve the performance of content publishing and query. 3. Web Cache system based on KAD stable Node: aiming at the problem of Cache Node Stability in Web Cache system based on Kademlia DHT, this paper proposes an active Node based Cache Node selection algorithm. The more stable nodes in KAD network are selected to act as Web cache nodes to improve system performance.
【学位授予单位】:华中科技大学
【学位级别】:博士
【学位授予年份】:2014
【分类号】:TP393.02

【参考文献】

相关期刊论文 前4条

1 严鹤;刘威;张戈;程文青;;基于活跃节点的KAD网络高效查询方法[J];计算机科学;2014年12期

2 ;An implementation and optimization for scalable DHT crawler[J];Science China(Information Sciences);2010年04期

3 张宇翔;杨冬;张宏科;;P2P网络中Churn问题研究[J];软件学报;2009年05期

4 刘祥涛;程学旗;李洋;陈小军;白硕;刘悦;;eMule网络最佳节点标识[J];软件学报;2011年09期



本文编号:1851574

资料下载
论文发表

本文链接:https://www.wllwen.com/guanlilunwen/ydhl/1851574.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户e3174***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com