基于物理位置与访问局部性的P2P路由算法  

P2P Routing Algorithm Based on Physical Location and Access Locality

作　　者：贺道德[1] 邓晓衡[1] 

机构地区：[1]湖南工业大学计算机与通信学院,株洲412008

出　　处：《计算机工程》2009年第8期146-149,共4页Computer Engineering

基　　金：国家自然科学基金资助项目(60573127);中国博士后科学基金资助项目(20060400879);湖南省自然科学基金资助项目(06JJ30032);湖南省高等学校科学研究基金资助项目(07C231)

摘　　要：针对现有结构化P2P系统物理位置和访问资源的局部性,以Pastry系统为基础,提出一种P2P路由算法。给出相应拓扑结构进行网络构造,在路由时先考虑节点的物理邻接关系。理论分析与仿真实验结果表明,该算法可以减小结构化P2P系统的定位延迟和路径长度。Aiming at the current structured P2P system＇s locality of physical location and accessing resources, this paper takes the current popular structured P2P system Pastry as a foundation, proposes a P2P routing algorithm and gives relevant topology. When routing, the node route to the nodes which are physical adjacent to it. Theory analysis and the experimental results show that the algorithms proposed in this paper have improved the performance of P2P system about routing delays and the length of the path.

关 键 词：对等网 分布式哈希表 路由延迟 拓扑 

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