基于预算机制的非结构化P2P网络分段搜索策略  

Divisonal searching strategy based on budget in unstructured P2P network

作　　者：殷嘉乐 

机构地区：[1]陕西师范大学计算机科学学院,陕西西安710062

出　　处：《电子设计工程》2013年第24期124-126,130,共4页Electronic Design Engineering

基　　金：国家自然科学基金面上项目(11172342);教育部"新世纪优秀人才支持计划"资助项目(NCET-11-0674);陕西省自然科学基金项目(2012JM8043)

摘　　要：在非结构化P2P网络中,降低消息冗余,提高搜索的效率,一直是资源搜索的关键问题。目前非结构化P2P网络均采用生存时间(Time-To-Live)机制控制搜索算法的深度,但是同时产生了大量的冗余消息,严重影响了网络的利用率。为了能够在保持高搜索效率的前提下减少冗余消息的数量,提出了一种基于预算机制的非结构化P2P网络分段搜索策略DBudgetSearch。DBudgetSearch将搜索过程分为两个阶段,并在每个阶段中使用预算机制来控制消息转发的数量和导向,根据邻居节点的连接度大小来选择消息的转发对象。分析和试验结果表明,DBudgetSearch导向性好,算法搜索效率高,能够有效减少冗余消息。In unstructed P2P network,it is always a very important question for searching resources to reduce the query redundant message and increase the resource hit ratio. Most existing search algorithms for unstructured P2P network use the Time To Live（TFL） mechanism to control the search depth of the search algorithm,but it results in a lot of redundant messages and affects seriously utilization ratio of network. The existing improved search mechanism can reduce the redundant messages but also be high efficient searching. DBudgetSearch, Divisonal searching strategy based on budget in unstructured P2P network was proposed. DBudgetSearch divided the searching into two stages, At each stage DBudgetSearch controlled the number of messages and direction to forward by a budget mechanism, and then it choose objects to send according to its neighbors degree. Analysis and simulation results show that DBudgetSearch has a good orientation, and higher efficiency,and effectively reduce the number of redundant messages.

关 键 词：点对点网络 预算 生存时间 分段搜索 冗余 

分 类 号：TN98[电子电信—信息与通信工程]