Resource Query Mechanism Research of Structured P2P Network Based on Node Interest Community

Article Preview

Abstract:

Through utilizing node interest community in P2P network, put forward a new method on how to combine node interest community and traditional Chord algorithm. By using piecewise hash, making nodes in the same interest community adjacent to each other in the Chord algorithm, forming a virtual double Chord ring structure. Simulation tests show that this method is superior to the original Chord algorithm at path length and routing latency, improving the scalability of system.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 989-994)

Pages:

4815-4818

Citation:

Online since:

July 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Chen G, Low C P, Yang Z. Enhancing search performance in unstructured P2P networks based on users' common interest[J]. Parallel and Distributed Systems, IEEE Transactions on, 2008, 19(6): 821-836.

DOI: 10.1109/tpds.2008.42

Google Scholar

[2] SUN Li, CHEN Lan, YUAN Yuan. Non-structural P2P Search Mechanism Based on Peer Interest[J]. computer engineering, (2009).

Google Scholar

[3] Chen W T, Chao C H, Chiang J L. An interested-based architecture for peer-to-peer network systems[C]/Advanced Information Networking and Applications, 2006. AINA 2006. 20th International Conference on. IEEE, 2006, 1: 707-712.

DOI: 10.1109/aina.2006.93

Google Scholar

[4] Khambatti M, Ryu K D, Dasgupta P. Structuring peer-to-peer networks using interest-based communities[M]/Databases Information Systems and Peer-to-Peer Computing. Springer Berlin Heidelberg, 2004: 48-63.

DOI: 10.1007/978-3-540-24629-9_5

Google Scholar

[5] Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems[C]/INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications. IEEE Societies. IEEE, 2003, 3: 2166-2176.

DOI: 10.1109/infcom.2003.1209237

Google Scholar

[6] TAN Yihong, CHEN Zhiping, LIN Yaping. Research and implementation on searching mechanism based on interest mining in unstructured P2P systems. Computer Application, 2006, 26(5): 1164-1166.

Google Scholar

[7] WANG Fang. Efficient resource search technology and application research of Peer-to-Peer network[D]. Shandong Normal University , (2006).

Google Scholar

[8] I. Stoica, et al., Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, in Proc. of ACM SIGCOMM , San Diego, CA, 2001, pp.149-160.

DOI: 10.1145/964723.383071

Google Scholar

[9] Girvan M, Newman M E J. Community Structure in Social and Biological Networks[ J ]. Proceedings of the National Academy of Sciences of the United States of America, 2002, 99( 12): 7821- 7826.

DOI: 10.1073/pnas.122653799

Google Scholar

[10] Ramaswamy L , Gedik B. A Distributed Approach to Node Clustering in Decentralized Peer-to- Peer Networks[J]. Parallel and Distributed System s, 2005, 16( 9) : 814- 829.

DOI: 10.1109/tpds.2005.101

Google Scholar

[11] Tang Y, Zhang Z, Chen S, et al. A distributed hybrid scheme for unstructured peer-to-peer networks[C]/Communications, 2006. ICC'06. IEEE International Conference on. IEEE, 2006, 1: 30-35.

DOI: 10.1109/icc.2006.254700

Google Scholar