CAJ | 학술논문

针对非结构化对等网络中资源搜索算法效率不高、搜索过程中产生的冗余消息数过大而造成的网络带宽消耗及网络拥塞等状况,提出一种基于路由搜索机制的改进算法.该算法利用邻节点之间的关系,生成邻节点的转发路由表.实验证明,该算法有效抑制了网络中冗余搜索消息数量,减小了网络带宽的消耗,有效避开了搭便车节点,从而提高了搜索效率.
침대비결구화대등망락중자원수색산법효솔불고、수색과정중산생적용여소식수과대이조성적망락대관소모급망락옹새등상황,제출일충기우로유수색궤제적개진산법.해산법이용린절점지간적관계,생성린절점적전발로유표.실험증명,해산법유효억제료망락중용여수색소식수량,감소료망락대관적소모,유효피개료탑편차절점,종이제고료수색효솔.
Concerning the low efficiency of resources search and the dramatic consumption of bandwidth when searching in unstructured P2P network, the authors put forward an improved algorithm based on routing mechanism. The algorithm generated neighboring nodes' routing tables by analyzing the neighboring relations. Simulation results show that the proposed algorithm effectively reduces the network traffic and consumption of bandwidth and keeps away from selfish nodes. Meanwhile, it improves the efficiency of resources search.