scholarly journals A pricing strategy for incentivizing selfish nodes to share resources in peer-to-peer (P2P) networks

2005 ◽  
Author(s):  
R. Gupta ◽  
A.K. Somani
Keyword(s):  
Peer To Peer ◽  
Pricing Strategy ◽  
Selfish Nodes ◽  
P2p Networks

scholarly journals Detection of DDOS attacks in distributed peer to peer networks

2018 ◽  
Vol 7 (2.7) ◽  
pp. 1051
Author(s):  
Gera Jaideep ◽  
Bhanu Prakash Battula
Keyword(s):  
High Risk ◽  
Large Scale ◽  
Peer To Peer ◽  
P2p Network ◽  
Ddos Attacks ◽  
P2p Networks ◽  
Distributed Environment ◽  
Trace Back ◽  
Peer To Peer Networks ◽  
Direct Attack

Peer to Peer (P2P) network in the real world is a class of systems that are made up of thousands of nodes in distributed environments. The nodes are decentralized in nature. P2P networks are widely used for sharing resources and information with ease. Gnutella is one of the well known examples for such network. Since these networks spread across the globe with large scale deployment of nodes, adversaries use them as a vehicle to launch DDoS attacks. P2P networks are exploited to make attacks over hosts that provide critical services to large number of clients across the globe. As the attacker does not make a direct attack it is hard to detect such attacks and considered to be high risk threat to Internet based applications. Many techniques came into existence to defeat such attacks. Still, it is an open problem to be addressed as the flooding-based DDoS is difficult to handle as huge number of nodes are compromised to make attack and source address spoofing is employed. In this paper, we proposed a framework to identify and secure P2P communications from a DDoS attacks in distributed environment. Time-to-Live value and distance between source and victim are considered in the proposed framework. A special agent is used to handle information about nodes, their capacity, and bandwidth for efficient trace back. A Simulation study has been made using NS2 and the experimental results reveal the significance of the proposed framework in defending P2P network and target hosts from high risk DDoS attacks.  

scholarly journals Secure message routing in structured peer-to-peer networks

2021 ◽  
Author(s):  
Abdolkarim Hajfarajollah Dabbagh
Keyword(s):  
Public Key Cryptography ◽  
Peer To Peer ◽  
Public Key ◽  
Message Delivery ◽  
Delivery Time ◽  
P2p Networks ◽  
Security Measures ◽  
Message Routing ◽  
Security Issues ◽  
Identity Based

"Due to the lack of a centralized server in “Peer-to-Peer” (P2P) networks, users are responsible for the security of these networks. One of the security issues in P2P networks is the security of the message routing. Messages could be altered or modified by attackers while being routed. The conventional security method to avoid this has been “Public Key Cryptography” (PKC). To avoid the certificate management issue in PKC, “Identity-based Encryption” (IBE) has been suggested in which any arbitrary string could be used as a public key. Since IBE is a computationally expensive method, current proposed IBE-based methods are not effective in the message routing phase in P2P networks and highly affect the performance of message delivery time in these networks. This thesis proposes two IBE-based protocols that can be applied effectively to the message routing phase of structured P2P networks, yet provide a satisfactory message delivery time performance. Both protocols benefit from Identity-based key exchange scheme and, therefore, none of them impose any extra communication on the network to secure message routing. Protocol 1 significantly improves the performance of message delivery time compared to the current IBE-based proposed methods. Protocol 2, which requires nodes to store data, has a performance similar to the situations in which no security measures are applied for message routing."

scholarly journals Selfish Caching and Facsimile Allocation over a Mobile Ad Hoc Network

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1953-1958
Keyword(s):  
Mobile Devices ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Peer To Peer ◽  
Selfish Nodes ◽  
Replica Allocation ◽  
Adhoc Networks ◽  
Mobile Ad Hoc ◽  
Few Vertices

Mobile adhoc networks (MANETs) have drawn attention to multitudinous consideration because of the univerality of mobile devices as well as the developments in wireless era. MANET is a peer-to-peer multi hop cellular wireless era community which does not have both difficult and speedy infrastructure and a relevant server. Every vertex of a MANET performs like a router and communicates with every unique. There exist numerous information duplication strategies which were presented to reduce the execution squalor. All are concluded that everyone cell vertices cooperate completely from the perspective of sharing their memory vicinity. But, via a few methods few vertices might additionally behave selfishly and determine simplest to cooperate in part or never with different vertices. The selfish vertices ought to then lessen the overall information approachability within the network. From this work, we try to take a look at the influence of selfish vertices in a mobile ad hoc community in terms of reproduction issuance i.e Selfish nodes are dealt with in replica allocation.

Core Concepts in Peer-to-Peer Networking

2011 ◽  
pp. 1-27 ◽  
Author(s):  
Detlef Schoder ◽  
Kai Fischbach ◽  
Christian Schmitt
Keyword(s):  
Information Systems ◽  
Peer To Peer ◽  
P2p Networks ◽  
Social Challenges ◽  
Management Of Resources ◽  
Core Concepts ◽  
P2p Applications ◽  
Peer To Peer Networking

This chapter reviews core concepts of peer-to-peer (P2P) networking. It highlights the management of resources, such as bandwidth, storage, information, files, and processor cycles based on P2P networks. A model differentiating P2P infrastructures, P2P applications, and P2P communities is introduced. This model provides a better understanding of the different perspectives of P2P. Key technical and social challenges that still limit the potential of information systems based on P2P architectures are discussed.

To Implement an Open-MAS Architecture for Semantic Web Services Discovery

2018 ◽  
pp. 1184-1199
Author(s):  
Mohamed Gharzouli ◽  
Makhlouf Derdour
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Distributed System ◽  
Peer To Peer ◽  
Semantic Web Services ◽  
P2p Networks ◽  
Traffic Generation ◽  
Distributed Technologies ◽  
Multi Agents

Recently, several models have been proposed to design distributed and collaborative infrastructures for web services based systems. In this area, Peer-to-Peer (P2P) networks and Multi-Agents Systems offer many techniques for web services discovery and composition. However, both of the two combinations (P2P/web services and MAS/web services) have suffered from some problems. This article presents a generic P2P/MAS architecture for semantic web services discovery. It tries to merge these two distributed technologies and demonstrate how P2P networks can implement open-MAS architectures to build a collaborative distributed system. The main objective of this article is to find the most appropriate P2P protocol to make such systems. Before the presentation of the proposed architecture, it already presents a background of P2P categories and models. After, it chooses four different P2P protocols wherever it analyzes and discusses, for each one, the stabilization and traffic generation of the network.

Peer-to-Peer File-Sharing

2012 ◽  
pp. 96-112
Author(s):  
Peter Allen ◽  
Katherine Shepherd ◽  
Lynne Roberts
Keyword(s):  
Strong Support ◽  
File Sharing ◽  
Peer To Peer ◽  
Subjective Norms ◽  
Psychological Reactance ◽  
Standard Theory ◽  
P2p Networks ◽  
Planned Behaviour ◽  
Perceived Behavioural Control ◽  
Significant Variance

Despite persistent government and industry efforts to stop the sharing and downloading of media such as files over peer-to-peer (P2P) networks, this activity shows no sign of abating. This research investigated whether psychological reactance could account for variance in the intent to engage in, and the extent of such behaviour beyond that accounted for by the standard Theory of Planned Behaviour (TPB) variables. No support for psychological reactance as a predictor of P2P file downloading intent or behaviour was found in this paper. However, the results did indicate that attitude, subjective norms, and perceived behavioural control each accounted for significant variance in P2P file downloading behaviour, and that these relationships were fully mediated by behavioural intent. These findings are consistent with, and provide strong support for, the use of the TPB within this domain.

To Implement an Open-MAS Architecture for Semantic Web Services Discovery

2014 ◽  
Vol 6 (3) ◽  
pp. 58-71 ◽  
Author(s):  
Mohamed Gharzouli ◽  
Makhlouf Derdour
Keyword(s):  
Web Services ◽  
Semantic Web ◽  
Distributed System ◽  
Peer To Peer ◽  
Semantic Web Services ◽  
P2p Networks ◽  
Traffic Generation ◽  
Distributed Technologies ◽  
Multi Agents

Recently, several models have been proposed to design distributed and collaborative infrastructures for web services based systems. In this area, Peer-to-Peer (P2P) networks and Multi-Agents Systems offer many techniques for web services discovery and composition. However, both of the two combinations (P2P/web services and MAS/web services) have suffered from some problems. This article presents a generic P2P/MAS architecture for semantic web services discovery. It tries to merge these two distributed technologies and demonstrate how P2P networks can implement open-MAS architectures to build a collaborative distributed system. The main objective of this article is to find the most appropriate P2P protocol to make such systems. Before the presentation of the proposed architecture, it already presents a background of P2P categories and models. After, it chooses four different P2P protocols wherever it analyzes and discusses, for each one, the stabilization and traffic generation of the network.

P2P Networks with IP Based Communication

2012 ◽  
Vol 3 (4) ◽  
pp. 51-61
Author(s):  
Anupriya Koneru ◽  
MHM Krishna Prasad
Keyword(s):  
Distributed Computing ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Networks ◽  
Security Issues ◽  
Peer To Peer Networks ◽  
Exchange Information ◽  
Group Members

P2P communities can be seen as truly Distributed Computing applications in which group members communicate with one another to exchange information. The authors consider security issues in Peer to Peer Networks. For secure exchange of data between the group members the authors present a cryptography protocol and an Identity mechanism which can able to check even the Trust of the Peers based on the available reputation information. The authors are encapsulating the reputations of both the provider and the requester. So the requester cannot (gainfully) maliciously abort the transaction in the middle. In other words, the requester cannot take the service from the provider and then logoff without giving a recommendation to the provider.

Peer-to-Peer Technology for File Sharing

2011 ◽  
pp. 372-377
Author(s):  
S. H. Kwok ◽  
Y. M. Cheung ◽  
K. Y. Chan
Keyword(s):  
File Sharing ◽  
Peer To Peer ◽  
Research Projects ◽  
P2p Networks ◽  
P2p Computing ◽  
Client Server ◽  
P2p Systems ◽  
Internet Users ◽  
P2p File Sharing ◽  
P2p Applications

A recent survey revealed that 18 millions American Internet users, or approximately 14% of total American Internet population have peer-to-peer (P2P) file-sharing applications running on their computers (Rainie & Madden, 2004). Not surprisingly, P2P applications have become common tools for information sharing and distribution since the appearance of Napster (Napster, 2003) in 1999. P2P systems are the distributed systems in which all nodes are equal in terms of functionality and able to directly communicate with each other without the coordination of a powerful server. Anonymity, scalability, fault resilience, decentralization and self-organization are the distinct characteristics of P2P computing (Milojicic et al., 2002) compared with the traditional client-server computing. P2P computing is believed to be capable of overcoming limitations of the computing environment placed by the client-server computing model. Milojicic et al. (2002), for example, suggested that P2P computing is capable of providing improved scalability by eliminating the limiting factor, the centralized server existing in the client-server computing. In the past few years, P2P computing and its promised characteristics have caught the attention of researchers who have studied the existing P2P networks, and the advantages and disadvantage of P2P systems. Important findings include the excessive network traffic caused by flooding-based searching mechanism that must be tackled in order to fully utilize the improved scalability of P2P systems (Matei, Iamnitchi, & Foster, 2002; Portmann & Seneviratne, 2002). There were proposed efficient searching techniques targeted for both structured and unstructured P2P systems. Other research projects were conducted to study, and were intended to complement, the drawbacks brought by distinct characteristics of P2P systems. For example, the P2P users’ free-riding behavior is generally attributed to the anonymity of such form of communication (Adar & Huberman, 2000). Recent research projects have shifted to a new line of investigation of P2P networks from the economic perspective and applications of P2P systems in workplaces (Kwok & Gao, 2004; Tiwana, 2003).

scholarly journals Experiences in Developing a Micro-payment System for Peer-to-Peer Networks

2010 ◽  
Vol 5 (1) ◽  
pp. 23-42 ◽  
Author(s):  
Kaylash Chaudhary ◽  
Xiaoling Dai ◽  
John Grundy
Keyword(s):  
Free Rider ◽  
Peer To Peer ◽  
Payment System ◽  
P2p Networks ◽  
Payment Systems ◽  
Content Sharing ◽  
Free Rider Problem ◽  
Proposed Model ◽  
Peer To Peer Networks ◽  
Payment Credit

Micro-payment systems are an important part of peer-to-peer (P2P) networks and address the “free-rider” problem in most existing content sharing systems. To address this issue, the authors have developed a new micro-payment system for content sharing in P2P networks called P2P-Netpay. This is an offline, debit based protocol that provides a secure, flexible, usable and reliable credit service. This article compares micro-payment with non-micro-payment credit systems for file sharing applications and finds that this approach liberates the “free-rider” problem. The authors analyse the heuristic evaluation performed by a set of evaluators and present directions for research aiming to improve the overall satisfaction and efficiency of the proposed model.

Sign in / Sign up

Export Citation Format

Share Document