P2P重叠网的立体化研究与设计  

Building Three-Dimensional Network for P2P Overlay Network

作　　者：徐海斌[1] 张云华[1] 张烨飞[1] 朱光[1] 

机构地区：[1]浙江理工大学信电学院,杭州310018

出　　处：《计算机系统应用》2011年第4期69-71,共3页Computer Systems & Applications

摘　　要：在分析研究DHT算法与B+树模型的基础上提出一种新的网络模型——圆台网络,该圆台模型将DHT网络由二维带到三维,由平面转成了立体,通过把节点的路由表设成可动态增长的二维表,现实了节点的立体查寻,提高查询效率。有限长度的后继列表的更新及有限的传递次数,确保了整个网络的稳定畅通,在确保网路畅通的同时也使得系统在维护开销上比chord算法大为降低。Analyzing the algorithm of DHT and studying the thinking of the B ＋ tree,we got a new network models-Frustum of a cone network.This network models will bring us to three-dimensional network from two-dimensional network,from plane to solid.Setting the end points,the routing table to be dynamic growth two-dimensional tables,we realized three-dimensional end point search and improved query efficiency.The updates of Limited length of follow-up list and limited delivery times,ensure that the entire network will be stable,also ensure that the system be much less than the chord algorithm in costs of the maintenance.

关 键 词：P2P网络 圆台网络 路由 父节点 查寻 维护开销 

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