Limited search mechanism for unstructured peer-to-peer network

被引：1
|
作者：
Beijing Key Laboratory of Intelligent Telecommunications, Beijing University of Posts and Telecommunications, Beijing 100876, China [1 ]
不详 [2 ]
机构：
[1] Beijing Key Laboratory of Intelligent Telecommunications, Beijing University of Posts and Telecommunications
[2] School of Computer Science, Beijing University of Posts and Telecommunications
来源：
Ruan Jian Xue Bao | / 9卷 / 2132-2150期
关键词：
Limited search; Peer-to-peer; Redundant search path; Unstructured network;
D O I：
10.3724/SP.J.1001.2013.04359
中图分类号：
学科分类号：
摘要：
Reducing the network overhead generated during the search is important in the study of unstructured P2P network. Flooding and random walks are simple and easily implemented. However, a large number of redundant messages generated in the search process are the main reason of producing excessive network overhead. An effective limited search mechanism RFSA (restricted forward search algorithm) is proposed. The search path and redundant search path are defined. As the query messages reaching the node are received by introducing the local messages index caching mechanism, the repeat messages forwarding are eliminated. Using the real-time search path information carried in the search process, the neighbor notes that do not appear in the search path are selected to forward the query messages. Theoretically, the number of messages and network overhead generated by the RFSA. In the simulation, comparative analysis of the limited search mechanism and non-limited mechanism flooding and random walk algorithm is done in the network overhead, query hit rate, search coverage rate, and the number of redundant messages, etc. The results show that this method reduces the generation of a great number of redundant messages, and cuts down the network overload. © 2013 ISCAS.
引用
收藏
页码：2132 / 2150
页数：18
相关论文
共 23 条
  • [1] Stutzbach D., Rejaie R., Duffield N., Sen S., Willinger W., Sampling techniques for large, dynamic graphs, Proc. of the IEEE INFOCOM 2006, pp. 1-6, (2006)
  • [2] Rasti A.H., Stutzbach D., Rejaie R., On the long-term evolution of the two-tier Gnutella overlay, Proc. of the IEEE INFOCOM 2006, pp. 1-6, (2006)
  • [3] Oram A., Peer-to-Peer: Harnessing the Power of Disruptive Technologies, pp. 99-122, (2001)
  • [4] Guntella a protocol development
  • [5] Ripeanu M., Iamnitchi A., Foster I., Mapping the gnutella network, IEEE Internet Computing, 6, 1, pp. 50-57, (2002)
  • [6] Zhong M., Shen K., Seiferas J., The convergence-guaranteed random walk and its applications in peer-to-peer networks, IEEE Trans. on Computers, 57, 5, pp. 619-633, (2008)
  • [7] Gkantsidis C., Mihail M., Saberi A., Random walks in peer-to-peer networks, Proc. of the IEEE INFOCOM 2004, pp. 120-130, (2004)
  • [8] Jiang S., Guo L., Zhang X.D., Lightflood: An efficient flooding scheme for file search in unstructured peer-to-peer systems, Proc. of the IEEE Int'l Conf. on Parallel Processing, pp. 627-635, (2003)
  • [9] Jiang S., Guo L., Zhang X.D., Wang H.D., LightFlood: Minimizing redundant messages and maximizing scope of peer-to-peer search, IEEE Trans. on Parallel and Distributed Systems, 19, 5, pp. 601-614, (2008)
  • [10] Lin T., Lin P., Wang H., Chen C., Dynamic search algorithm in unstructured peer-to-peer networks, IEEE Trans. on Parallel and Distributed Systems, 20, 5, pp. 654-666, (2009)
123