A GroupTrust model based on service similarity evaluation in P2P networks

Zhang, Yong; Zheng, Hairong; Liu, Yining; Li, Keqiu; Qu, Wenyu

doi:10.1002/int.20452

Cited by 6 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, eliminate the number of occurrence table. Both RCM and ERCM are similar to a group trust model [7].…”

Section: The Resource Chain Modelsmentioning

confidence: 99%

The Chain Effect for the Reputation-Based Trust Model in Peer-to-Peer Computing

Lee

2012

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThis letter analyzes a resource chain trust model for P2P reputation-based systems. Many researchers have given a lot of efforts to reputation-based system area and some of them have made good theoretical models. Problems are to spread malicious contents whereas the remark that such models only concentrate on the relationship between the node and its direct neighbors is still controversial. To solve the problems, we introduced the RCM (Resource Chain Model) and the Enhanced RCM. In this letter, we analyze the models and then show usage of our models can help us to find the best and safest location efficiently and decrease the number of malicious transaction.

show abstract

“…Finally, eliminate the number of occurrence table. Both RCM and ERCM are similar to a group trust model [7].…”

Section: The Resource Chain Modelsmentioning

confidence: 99%

The Chain Effect for the Reputation-Based Trust Model in Peer-to-Peer Computing

Lee

2012

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…As a result of this increased interest, many researchers have focused on developing trust and reputation systems for various networks, e.g. [Kamvar, Schlosser and Garcia-Molina (2003); Kurdi (2015); Xiong and Liu (2017); Zhang, Zheng, Liu et al (2011); Kurdi, Alshayban, Altoaimy et al (2018); Bursell (2005); Mondal and Kitsuregawa (2006); Shala, Wacht, Trick et al (2017); Zhao and Li (2013), Xie, Yuan, Zhou et al (2018)].…”

Section: Introductionmentioning

confidence: 99%

“…Another trust-based algorithm, PeerTrust, calculates trust based on several factors such as feedback, number of transactions, credibility and community context factors [Xiong and Liu (2004)]. Alternatively, algorithms such as GroupTrust organise peers into different groups based on their evaluation of the same or similar services [Zhang, Zheng, Liu et al (2011)]. In these instances, the evaluation of the trustworthiness of peers outside the group is based on their local and global reputations, which are aggregated from other peers.…”

Section: Introductionmentioning

confidence: 99%

A Hierarchical Trust Model for Peer-to-Peer Networks

Al-Otaiby¹,

Kurdi²,

Al-Megren³

2019

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

Trust has become an increasingly important issue given society's growing reliance on electronic transactions. Peer-to-peer (P2P) networks are among the main electronic transaction environments affected by trust issues due to the freedom and anonymity of peers (users) and the inherent openness of these networks. A malicious peer can easily join a P2P network and abuse its peers and resources, resulting in a large-scale failure that might shut down the entire network. Therefore, a plethora of researchers have proposed trust management systems to mitigate the impact of the problem. However, due to the problem's scale and complexity, more research is necessary. The algorithm proposed here, HierarchTrust, attempts to create a more reliable environment in which the selection of a peer provider of a file or other resource is based on several trust values represented in hierarchical form. The values at the top of the hierarchical form are more trusted than those at the lower end of the hierarchy. Trust, in HierarchTrust, is generally calculated based on the standard deviation. Evaluation via simulation showed that HierarchTrust produced a better success rate than the well-established EigenTrust algorithm.

show abstract

“…Driven by market demands, the manufacturing industry is undergoing significant transformations. With the rapid development of information technology, such as web service, cloud computing, manufacturing technology, manufacturing grid, Internet of things, and other networked manufacturing modes, cloud manufacturing (CMfg) is proposed and developed successfully . The main purpose of CMfg is to provide user with on‐demand, always‐ready, high‐quality and low‐consumption service, which is available for product design, manufacturing, testing, simulation and maintenance, and other manufacturing lifecycle process.…”

Section: Introductionmentioning

confidence: 99%

An Approach for Multipath Cloud Manufacturing Services Dynamic Composition

Liu

Song

Chu

et al. 2016

Int. J. Intell. Syst.

View full text Add to dashboard Cite

Cloud manufacturing (CMfg) has become a brand‐new service‐oriented networked manufacturing. The key technology that achieves this manufacture mode is to aggregate all kinds of potential CMfg services to create value‐added composite CMfg services, so as to satisfy various manufacturing requirements. As massive CMfg services with the same manufacturing functionalities and different quality of service (QoS) are emerging on the Internet, CMfg services dynamic composition becomes more and more complex. One challenge of this technology is how to efficiently solve the problem of multipath CMfg services dynamic composition. Another challenge is how to conquer the overconstrained problem occurred in the process of CMfg services dynamic composition. To tackle these two issues, this paper proposes an approach for multipath CMfg services dynamic composition based on improved QoS constraint hierarchies (CHs) model. First, a QoS constraints description model with new evaluation function is propounded based on the CHs theory to conquer the overconstrained problem; second, improved max–min ant system (MMAS) is put forward by introducing improved transfer rule, new global pheromone updating rule and mutation mechanism into MMAS, and then an optimization algorithm named culture genetic MMAS is constructed for multipath CMfg services dynamic composition. Finally, experimental results and performance comparison prove that the proposed method is both effective and efficient.

show abstract

A GroupTrust model based on service similarity evaluation in P2P networks

Cited by 6 publications

References 15 publications

The Chain Effect for the Reputation-Based Trust Model in Peer-to-Peer Computing

The Chain Effect for the Reputation-Based Trust Model in Peer-to-Peer Computing

A Hierarchical Trust Model for Peer-to-Peer Networks

An Approach for Multipath Cloud Manufacturing Services Dynamic Composition

Contact Info

Product

Resources

About