基于用户访问统计的Chord动态路由机制  

Dynamic routing mechanism of chord based on requests statistics

作　　者：陈柏生[1] 杜吉祥[1] 

机构地区：[1]华侨大学计算机科学与技术学院,福建泉州362021

出　　处：《华中师范大学学报（自然科学版）》2011年第2期204-207,231,共5页Journal of Central China Normal University：Natural Sciences

基　　金：国家自然科学基金资助项目(60805021);福建省自然科学基金资助项目(A0810010);国家侨办课题(10QZR06)

摘　　要：在P2P环境下,单个节点无法准确了解全局资源分布,导致系统查询效率较低.提出一种Chord动态路由机制(DChord),将单个节点的路由表信息扩展至整个标识符空间.依据用户访问统计,将热点区间的路由信息加入节点路由表,并删除低访问率路由项,从而提高系统查询效率,同时维持较小的存储开销.仿真结果表明,DChord路由表存储开销接近基本Chord,平均路径长度维持在3～4跳,并可以有效地降低系统路由负载.Peers have a limited view of global resources distribution in P2P networks which consequently leads to decreased query efficiency. It presented a dynamic routing mechanism of chord in order to extend the finger table of peers to cover the whole resources space. The fingers of hot spots were dynamically included into finger table of peers based on requests statistics, whereas those of low requests statistics were excluded from it. As a result, the system maintained high query efficiency with rather low cache consumption. The experiment results show the cache consumption of the finger table of DChord approximates to that of chord, the average query path length of it roughly ranges from 3 to 4 hops, and it can decrease the system routing loads efficiently.

关 键 词：CHORD 动态路由 用户访问统计 路由负载 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术]