摘要
结构化P2P网络中由DHT(分布式哈希表)来决定网络中资源的映射位置,这种方式在系统的可扩展性和资源的定位速度上都有了很大的提高。但是,在利用DHT构建覆盖网络时,并没有过多地考虑底层物理拓扑结构,因而产生了逻辑拓扑与物理拓扑的失配问题,造成了很多不必要的路由,降低了资源定位的效率。针对这种情况进行了大量的文献调研,对结构化P2P网络拓扑匹配现有的算法进行了介绍,分析了各种算法的优缺点,并在现有算法的基础上进一步展开研究。
In the structured P2P networks, the location of the resources in the network is decided by DHT( distributed hash table). This method make a great improvement in the system scalability and the speed of searching resources. But, when building the overlay network with DHT, it doesn' t take the physical topology into consideration. As a result, there are a lot of redundant massages in the network and a low efficiency in the search resources because of the mismatching problem between logical topology and physical topology. Considering these problems, this paper introduced several topology-matching techniques and compares among them. Based on the survey, this paper outlined this future research directions.
出处
《计算机应用研究》
CSCD
北大核心
2009年第8期2807-2809,2826,共4页
Application Research of Computers
基金
全国教育科学"十一五"规划教育部重点课题(DCA060097)