基于分布式聚类的Peer-to-Peer路由算法  

DISTRIBUTED CLUSTER BASED PEER-TO-PEER ROUTING ALGORITHM

作　　者：邵浩然[1,2] 吴镇德[1] 王杰华[2] 马范援[1] 

机构地区：[1]上海交通大学计算机科学与工程系,上海200030 [2]南通工学院现教中心,江苏南通226007

出　　处：《计算机应用与软件》2005年第9期12-14,129,共4页Computer Applications and Software

基　　金：国家自然科学基金重大国际合作项目(60221120145);上海市科委基础研究重点项目(02DJ14045);南通市科委创新计划项目(A0020)资助

摘　　要：提出了分布式聚类算法,该算法自动对地理邻近的对等结点聚类,消除了集中式聚类算法的单点瓶颈问题,及分布式Binning算法的landmark放置问题;提出了一种基于该聚类的邻居路由算法,该算法消除了na?ve算法路由效率低、IP-snoop算法实现困难及处理开销大、directed算法需要处理超级节点失效时容错问题。实验结果表明,基于分布式聚类的Peer-to-Peer(P2P)路由算法比现有的结构化路由算法减少了近一倍的路由跳转和路由时延。This paper proposed a new distributed clustering algorithm, which cluster overlay peers that are topologically close and addresses single-point bottleneck problem of existing centralized clustering algorithm and landmark placement of distributed Binning algorithm. This paper also proposed neighbor algorithm based on the cluster that addresses low efficiency of nagve algorithm ,implementation difficulty and high overhead of IP-snooping algorithm,the use of explicit fault-tolerant mechanism of directed algorithm. Experimental results show that distributed cluster based Peer-to-Peer（P2P） routing algorithm is able to improve physical hops and route delay for nearly 50%.

关 键 词：Peer—to—Peer路由 聚类 PEER-TO-PEER 路由算法 聚类算法 分布式 LANDMARK 瓶颈问题 算法实现 节点失效 

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