Share This Article:

A Reputation-Based Multi-Agent Model for Network Resource Selection

Abstract Full-Text HTML Download Download as PDF (Size:840KB) PP. 764-774
DOI: 10.4236/ijcns.2009.28089    4,079 Downloads   7,099 Views   Citations


Because of the anonymity and openness of online transactions and the richness of network resources, the problems of the credibility of the online trading and the exact selection of network resources have become acute. For this reason, a reputation-based multi-agent model for network resource selection (RMNRS) is presented. The model divides the network into numbers of trust domains. Each domain has one domain-agent and several entity-agents. The model prevents the inconsistency of information that is maintained by differ-ent agents through the periodically communication between the agents. The model enables the consumers to receive responses from agents significantly quicker than that of traditional models, because the global reputation values of service providers and consumers are evaluated and updated dynamically after each transaction. And the model allocates two global reputation values to each entity and takes the recognition value that how much the service provider knows the service into account. In order to make users choose the best matching services and give users with trusted services, the model also takes the similarity between services into account and uses the similarity degree to amend the integration reputation value with harmonic-mean. Finally, the effectiveness and feasibility of this model is illustrated by the experiment.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

J. TIAN, J. LI and L. YANG, "A Reputation-Based Multi-Agent Model for Network Resource Selection," International Journal of Communications, Network and System Sciences, Vol. 2 No. 8, 2009, pp. 764-774. doi: 10.4236/ijcns.2009.28089.


[1] H. Ibrahim, P. K. Atrey, and E. S. Abdulmotaleb, “Semantic similarity based trust computation in websites,” International Multimedia Conference, New York, ACM, pp. 65–72, 2007.
[2] S. K. Chong and J. H. Abawajy, “Feedback credibility issues in trust management systems,” 2007 International Conference on Multimedia and Ubiquitous Engineering: proceedings: MUE’07, Los Alamitos, Calif., IEEE Com-puter Society, pp. 387–391, 2007.
[3] Donovan J O and Smyth B, “Trust in recommender systems,” in proceedings of the 10th international conference on Intelligent user interfaces, New York, ACM, pp. 167– 174, 2005.
[4] P. Massa and P. Avesani, “Trust-aware recommender systems,” in proceedings of the 2007 ACM conference on Recommender systems. New York, ACM, pp. 17–24, 2007.
[5] Y. Gil and D. Artz, “Towards content trust of web resources,” in proceedings of the 15th international conference on World Wide Web, New York, ACM, pp. 565– 574, 2006.
[6] D. S. Peng, C. Lin, and W. D. Liu, “A distributed trust mechanism directly evaluating reputation of nodes,” Journal of Software, Vol. 19, No. 4, pp. 946–955, April 2008.
[7] Y. Wang and V. Varadharajan, “Role-based recommendation and trust evaluation,” in the 9th IEEE International Conference on E-Commerce. Technology and the 4th IEEE International Conference on Enterprise Computing, E–Commerce and E–Services, Tokyo, IEEE, pp. 278–288, 2007.
[8] P. Varalakshmi, S. Thamarai Selvi and M. Pradeep, “A multi-broker trust management framework for resource selection in grid,” in Communication Systems Software and Middleware, COMSWARE’07, 2nd International Conference on Bangalore, IEEE, pp. 7–12 January 2007.
[9] S. X. Jiang and J. Z. Li, “A reputation–based trust mechanism for p2p e-commerce systems,” Journal of Software, Vol. 18, No. 10, pp. 2551–2563, 2007.
[10] M. Blaze, J. Feigenbaum, and J. Lacy, “Decentralized trust management,” in proceedings of the 17th Symposium on Security and Privacy, CA, IEEE Computer Society Press, pp. 164–173, 1996.
[11] C. Lin, L. Q. Tian, and Y. Z. Wang, “Research on user behavior trust in trustworthy network,” Journal of Computer Research and Development, Vol. 45, No. 12, pp. 2033–2043, 2008.
[12] S. D. Kamvar and M. T. Schlosser, “EigenRep: Reputation management in P2P networks,” in Lawrence S, ed. Proceedings of the 12th International World Wide Web Conference Budapest, ACM Press, pp. 123?134, 2003.
[13] C. F. Wang and F. C. Sun, “Hierarchical entity self-determined trust model based on behaviors in grid environment,” Computer Engineering and Applications, Vol. 43, No. 16, pp. 135–138, 2007.
[14] F. Maheswaran and M. Maheswaran, “Evolving and managing trust in grid computing systems,” in proceedings of the 2002 IEEE Canadian Conference on Electrical Computer Engineering, pp. 1424–1429, 2002.
[15] F. Azzedin and M. Maheswaran, “A trust brokering system and its application to resource management in public resource grid,” Parallel and distributed Computing Symposium. pp. 22, 2004.
[16] X. Li and L. Liu, “Peertrust: supporting reputation-based trust for peer-to-peer electronic communities,” IEEE Transactions on Knowledge and Data Engineering, Special Issue on Peer to Peer Based Data Management, Vol. 16, No. 7, pp. 843–857, 2004.
[17] X. Dong, A. Halevy, J. Madhavan, et al., “Similarity search for web services,” in Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB Endowment, pp. 372–383, 2004.
[18] X. Wang, Y. H. Ding, and Y. Zhao, “Similarity measurement about ontology-based semantic web services,” in Conjunction with 4th European Conference on Web Services (ECOWS’06), pp. 4–6, 2006.
[19] X. Y. Li and X. L. Gui, “Research on dynamic trust model for large scale distributed environment,” Journal of Software, Vol. 18, No. 6, pp. 1510?1521, 2007.
[20] T. Beth, M. Borcherding and B. Klein, “Valuation of trust in open networks,” in proceedings of the European Symposium on Research in Computer Security, Brighton UK, Springer-Verlag, pp. 3–18, 1994.

comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.