摘要
泛洪式路由(Flooding)是在非结构化对等网络中进行有效资源查找的主要方式,但其路由过程将产生大量冗余消息,因而严重制约了其可扩展性。随节点数增多,泛洪式路由的网络带宽消耗也变得异常严重。针对非结构化P2P网络拓扑的特点,结合对已有的非结构化P2P搜索算法的研究,文章提出了一种基于兴趣域的非结构化P2P搜索算法,使得节点能在短时间内查找到有效的资源,减少了查询信息量,缩短了路由路径,提高了搜索效率。
Flooding which is used in unstructured Peer to Peer Network for searching and locating information is a primary routing algorithm. But the routing produces a large number of redundant messages so that it restricts the P2P networks＇ expansibility. Moreover, with the increment of the number of nodes, the consumption of network bandwidth in unstructured P2P network has become a serious problem. Motivated by the topology of the unstructured P2P network and the analysis of existing search schemes for unstructured P2P network, we propose an interest-based search scheme for unstructured peer-to-peer network. Searching, peers can find resource in the shortest time, so the routing distance and searching message are reduced, and the network efficiency is improved.
出处
《计算机与数字工程》
2011年第9期75-78,共4页
Computer & Digital Engineering
关键词
P2P网络
非结构化
兴趣域
搜索机制
网络拓扑
peer-to-peer（P2P） network, unstructured, interest domain, search mechanism, network topological
