一种支持多维资源描述的高效P2P路由算法  

An Efficient P2P Routing Algorithm Supporting Multi-Dimensional Resource Description

作　　者：宋伟[1] 李瑞轩[1] 卢正鼎[1] 於光灿[1] 

机构地区：[1]华中科技大学 计算机科学与技术学院,湖北武汉430074

出　　处：《软件学报》2007年第11期2851-2862,共12页Journal of Software

基　　金：Nos.60403027;60773191(国家自然科学基金);No.2005ABA258(湖北省自然科学基金);No.SKLSE05-07(软件工程国家重点实验室开放基金)~~

摘　　要：在分析现有P2P(peer to peer)路由算法的基础上,提出了一种基于二阶矩定位、支持多维资源数据描述的高效资源路由算法——FAN(flabellate addressable network)路由算法.FAN算法将节点映射到统一的多维笛卡尔空间,并以节点相对空间原点的二阶矩作为子空间管理和资源搜索的依据.FAN路由算法具有O(log(N/k))的高路由效率,在节点加入和退出FAN网络时,更新路由信息的代价为O(klog(N/k)).实验结果表明,FAN路由算法具有路由效率高、维护代价小的优点,是一种P2P环境中支持多维资源数据描述的高效结构化资源路由算法.而且,目前部分基于CAN(content-addressable network)网络的改进算法也可以在FAN网络中适用,并获得更好的路由效率和更低的维护代价.Analyzing the existing P2P （peer to peer） routing algorithms, Flabellate Addressable Network （FAN） routing algorithm, an efficient second-moment-based resource routing algorithm supporting multi-dimensional resource description is proposed. Peers are mapped into a multi-dimensional Cartesian space with FAN routing algorithm that manages the subspaces and searches resources based on the peers＇ second-moment. The routing efficiency of FAN algorithm is up to O（log（N/k））. When a peer joins and leaves the FAN network, the cost for updating routing messages is O（klog（N/k））. The experimental results show that FAN routing algorithm has advantages of high efficiency of routing and low cost of network maintenance, and is an efficient structured P2P resource routing algorithm supporting multi-dimensional resource description. Some improved routing algorithms based on CAN （content-addressable network） can also be implemented in FAN network, and they can obtain better routing efficiency and lower maintenance cost.

关 键 词：P2P(peer to peer) FAN(flabellate ADDRESSABLE network)路由算法 二阶矩定位 资源搜索 多维资源描述 

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