摘要
简要介绍了对等网络的发展现状,总结其三个显著特点——信息分散、关系平等、结构灵活,引入了近年来流行的结构化覆盖网及基于其的分布式哈希表;主要介绍了Chord、Pastry、CAN、Tapestry等结构化覆盖网算法的特点,该类算法主要是系统开销小、路由效率高、易于维护、扩展性好,并对这几种算法进行比较;最后,提出如果引入广播算法,这两种算法的完美结合将会使路由效率达到最优,能进一步提高算法效率。
The dissertation simply introduces the developmental actuality of peer-to-peer network, summarizes its three notable characteristics decentralized information ,equal relationship and flexible structure,and introduces popularly structured overlay networks in the latest years and Distributed Hash Table based on it. It puts emphases upon the characteristics of the structured overlay network algorithms such as Chord, Pastry, CAN, Tapestry and so on. Little system spending, high route efficiency, easy maintenance and good expansibility are its most characteristics. The dissertation also tells us the differences of these algorithms. Finally, it advances that if combined with broadcasting algorithm, it will result in the best excellent route efficiency, and then it will improve the efficiency of the algorithms.
出处
《现代计算机》
2005年第11期50-53,共4页
Modern Computer
