ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS

2011 ◽  
Vol 14 (04) ◽  
pp. 611-633 ◽  
Author(s):  
JOYDEEP CHANDRA ◽  
NILOY GANGULY
Keyword(s):  
Peer Networks ◽  
P2p Network ◽  
Network Coverage ◽  
P2p Networks ◽  
Extensive Simulation ◽  
Back Cross ◽  
Peer To Peer Networks ◽  
Unstructured P2p Network ◽  
Unstructured P2p ◽  
Query Packet

In this paper, we develop methods to estimate the network coverage of a TTL-bound query packet undergoing flooding on an unstructured p2p network. The estimation based on the degree distribution of the networks, reveals that the presence of certain cycle-forming edges, that we name as cross and back edges, reduces the coverage of the peers in p2p networks and also generate a large number of redundant messages, thus wasting precious bandwidth. We therefore develop models to estimate the back/cross edge probabilities and the network coverage of the peers in the presence of these back and cross edges. Extensive simulation is done on random, power-law and Gnutella networks to verify the correctness of the model. The results highlight the fact that for real p2p networks, which are large but finite, the percentage of back/cross edges can increase enormously with increasing distance from a source node, thus leading to huge traffic redundancy.

ISW

2012 ◽  
Vol 4 (4) ◽  
pp. 26-40
Author(s):  
Jinlong Zeng ◽  
Guifeng Zheng
Keyword(s):  
Small World ◽  
Clustering Coefficient ◽  
P2p Network ◽  
Small World Network ◽  
Challenging Problem ◽  
P2p Networks ◽  
User Interest ◽  
Unstructured P2p Network ◽  
Simulation Results ◽  
Unstructured P2p

Content location in unstructured peer-to-peer (P2P) networks is a challenging problem. In this paper, the authors present a novel Interest-based Small World (ISW) network to address the problem, by constructing a cluster overlay in the unstructured P2P network based on the small world paradigm and user interest. There are many attractive properties of a small world network, such as low average hop distance and high clustering coefficient. Interest locality can improve the awareness of user’s indeed intentions. The authors’ scheme combines their advantage to create a better solution. The simulation results show that our scheme outperforms other schemes significantly.

A Replication Algorithm Considering the Node Traffic for P2P Networks

2013 ◽  
Vol 339 ◽  
pp. 285-291
Author(s):  
Yong Qiong Zhu ◽  
Rui Min Hu
Keyword(s):  
Success Rate ◽  
Peer To Peer ◽  
P2p Network ◽  
Search Efficiency ◽  
P2p Networks ◽  
P2p Systems ◽  
Replication Method ◽  
Hit Rate ◽  
Unstructured P2p Network ◽  
Unstructured P2p

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.

Leveraging Heterogeneity Make Resource Location Efficient in Peer-to-Peer Networks

2011 ◽  
Vol 295-297 ◽  
pp. 1945-1950
Author(s):  
Ya Dong Gong ◽  
Yong Xiang Wen ◽  
He Ping Deng ◽  
Zhan Ran Gu
Keyword(s):  
Resource Sharing ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Network ◽  
P2p Networks ◽  
Resource Location ◽  
Original Intent ◽  
P2p Systems ◽  
Inherent Characteristic ◽  
Peer To Peer Networks

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.

DrTrust: A trust model in unstructured P2P network

2009 ◽  
Vol 29 (2) ◽  
pp. 503-506
Author(s):  
Yun-chang ZHANG ◽  
Jian-xin CHEN ◽  
Shan-shan CHEN
Keyword(s):  
Trust Model ◽  
P2p Network ◽  
Unstructured P2p Network ◽  
Unstructured P2p

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.  

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.

Sign in / Sign up

Export Citation Format

Share Document