z-logo
Premium
A trust management model for service‐oriented distributed networks
Author(s) -
Yu Yanli,
Li Keqiu,
Jin Yingwei,
Zhang Yong
Publication year - 2012
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.2834
Subject(s) - trust management (information system) , correctness , computer science , trust anchor , computational trust , web of trust , scheme (mathematics) , service (business) , computer security , computer network , path (computing) , distributed computing , reputation , business , algorithm , mathematical analysis , social science , mathematics , marketing , sociology
SUMMARY The service‐oriented distributed network requires more stable and persistent services, but the services from dishonest or unstable nodes would damage the correctness and availability of services. To efficiently obtain the services from high dependable nodes, many trust management systems have been developed. However, the previous trust models in distributed networks ignore a fact that the entity itself could provide trust information for services also. In this paper, we present a novel trust management model based on the subjective logic trust for service‐oriented distributed networks. The proposed algorithm involves passive trust of entity and combines the direct trust and recommendation trust. We also propose a novel scheme called passive trust feedback to avoid the deceit of malicious nodes and unstable nodes, and to encourage honest nodes. Our proposed model expands the trust range of service resource via passive trust of entity, which generates a flexible access path to the service resources. Simulations show that the proposed trust management model can significantly improve the feasibility of trust management as well as effectively detect malicious entities. Copyright © 2012 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here