Abstract
Abstract A Peer-to-Peer (P2P) system relies on the cooperation of the peers and the contributions of their resources. To motivate autonomous peers share their resources, the system needs to support effective resource allocation strategies with respect to peers’ task priorities, and their personal information about valuation. However, peers may tend to be selfish for saving their limited resources and act as the free-riders. Some peers may even be malicious with the goal to do damage to the system. In this paper, we present a bidding based approach for resource allocation to address these issues. We investigate peers’ bidding strategies under different scenarios in terms of probability distributions that peers’ valuations of their prioritized tasks follow in achieving the Nash equilibrium. For resisting the damage to the P2P system brought by malicious peers, we explore different types of malicious behavior and present several statistical mechanisms to detect the malicious peers. The algorithm is also pres...
Highlights
PEER-TO-PEER networks (P2P) have emerged as new technologies in distributed applications, mainly due to the advances in network, file sharing system, and distributed systems technologies[1]
Computing environments by incorporating different types of peers with varied private valuations for the resources and multi-priority tasks, and derive peers’ bidding strategies in achieving Nash equilibrium (NE) state. z We explore different types of cheating behaviors that could be demonstrated by malicious peers during the process of bidding for resources, and discuss several statistics-based mechanisms to distinguish them from the non-cooperative environment. z We have made an experimental study on our detecting methods
To demonstrate the effectiveness of DM E, we focus on two aspects, i.e., whether DM E can effectively identify the malicious peers that excessively bid for resources, and whether DM E is too sensitive to mistreat the non-malicious peers as malicious ones
Summary
PEER-TO-PEER networks (P2P) have emerged as new technologies in distributed applications, mainly due to the advances in network, file sharing system, and distributed systems technologies[1]. To implement an effective and secure resource allocation in P2P computing systems, several challenges must be addressed. As P2P systems are open and dynamic, they incorporate different types of peers with their private valuations for the public resources and multi-priority tasks, which should be considered when designing effective resource allocation schemes for better sharing of resources. Peers could be “selfish” for maximizing their own utility. Some peers may even be malicious and aim at doing damage to the system and other peers. Some special mechanisms are needed to detect these malicious peers and resist their harmful behavior
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Intelligence Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
