Trust evolvement method of Web service combination based on network behavior

Abstract

Based on the problem that the service entity only has the partial field of vision in the network environment, a trust evolvement method of the macro self-organization for Web service combination was proposed. In the method, the control rule of the trust degree in the Dempster-Shafer(D-S) rule was utilized based on the entity network interactive behavior, and a proportion trust control rule was put up. The control rule could make the Web service self-adaptively study so as to gradually form a proper trust connection with its cooperative entities and to improve the security performance of the whole system. The experimental results show that the historical successful experience is saved during the service combination alliance, and the method can greatly improve the reliability and success rate of Web service combination.

Keywords

network behavior / Web service combination / trust evolvement / Dempster-Shafer rule

References

[1] ChenZ., ChenZ.-g., DengX.-h., ChenL.-xin.. An effective assemble-oriented framework for grid Web service [J]. Journal of Central South University of Technology, 2007, 14(4): 557-562

[2] RanS. P.. A model for Web services discovery with QoS [J]. ACM SIGecom Exchanges, 2003, 4(1): 1-10

[3] SongS., HwangK., KworkY. K.. Trusted grid computing with security binding and trust integration [J]. Journal of Grid Computing, 2005, 3(1): 53-73

[4] LuoH.-b., FanY.-s., WuCheng.. Overview of combination technology [J]. Journal of Software, 2000, 11(7): 899-907

[5] ShethA., RusinkiewiczM.. On transactional combinations [J]. IEEE Data Engineering Bulletin, Special Issue on Combination Systems, 1993, 16(2): 34-40

[6] CurberaF., KhalafR., MukhiN.. The next step in Web services [J]. Communications of ACM, 2003, 46(10): 29-34

[7] HuC.-h., WuM., LiuG.-ping.. Research on novel macro grid workflow self-organization mechanism [J]. Computer Engineering, 2007, 33(1): 25-27

[8] JinH., LiaoZ.-s., ZouD.-q., QiangW.-zhong.. A new approach to hide policy for automated trust negotiation [C]. Proceedings of the 1st International Workshop on Security, 2006, Berlin, Springer-Verlag: 168-178

[9] SrivatsaM., XiongL., LiuL.. Trust guard: Countering vulner-abilities in reputation management for decentralized overlay networks [C]. Proceedings of the 14th World Wide Web Conference, 2005, New York, IEEE Computer Society: 422-431

[10] WattsD. J., StrogatzS. H.. Collective dynamics of small world networks [J]. Nature, 1998, 393(4): 440-442

[11] KleinbergJ.. The small world phenomenon: An algorithmic perspective [C]. Proceedings of the ACM Symp on Theory of Computing, 2000, New York, Communications of ACM: 163-170

[12] WangY., LuJ., XuF., ZhangLin.. A trust measurement and evolution model for Internetware [J]. Journal of Software, 2006, 17(4): 682-690

[13] AzzedinF., MaheswaranM.. Integrating trust into grid resource management systems [C]. Proceedings of the 2002 International Conference on Parallel Processing, 2002, New York, IEEE Computer Society: 47-54

[14] ShaferG.A mathematical theory evidence [M], 1976, Princeton, New Jersey, Princeton University Press

[15] HuC.-h., WuM., XieQ., WangJ.-ming.. SWET: Service combination transfer performance evaluation system based on QoS [J]. Journal of Central South University: Natural Science, 2007, 38(5): 962-969