摘要
针对结构化P2P网络资源定位时寻路跳数过多,逻辑网络和物理网络不匹配等问题,分析了资源定位模型CAN(con-tent addressable network)的基本原理,在CAN的基础上,提出了最小代价路径策略。该策略采用分组模型,组内每个节点中维护一条自身到其它各个节点的最小代价路径,以实现路由本地化,降低覆盖网络的路由跳数和节点间时延;合理的分组保证节点维护开销小的同时,有效地提高了路由效率。最后,通过模拟测试表明了改进策略的有效性。
Resource location in structured P2P network has many problems such as too many hops and the mismatch between the logical network and the physical network.For these problems,a resource locating model,CAN（content addressable network） is analyzed,and based on CAN,a new strategy named minimum cost path within group is introduced.The strategy adopts grouping model.Each node maintains a minimum cost path between the node and other nodes in the same group for the purpose of localizing the routing,decreasing the number of the hops and reducing the delay.The reasonable grouping ensures the nodes keeping low cost and improves the routing efficiency.Finally,a simulation is presented to validate the new strategy.
出处
《计算机工程与设计》
CSCD
北大核心
2010年第20期4400-4403,共4页
Computer Engineering and Design
基金
河南省教育厅自然科学基础研究基金项目(2007520006)
