Figure - available from: Cluster Computing
This content is subject to copyright. Terms and conditions apply.
Source publication
![The relationship between E(Ls)\documentclass[12pt]{minimal}...](publication/362148414/figure/fig3/AS:11431281092644261@1666922913031/The-relationship-between-ELsdocumentclass12ptminimal-usepackageamsmath_Q320.jpg)
![The relationship between E(Ws)\documentclass[12pt]{minimal}...](publication/362148414/figure/fig4/AS:11431281092654154@1666922913060/The-relationship-between-EWsdocumentclass12ptminimal-usepackageamsmath_Q320.jpg)
![The relationship between Wy\documentclass[12pt]{minimal}...](publication/362148414/figure/fig5/AS:11431281092630282@1666922913096/The-relationship-between-Wydocumentclass12ptminimal-usepackageamsmath_Q320.jpg)
Peer-to-Peer (P2P) networks is a distributed structure, which is widely used in file sharing, distributed computing, deep search engines. Each node plays the dual role of client and server, which makes the P2P network further exacerbates the insecurity of P2P systems. For the behavior of nodes in P2P systems, requesting nodes are abstracted into cu...
Similar publications
Machine learning, particularly using neural networks, is now widely adopted in practice even with the IoT paradigm; however, training neural networks at the edge, on IoT devices, remains elusive, mainly due to computational requirements. Furthermore, effective training requires large quantities of data and privacy concerns restrict accessible data....
The current usage of federated learning in applications relies on the existence of servers. To address the inability to conduct federated learning for IoV (Internet of Vehicles) applications in serverless areas, a P2P (peer-to-peer) architecture for federated learning is proposed in this paper. Following node segmentation based on limited subgraph...
To improve the performance of Peer-to-Peer (P2P) networks and reduce energy consumption while minimizing “free-riding” behavior, a queuing model is utilized to abstract dynamic changes of peers in hybrid P2P networks. Requesting peers are categorized differently and a discrete-time Geo/Geo/1 + 1 queuing model is established with simultaneous multip...
Peer-to-Peer systems have become, in a short period of time, one of the fastest growing and most popular applications. The decentralized and distributed nature of P2P systems leads to living aside the client-server model. In P2P model each node takes both the roles of client and server. As a client, it can query and download its wanted data files f...
The fast development of the sensors in the wireless sensor networks (WSN) brings a big challenge of low energy consumption requirements, and Peer-to-peer (P2P) communication becomes the important way to break this bottleneck. However, the interference caused by different sensors sharing the spectrum and the power limitations seriously constrains th...
Citations
... In a P2P network, there are always some malicious peers when they are exchanging information. Ma et al. [2] studied the scheduling problem of malicious peers in a P2P network using queuing theory. Premakumari and Chandrasekaran [3] used a neural network to categorize the peers in the P2P network and extracted the trust value from trusty peers and malicious peers. ...
To improve the performance of Peer-to-Peer (P2P) networks and reduce energy consumption while minimizing “free-riding” behavior, a queuing model is utilized to abstract dynamic changes of peers in hybrid P2P networks. Requesting peers are categorized differently and a discrete-time Geo/Geo/1 + 1 queuing model is established with simultaneous multiple working vacations, waiting threshold N, and two types of servers with different service rates. The steady-state distribution of the system is obtained by using the matrix-geometric solution method, and performance measures such as average queue length, average delay, and total energy consumption of the two types of requesting peers are calculated. Numerical experiments are conducted to analyze the effects of different parameters on the performance measures. Finally, the optimal strategies and Nash equilibrium points of requesting peers are studied, which provide a theoretical basis to suppress “free-riding” behavior.
