Efficient Content Location Using Semantic Small World in Peer-to-Peer Networks
Abstract
Locating content in unstructured peer-to-peer networks is a challenging problem. This paper presents a novel semantic small world resource search mechanism to address the problem. By using vector space model to compute the semantic relevance and applying small world properties such as low average hop distance and high clustering coefficient to construct a cluster overlay. In semantic small world system, the search mechanism is divided into two parts, searching at cluster and outside cluster through inner link and short link, so that it can achieve the incremental research. It significantly reduces the average path length and query cost. Meanwhile, the simulation results show that semantic small world scheme outperforms K-random walks and flooding scheme than higher query hit rate and lower query latency.
Full Text:
PDFReferences
Xuemin Shen, Heather Yu, John Buford Mursalin Akon. Handbook of Peer to Peer Networking. Springer. New York. 2010.
Stocia I, Morris R, Karger D R, et al. Chord: A scalable peer-to-peer lookup service for Internet applications. IEEE/ACM Transactions on Networking, 2003; 11(1): 17-32.
Zhao B Y, Kubiatowicz J D, Joseph A D. Tapestry: A fault-tolerant wide-area application infrastructure. Computer Communication Review. 2002; 32(1): 81.
Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D. A local search mechanism for peer-to-peer networks. Proc of the 11th Int Conf on Information and Knowledge Management. New Yord. 2002: 300-307.
Yang B, Garcia Molina H. Improving search in peer-to-peer networks. Proc of the 22nd Int Conf on Distributed Computing Systems. IEEE Computer Society. Washington. 2002: 5-14.
Lv Q, Cao P, Cohen E, et al. Search and replication in unstructured peer-to-peer networks. Proc of the 16th Int Conf on Supercomputing. New York. 2002: 84-95.
Tsoumakos D, Roussopoulos N. Adaptive probabilistic search for peer-to-peer Networks. Proc of the 3rd IEEE Int Conf on P2P computing. IEEE Computer Society. Washington. 2003: 102-109.
Crespo A, Garcia-Molina H. Semantic overlay networks for P2P system. Proc of the 3rd Int Workshop on Agents and Peer-to-Peer Computing. Springer. Berlin. 2005:1-14.
M. W. Berry, Z. Drmac, E. R. Jessup. Matrices, vector spaces, and information retrieval. SIAM Review. 1999; 41(2): 335-362.
S. Milgram. The small world problem. Psychology Today. 1967; 2: 60-67.
Manfredi, S. di Bernardo, M. Garofalo F. Small world effects in networks: an enginerring interpretation. Proceedings of the 2004 International Symposium Circuits and Systems (ISCAS’04). 2004; 4:23-26.
Inaltekin H, Mung Chiang, Poor H.V. Average Message Delivery Time for Small-world Networks in the Continuum Limit. IEEE Transactions on Information Theory. 2010; 56(9): 4447-4470.
Bader, D.A, Madduri K. SNAP. Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks. IEEE International Symposium Parallel and Distributed Processing. 2008: 1-12.
Yan Ma, Bin Gong, Lida Zou. Resource Discovery Algorithm Based on Small-world Cluster in Hierachical Grid Computing Environment. GCC 7th International Conference on Grid and Cooperative Computing. 2008: 110-116.
ChangJie Jiang, Chien Chen, JeWei Chang, RongHong Jan, Tsun Chieh Chiang. Construct Small Worlds in Wireless Networks Using Data Mules. IEEE 8th Int Conf on Trustworthy Computing of Sensor Networks. 2008: 28-35.
DOI: http://doi.org/10.12928/telkomnika.v11i2.909
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
TELKOMNIKA Telecommunication, Computing, Electronics and Control
ISSN: 1693-6930, e-ISSN: 2302-9293
Universitas Ahmad Dahlan, 4th Campus
Jl. Ringroad Selatan, Kragilan, Tamanan, Banguntapan, Bantul, Yogyakarta, Indonesia 55191
Phone: +62 (274) 563515, 511830, 379418, 371120
Fax: +62 274 564604