Abstract
The resource discovery algorithms in Peer-to-Peer networks are based on the assumption that reliable resources are provided by each peer. The feather that significantly contributes to the success of many P2P applications is dynamic, anonymity and self-organization. However, they also bring about some malicious nodes to provide untrustworthy and pseudo services. To address this problem, this paper introduces a robust and flexible reputation mechanism in unstructured P2P and presents the heuristicresource discovery algorithm based on reputation-aware to ensure that resource requester can obtain reliable resources and services. This new resource discovery algorithm can effectively suppress the deceptive and fake services of P2P network, improve the reliability and security and decrease network load.
This paper is supported by the National Natural Science Foundation of China under Grant No.60273041 and the National ‘863’ High-Tech Program of China under Grant No. 2002AA104560.
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
Yang, B., Garcia-Molina, H.: Improving Search in Peer-to-Peer Networks. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, ICDCS 2002 (2002)
Napster Inc., http://www.napster.com/
Gnutella, http://www.gnutelliums.com/
Freenet documentation, http://freenet.sourceforge.net/doc/book.html
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM, San Diego, CA, August, pp. 161–172 (2001)
Stoica, I., Morris, R., Karger, D.: Chord: a scalable peer-to-peer lookup service for Internet applications. In: Proceedings of ACM SIGCOMM 2001, San Diego (2001)
Khambatti, M.S., Ryu, K.D., Dasgupta, P.: Efficient Discovery of Implicitly formed Peer-to-Peer Communities. International Journal of Parallel and Distributed Systems and Networks 5(4), 155–164 (2002)
Stallings, W.: Cryptography and Network Security: Principles and Practice, 2nd edn., pp. 223–228. Publishing House of Electronics Industry, Beijing (2001)
Gambetta, D.: Can We Trust? In: Gambetta, D. (ed.) Trust: Making and Breaking Cooperative Relations, pp. 213–237. Basil Blackwell, Oxford (1990)
Abdul-Rahman, A., Hailes, S.: A distributed trust model. In: Proceedings of the 1997 New security Paradigms Workshop, Cambrian. ACM Press, New York (1998)
Brite: a network topology generator, http://www.cs.bu.edu/brite/
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: Chapin, L., Sterbenz, J.P.G., Parulkar, G., Turner, J.S. (eds.) Proc. of the ACM SIGCOMM 1999, pp. 251–262. ACM Press, New York (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, J., Yang, S., Guo, L., Wang, J., Chen, Y. (2005). Towards Reputation-Aware Resource Discovery in Peer-to-Peer Networks. In: Zhuge, H., Fox, G.C. (eds) Grid and Cooperative Computing - GCC 2005. GCC 2005. Lecture Notes in Computer Science, vol 3795. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590354_111
Download citation
DOI: https://doi.org/10.1007/11590354_111
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30510-1
Online ISBN: 978-3-540-32277-1
eBook Packages: Computer ScienceComputer Science (R0)