P2P路由算法Tapestry及其改进

Routing algorithm improvement about Tapestry for P2P

由于Peer-to-peer系统在文件共享方面有着巨大的应用前景,基于分布式哈希表(Distributed Hash Table)的结构化P2P网络得到了广泛的关注,P2P技术也日趋成熟,各国在分布式路由算法方面也进行了大量的工作,提出了各种可扩展性很好的分布式路由算法,例如:Chord,Pastry,CAN,Tapestry等等。本文提出的P2P网络的Tapestry路由算法并对该算法进行了改进,提高搜索文件和路由的效率,同时,也对P2P网络的健壮性和扩展性能以加强。

Because the Peer-to-peer net system has the huge application prospect in the file sharing aspect,based on Distributional Hasche Table the structurized P2P network obtained the widespread attention,the P2P technology has been also mature day by day,various countries have also carried on the massive work in the distributional routing algorithm aspect,proposed each kind of extendibility very good distributional routing algorithm,for example：Chord,Pastry,CAN,Tapestry and so on. This article proposed P2P the network Tapestry routing algorithm and has made the improvement to this algorithm, enhances the search document and route＇s efficiency, simuhaneously, also strengthens to the P2P network＇s toughness and the expansion performance.