Max-Minimum Algorithm for Trust Transitivity in Trustworthy Networks精选.pdfVIP

2009 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops2009 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technologies2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology Max-Minimum Algorithm for Trust Transitivity in Trustworthy Networks Yixiang Chen, Tian-Ming Bu, Min Zhang, Hong Zhu Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai 200062, China Emails: yxchen, tmbu, mzhang, hzhu @sei.ecnu.edu.cn Abstract—In this paper, we present a new measuring method the trust are equally important. The below is the induced of computing the transitive trustworthy degree between two trustworthy digraph- from Figure 1. different nodes. In this measuring method, the transitive trust degree of and along a path is measured in terms of the minimum weight of all edges on the path. For parallel paths between and , the transitive trust degree is defined as the maximum among the transitive degrees of all these paths. We prove that the measuring method can be done in polynomial time. Keywords-trustworthy degree; max-min algorithm; I. INTRODUCTION We in [2] introduce the notion of trustworthy networks which can be represented as weighted digraphs where is the weight function of nodes and is the weight function of edges. Weights on nodes represent the reputation Figure 2: The induced weight digraph- values of these