摘要
分布式哈希表[1](Distributed Hash Table,DHT)是一种非常有前景的对等网络拓扑模型。介绍了目前最流行的3种P2P网络模型,其中重点描述了具有自组织、可扩展、负载均衡,以及较好的容错性的结构化对等网络模型。通过分析基于DHT的CAN,Chord,Tapestry,Pastry的4种结构对等网系统的路由定位模型,比较并总结出4种网络不同的路由定位策略、路由性能、路由效率及各自的特点。
Distributed Hash Table is a eompellent peer - to - peer meshwork topology model. This paper introduced the most popularly three peer- to- peer network models, especially the structured peer- to- peer model who is self- organized, easy extended,equilibrious loaded and strong anti - mistaking. Then analyzed four DHT - based peer - to - peer route locating models, CAN, Chord, Tapestry and Pastry, compared and summarized their route locating tactics, efficency and traits.
出处
《现代电子技术》
2007年第2期118-120,共3页
Modern Electronics Technique
