A topological potential weighted community-based recommendation trust model for P2P networks

Han, Qiyi; Hong, Wen; Ren, Mengyin; Wu, Bin; Li, Shengqiang

doi:10.1007/s12083-014-0288-9

Cited by 13 publications

(15 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the Voting model (Aringhieri et al, 2006;Chang and Wong, 2011;Kamvar et al, 2003;Song et al, 2005), advices are generated on demand and their motivation cannot be verified. Conversely, in the Transaction Certificates scheme (Gupta and Somani, 2004;Han et al, 2014), each advice is clearly and objectively tracked, for which it is possible to check for the trustworthiness of the issuer and reduce the influence of malicious collectives.…”

Section: Discussionmentioning

confidence: 99%

“…The third strategy is to use Transaction Certificates (Gupta and Somani, 2004;Han et al, 2014), generated by involved parties and including the score assigned to just completed transactions. At the end of a successful service completion, the client signs a satisfaction certificate (a form of digital certificate) and gives it to the server.…”

Section: Transaction Certificatesmentioning

confidence: 99%

See 1 more Smart Citation

Distributed reputation management for service-oriented peer-to-peer enterprise communities

Zanichelli

Amoretti

2016

IJCSE

View full text Add to dashboard Cite

Peer-to-peer service sharing might allow for unmediated, almost instantaneous inter-firm collaboration, yet robust reputation management techniques are strongly required to withstand fraudulent actions of malicious peers. In this paper we illustrate a distributed reputation management system for service-oriented peer-to-peer networks, called SAFE, which exploits voting and effectively copes with trust misrepresentation attempts. Simulation results show that SAFE allows peers to select high-quality services, even when a large extent of malicious providers and advisors are active in the community. from Universit degli Studi di Parma (Italy). Currently, he is Research Associate at the same university. His research focuses on modeling and simulation of large-scale distributed systems, in particular those based on the peer-to-peer paradigm, complex adaptive systems and autonomic computing, design and development of service-oriented architectures, as well as wireless sensor networks. He has published over 80 technical papers in refereed international journals and conference proceedings.Francesco Zanichelli received the Dr. Eng degree (Master) in Electronic Engineering at the University of Bologna and the Ph.D. degree in Information Technologies at the University of Parma. He is currently an Aggregate Professor with the Department of Information Engineering of the University of Parma, where he is teaching the Operating Systems course. After several years devoted to the study of intelligent robotics and robot programming, current research interests of Francesco Zanichelli include service-oriented peer-to-peer systems and middleware, as well as distributed multimedia architectures and protocols, including security and Quality of Service.In this work, we illustrate a Distributed RMS (DRMS) for service-oriented P2P networks, called Service Advisors For E-business (SAFE), that effectively

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Transaction Certificatesmentioning

confidence: 99%

Distributed reputation management for service-oriented peer-to-peer enterprise communities

Zanichelli

Amoretti

2016

IJCSE

View full text Add to dashboard Cite

show abstract

“…Community‐based P2P approaches are very popular to support P2P networks as well as social P2P networks . In such communities, peers of similar interests are grouped together to form IBCs .…”

Section: Related Workmentioning

confidence: 99%

A community‐based social P2P network for sharing human life digital memories

Rahman

Merabti

Llewellyn‐Jones³

et al. 2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Social peer-to-peer (P2P) networks are usually designed by reflecting a user's interest/behavior for structuring the underlying network. Human interest is affected by various factors such as age, locality, and so on which changes after some time. The behavior when reflected in a network, results in peers moving within the network in order to connect the peer with peers of the same behavior/interest. Especially in community-based schemes when a peer leaves a community the data that a peer was sharing will not be accessible in the same community anymore. It has an effect on the performance of the network due to the inaccessibility of data and the unavailability of connections, which affect network robustness. We address this issue by considering entities in data in the form of digital memories of a user and structuring network according to entity-based communities. The simulation results for the proposed entity-based community are demonstrated, which shows the effect on network performance during varying network size and traffic.Abbreviations: EBCs, entity-based communities; IRF, interferon regulatory factor; P2P, peer-to-peer.Trans Emerging Tel Tech. 2020;31:e3866.wileyonlinelibrary.com/journal/ett of the individual, will result in peers moving within the network by disconnecting from some peers and connecting to others. The behavior of peers, that is, moving within a network, which we have identified is a distinct behavior in social P2P networks, which to the best of our knowledge has not been mentioned before. However, the two similar behaviors to the mentioned are: peers churn and peers' mobility. This behavior is different than peers churn where peers go completely off the network. 10,11 It is also different than the mobility of peers where peers move from one location to another. In the problem we identified, peers keep their credentials and location and are not disconnected from the network, which makes it different and distinct than the two issues. Community-based schemes, 12-14 for example, interest-based communities (IBCs) 15,16 are more affected by this behavior because any change in an individual's social network disconnects its peer from the whole community which makes the data inaccessible to all peers of that community. As described earlier that human interest is affected by many factors, which any change in these factors results in a change of a human interest. So, change in the interest of a person, when reflected in a social P2P network results in leaving the community by the peer and joining another community of the new interest. People capture their data using various devices such as camera, mobile phones, etc. which form their digital memories. A memory for life (M4L) system 17 is one of the grand challenges in UK which aims to capture, store, annotate, organize, analyze, and share an individual's digital memories. By analyzing digital memories, an M4L system will identify various entities such as places, people, events, etc. in digital memories and which will further be used to generate meanin...

show abstract

“…Higher successful transaction rate of the reputation‐based P2P environment was achieved. Han et al introduced a novel recommendation‐based trust model architecture to perform data transaction based on the topological potential‐weighted community. The robustness and efficiency of the proposed model in the identification of the malicious nodes were recognized from the simulation results.…”

Section: Related Workmentioning

confidence: 99%

PSO‐based optimal peer selection approach for highly secure and trusted P2P system

Nallakannu¹,

Thiagarajan²

2016

Security Comm Networks

View full text Add to dashboard Cite

There is a significant growth of the peer-to-peer (P2P) systems over the last few years because of their high potential for sharing file among the peers. Selection of the optimal peer ensures high data transmission rate and reduced network cost. However, it is highly difficult to select the optimal peer because of the variation in the heterogeneous capacity and dynamic capacity of the peers. Efficient peer selection approach is highly required to overcome this difficulty. This paper proposes a particle swarm optimization (PSO)-based optimal peer selection approach for a highly secure and trusted P2P system, based on the bandwidth and trust level of the peers. File replication is performed to effectively tackle the overloading of the hot files. Replacement of the replicated file is performed, based on their demand rates. The success rate and bandwidth rate of the peer are computed. Bandwidth and trust-based PSO is applied to select the optimal peer. This improves the success rate for the peer transmission. After selecting the optimal peer, the replicated file is encrypted and transmitted to the selected peer. Finally, the replicated file is decrypted. Our proposed approach achieves minimum average query delay and ensures a highly secure and trusted environment for the P2P systems. The performance of the proposed approach is evaluated by comparing the proposed approach with the existing techniques. From the comparison results, it is clearly evident that the proposed approach achieves higher success rate and lower link stress, delay, communication overhead, finished time and network cost.

show abstract

A topological potential weighted community-based recommendation trust model for P2P networks

Cited by 13 publications

References 10 publications

Distributed reputation management for service-oriented peer-to-peer enterprise communities

Distributed reputation management for service-oriented peer-to-peer enterprise communities

A community‐based social P2P network for sharing human life digital memories

PSO‐based optimal peer selection approach for highly secure and trusted P2P system

Contact Info

Product

Resources

About