Abstract
Peer-to-peer (P2P) overlay networks provide a new way to retrieve information over networks. How to assurance the reliability of the resource is the crucial issue of security. This paper proposes a trustworthy overlay based on the small world phenomenon that facilitates efficient search for information retrieval with security assurance in unstructured P2P systems. Each node maintains a number of short-range links to the trusted other nodes, together with a small collection of long-range links that help increasing recall rate of information retrieval, and the trust degree of each node is evaluated by Bayesian method. Simulation test shows that the proposed model can not only increase the ratio of resource discovery, improve the interaction performance of the entire network, but also assurance the reliability of resource selection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ratnasamy, S., Francis, P., Handley, M., et al.: A scalable content-addressable network. In: Proceedings of the Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, August 27–31, 2001, pp. 161–172 (2001)
Stoica, I., Morris, R., Liben, N.D., et al.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: an infrastructure for fault-tolerant wide-area location and routing, Report No. UCB/CSD-01-1141 (2001)
Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167–256 (2003)
Kleinberg, J.: The Small-World Phenomenon: an Algorithm Perspective. In: Proceedings of ACM Symposium on Theory of Computing (2000)
Cohen, E., Fiat, A., Kaplan, H.: A case for associative peer-to-peer overlays. In: Proceedings of Workshop on Hot Topics in Networks (2002)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer systems. In: Proceedings of ACM INFOCOM Conference (2003)
Wang, F., Moreno, Y., Sun, Y.: Structure of Peer-to-peer Social Networks. Physical Review, 73(3) (2006)
Jin, H., Ning, X.M., Chen, H.H.: Efficient search for peer-to-peer information retrieval using semantic small world. In: Proceedings of ACM WWW Conference (2006)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: Proceedings of ACM SIGCOMM Computer Communication Review, vol. 29(4), pp. 251–262 (1999)
Wang, W., Zeng, G.S., Yuan, L.L.: A Semantic Reputation Mechanism in P2P Semantic Web. In: Mizoguchi, R., Shi, Z., Giunchiglia, F. (eds.) ASWC 2006. LNCS, vol. 4185, pp. 682–688. Springer, Heidelberg (2006)
12.Wang, W., Zeng, G. S., Liu T.: An Autonomous Trust Construction System Based on Bayesian Method, In: Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT 2006), Hong Kong, China, December 18–22, 357–362 (2006)
Peterson, L., Bavier, A., Fiuczynski, M.: el al.: Towards a Comprehensive PlanetLab Architecture. Technical Report PDN–05–030, PlanetLab Consortium, June (2005)
Krishna, P., Richard, J., Stefan, S., et al.: Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. SOSP 2003, Bolton Landing, New York, USA (October 2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lü, S., Wang, W., Zhang, Y. (2007). Bayesian Method Based Trusted Overlay for Information Retrieval over Networks. In: Chang, K.CC., et al. Advances in Web and Network Technologies, and Information Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72909-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-72909-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72908-2
Online ISBN: 978-3-540-72909-9
eBook Packages: Computer ScienceComputer Science (R0)