Enhanced Entropy-Based Resource Searching in Unstructured P2P Networks

GONG Weihua; JIN Rong; YANG Lianghuai; HUANG Decai

doi:10.1049/cje.2015.04.002

Volume 24 Issue 2

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Electronics > 2015 > 24(2): 229-235

GONG Weihua, JIN Rong, YANG Lianghuai, et al., “Enhanced Entropy-Based Resource Searching in Unstructured P2P Networks,” Chinese Journal of Electronics, vol. 24, no. 2, pp. 229-235, 2015, doi: 10.1049/cje.2015.04.002

Citation:

GONG Weihua, JIN Rong, YANG Lianghuai, et al., “Enhanced Entropy-Based Resource Searching in Unstructured P2P Networks,” Chinese Journal of Electronics, vol. 24, no. 2, pp. 229-235, 2015, doi: 10.1049/cje.2015.04.002

Citation:

PDF( 416 KB)

Enhanced Entropy-Based Resource Searching in Unstructured P2P Networks

doi: 10.1049/cje.2015.04.002

1.
School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China;
2.
Key Laboratory of Visual Media Intelligent Process Technology of Zhejiang Province, Hangzhou 310023, China;
3.
School of Informatics and Electronics, Zhejiang Sci-Tech University, Hangzhou 310018, China

Funds: This work is supported by the Zhejiang Provincial Natural Science Foundation of China (No.LY13F020026,No.LY14F020017,No.Y1080102) and the National Natural Science Foundation of China (No.61070042).

Publish Date: 2015-04-10

Abstract

Abstract

How to find desired resources efficiently and accurately is one fundamental challenge of any unstructured P2P networks, which is mainly involved some difficulties in the P2P overlay topology, data representation in peers and routing mechanism. In this paper, we address the issue of resilient routing in unstructured P2P networks. An efficient algorithm called Query routing tree (QRT) based on maximum mutual information is proposed to improve the performance of resource searching, which has tightly associated the resource contents of peers with the logical links in P2P network that makes the query messages forwarded more effectively in similar peers and can hit more target resources faster. Additionally, we present an optimized routing scheme with the query conditions taken into account, to obtain the optimal routing tree with the minimal information gain from the candidate tree set so as to adapt to different query types more flexibly. The simulation results show the proposed QRT can reduce the search cost more effectively and maintain higher targets hit rate than existing typical algorithms such as Flooding, k-RW and APS. Finally, our optimized scheme is also proved to conduct high searching performance with nicer self-adaptability and scalability in unstructured P2P networks.
- Peer-to-peer (P2P),
- Resource searching,
- Entropy,
- Query routing tree,
- Information gain

FullText(HTML)

References(22)

References

G. Christos, M. Milena and S. Amin, “Random walks in peer-topeer networks: Algorithms and evaluation”, Performance Evaluation, Vol.63, No.3, pp.241-263, 2006.

N. Bisnik and A.A. Abouzeid, “Optimizing random walk search algorithms in P2P networks”, Computer Networks, Vol.51, No.6, pp.1499-1514, 2007.

Hung-Chang Hsiao and Hong-wei Su, “On optimizing overlay topologies for search in unstructured peer-to-peer networks”, IEEE Transactions on Parallel and Distributed Systems, Vol.23, No.5, pp.924-935, 2012.

Zhang Yi-Ming, Lu Xi-Cheng, Zheng Qian-Bing, et al., “An efficient search algorithm for large-scale P2P systems”, Journal of Software, Vol.19, No.6, pp.1473-1480, 2008. (in Chinese)

Jenq-Shiou Leu, Cheng-Wei Tsai and Wei-Hsiang Lin, “Resource searching in an unstructured P2P network based on cloning random walker assisted by dominating set”, Computer Networks, Vol.55, No.3, pp.722-733, 2011.

Wenyu Qu, Wanlei Zhou and Masaru Kitsuregawa, “Sharable file searching in unstructured peer-to-peer systems”, The Journal of Supercomputing, Vol.51, No.2, pp.149-166, 2010.

Ma Wen-Ming, Meng Xiang-Wu and Zhang Yu-Jie, “Bidirectional random walk search mechanism for unstructured P2P network”, Journal of Software, Vol.23, No.4, pp.894-911, 2012. (in Chinese)

Prithviraj Dasgupta and Erik Antonson, “Heuristics for uninformed search algorithms in unstructured P2P networks inspired by self-organizing social insect models”, Proceedings of International Conference on Biologically Inspired Collaborative Computing (BICC), Milano, Italy, Vol.268, pp.19-32, 2008.

Qiu ZH, Xiao MZ and Dai YF, “A user behavior based semantic search approach under P2P environment”, Journal of Software, Vol.18, No.9, pp.2216-2225, 2007. (in Chinese)

Hai Jin and Hanhua Chen, “SemreX: Efficient search in a semantic overlay for literature retrieval”, Journal Future Generation Computer Systems, Vol.24, No.6, pp.475-488, 2008.

Chunqiang Tang, Zhichen Xu and Sandhya Dwarkadas, “Peerto-peer information retrieval using self-organizing semantic overlay networks”, Proceedings of ACM SIGCOMM '03, Karlsruhe, Germany, pp.175-186, 2003.

D.D. Nikolaos, N.K. Pantelis, D. Anastasios, et al., “Exploiting semantic proximities for content search over P2P networks”, Computer Communications, Vol.32, No.5, pp.814-827, 2009.

Zhu Guiming, Jin Shiyao, Guo Deke, et al., “SOSC: A self-organizing semantic cluster based P2P query routing algorithm”, Journal of Computer Research and Development, Vol.48, No.5, pp.736-745, 2011. (in Chinese)

X.B. Zhou, J. Zhou, H.C. Lu, et al., “A layered interest based topology organizing model for unstructured P2P”, Journal of Software, Vol.18, No.12, pp.3131-3138, 2007. (in Chinese)

Huo Hongwei, Shen Wei, Xu Youzhi, et al., “A virtual hypercube routing algorithm for wireless healthcare networks”, Chinese Journal of Electronics, Vol.19, No.1, pp.138-144, 2010.

Kaigui Wu and Changze Wu, “State-based search strategy in unstructured P2P”, Future Generation Computer Systems, Vol.29, No.1, pp.381-386, 2013.

Dimitrios Tsoumakos and Nick Roussopoulos, “Adaptive probabilistic search (APS) for peer-to-peer networks”, Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P 2003), Sweden, pp.102-109, 2003.

Huang Zhen-hua, Xiang Yang, Sun Sheng-li, et al., “Optimizing skyline queries in SPA distributed networks”, Acta Electronic Sinica, Vol.41, No.8, pp.1515-1520, 2013. (in Chinese)

A. Crespo and H. Garcia-Molina, “Routing indices for peer-topeer systems”, in Proceedings of the 22nd Int. Conf. Distributed Computing Systems (ICDCS 2002), Vienna, Austria, pp.23-32, 2002.

Krishna P.N. Puttaswamy, Alessandra Sala and Ben Y. Zhao, “Searching for rare objects using index replication”, Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM 2008), Phoenix, USA, pp.1723-1731, 2008.

InSung Kang, SungJin Choi, SoonYoung Jung, et al., “Treebased index overlay in hybrid peer-to-peer systems”, Journal of Computer Science and Technology, Vol.25, No.2, pp.313-329, 2010.

Sam Joseph, “An extendible open source P2P simulator”, P2P Journal, Vol.1, No.11, pp.1-15, 2003.

Relative Articles

Supplements(0)

Cited By

Proportional views