Investigating Cybercrimes that Occur on Documented P2P Networks

2011 ◽  
Vol 3 (2) ◽  
pp. 56-63
Author(s):  
Mark Scanlon ◽  
Alan Hannaway ◽  
Mohand-Tahar Kechadi

The popularity of Peer-to-Peer (P2P) Internet communication technologies being exploited to aid cybercrime is ever increasing. P2P systems can be used or exploited to aid in the execution of a large number of online criminal activities, e.g., copyright infringement, fraud, malware and virus distribution, botnet creation, and control. P2P technology is perhaps most famous for the unauthorised distribution of copyrighted materials since the late 1990’s, with the popularity of file-sharing programs such as Napster. In 2004, P2P traffic accounted for 80% of all Internet traffic and in 2005, specifically BitTorrent traffic accounted for over 60% of the world’s P2P bandwidth usage. This paper outlines a methodology for investigating a documented P2P network, BitTorrent, using a sample investigation for reference throughout. The sample investigation outlined was conducted on the top 100 most popular BitTorrent swarms over the course of a one week period.

Author(s):  
Mark Scanlon ◽  
Alan Hannaway ◽  
Mohand-Tahar Kechadi

The popularity of Peer-to-Peer (P2P) Internet communication technologies being exploited to aid cybercrime is ever increasing. P2P systems can be used or exploited to aid in the execution of a large number of online criminal activities, e.g., copyright infringement, fraud, malware and virus distribution, botnet creation, and control. P2P technology is perhaps most famous for the unauthorised distribution of copyrighted materials since the late 1990’s, with the popularity of file-sharing programs such as Napster. In 2004, P2P traffic accounted for 80% of all Internet traffic and in 2005, specifically BitTorrent traffic accounted for over 60% of the world’s P2P bandwidth usage. This paper outlines a methodology for investigating a documented P2P network, BitTorrent, using a sample investigation for reference throughout. The sample investigation outlined was conducted on the top 100 most popular BitTorrent swarms over the course of a one week period.


Author(s):  
S. H. Kwok ◽  
Y. M. Cheung ◽  
K. Y. Chan

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).


2011 ◽  
pp. 28-65 ◽  
Author(s):  
Choon Hoong Ding ◽  
Sarana Nutanong ◽  
Rajkumar Buyya

Peer-to-peer (P2P) systems are popularly used as “file swapping” networks to support distributed content sharing. A number of P2P networks for file sharing have been developed and deployed. Napster, Gnutella, and Fasttrack are three popular P2P systems. This chapter presents a broad overview of P2P computing and focuses on content sharing networks and technologies. It also emphasizes on the analysis of network topologies used in popular P2P systems. In addition, this chapter also identifies and describes architecture models and compares various characteristics of four P2P systems—Napster, Gnutella, Fasttrack, and OpenFT.


2013 ◽  
Vol 339 ◽  
pp. 285-291
Author(s):  
Yong Qiong Zhu ◽  
Rui Min Hu

In this paper we focus on replication method in unstructured Peer-to-Peer (P2P) networks. Most current replication approaches are designed for the structured P2P systems. The EAD is specific for the unstructured P2P network, but the replica utilization is low and has the bump problem. In order to acquire more replica utilization and search efficiency, we propose a decentralized replication methodsFTR. The proposed algorithm can calculate the real query flow of node according to the order of the node selected. Experiment on the simulation proves that our method can enhance search success rate and replica hit rate.


2011 ◽  
Vol 295-297 ◽  
pp. 1945-1950
Author(s):  
Ya Dong Gong ◽  
Yong Xiang Wen ◽  
He Ping Deng ◽  
Zhan Ran Gu

Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, the heterogeneity is an inherent characteristic of P2P systems. In this paper, according to the previous researches in P2P resource sharing networks, we first conclude and classify the heterogeneity in P2P networks, and then analyze each type of P2P systems that utilize heterogeneity in P2P network. The above analysis and conclusion will become a good guidance to design new resource locating algorithm which takes advantage of heterogeneity in P2P networks.


Author(s):  
Dang Dinh Trang ◽  
Roland Pereczes ◽  
Sándor Molnár

Recently  peer-to-peer  file-sharing applications  have  shown  an  extreme  popularity  and the  workload  generated  to  the  Internet  has  been dominated  by  the  traffic  coming  from  these applications.  In  this  paper  we  develop  a  simple  but effective  mathematical  model  to  capture  the  file population  dynamics  of  such  systems.  Our  modeling framework  is  based  on  the  theory  of  branching processes. We describe analytically the behavior of the proposed  model.  The  precise  characterization  of  the necessary  and  sufficient  conditions  of  population extinction  or  explosion  is  given  based  on  the  system parameters.  We  also  present  the  expected  ratio  of active,  passive  and  dead  peers  for  the  long-term regime.  We  validate  and  demonstrate  our  results  in several  simulation  studies.  Based  on  our  results  we propose  a  number  of  engineering  guidelines  to  the design and control of file-sharing P2P systems.


2018 ◽  
Vol 7 (2.7) ◽  
pp. 1051
Author(s):  
Gera Jaideep ◽  
Bhanu Prakash Battula

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.  


Author(s):  
Peter Allen ◽  
Katherine Shepherd ◽  
Lynne Roberts

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.


2010 ◽  
pp. 138-156
Author(s):  
Jenneke Fokker ◽  
Huib de Ridder ◽  
Piet Westendorp ◽  
Johan Pouwelse

Television and the Internet have proven to be a popular combination for both broadcasters and viewers. Because of this popularity they are increasingly facing the consequences of central bottlenecks, which could be overcome by taking a different approach: Peer-to-Peer (P2P) technology. However, P2P systems can only be successful with as much cooperation among as many users as possible. This chapter explains how this cooperation is hard to enforce, and how inducing it might be more successful. Relevant psychological theories are listed that can be used to induce this user cooperation, along with possible applications of cooperation inducing mechanisms for Peer-to-Peer Television (P2P-TV) systems. The authors aim to provide practical criteria along which these mechanisms can be evaluated on their contribution to social activity in P2P-TV systems.


Sign in / Sign up

Export Citation Format

Share Document