CAJ | 학술논문

研究非结构化P2P网络的搜索机制,提出基于布莱姆过滤器(BF)路由表的改进算法.该算法利用BF技术生成路由条目并在一定范围内相互交换本地路由表,使节点能够了解一定范围内的节点共享信息,实现有针对性的搜索,避免传统的盲目性搜索.仿真结果表明,该算法查询搜索时产生的消息数最比传统算法减少一个数量级,并能够获得较好的查全率.
연구비결구화P2P망락적수색궤제,제출기우포래모과려기(BF)로유표적개진산법.해산법이용BF기술생성로유조목병재일정범위내상호교환본지로유표,사절점능구료해일정범위내적절점공향신식,실현유침대성적수색,피면전통적맹목성수색.방진결과표명,해산법사순수색시산생적소식수최비전통산법감소일개수량급,병능구획득교호적사전솔.
This paper studies search mechanism in unstructured Peer-to-Peer(P2P) network and introduces an improved algorithm based on Bloom Filter(BF). The algorithm uses BF technology to generate routing item and exchanges local routing table in limited range, which makes nodes know others' shared information in this range. So it can realize purposive search and avoid traditional blind search. Simulation results show that the amount of message created by queries of this algorithm is one order of magnitude lower than traditional search and this algorithm can gain better recall rote.