scholarly journals CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer-to-Peer Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-20 ◽  
Author(s):  
Hongyan Mei ◽  
Yujie Zhang ◽  
Xiangwu Meng
Keyword(s):  
Search Algorithm ◽  
Dynamic Network ◽  
Peer To Peer ◽  
P2p Networks ◽  
Network Bandwidth ◽  
Search Mechanism ◽  
Peer To Peer Networks ◽  
Network Topologies ◽  
Unstructured P2p ◽  
Bandwidth Consumption

Efficient searching for resources has become a challenging task with less network bandwidth consumption in unstructured peer-to-peer (P2P) networks. Heuristic search mechanism is an effective method which depends on the previous searches to guide future ones. In the proposed methods, searching for high-repetition resources is more effective. However, the performances of the searches for nonrepetition or low-repetition or rare resources need to be improved. As for this problem, considering the similarity between social networks and unstructured P2P networks, we present a credibility search algorithm based on different queries according to the trust production principle in sociology and psychology. In this method, queries are divided into familiar queries and unfamiliar queries. For different queries, we adopt different ways to get the credibility of node to its each neighbor. And then queries should be forwarded by the neighbor nodes with higher credibility. Experimental results show that our method can improve query hit rate and reduce search delay with low bandwidth consumption in three different network topologies under static and dynamic network environments.

scholarly journals Peer-to-Peer Networks for Content Sharing

2011 ◽  
pp. 28-65 ◽  
Author(s):  
Choon Hoong Ding ◽  
Sarana Nutanong ◽  
Rajkumar Buyya
Keyword(s):  
File Sharing ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Networks ◽  
P2p Computing ◽  
P2p Systems ◽  
Content Sharing ◽  
Peer To Peer Networks ◽  
Network Topologies ◽  
Broad Overview

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.

Efficient Searching in Peer-to-Peer Networks Using Agent-Enabled Ant Algorithms

2007 ◽  
pp. 721-738
Author(s):  
P. Dasgupta
Keyword(s):  
Search Algorithm ◽  
Software Agents ◽  
Peer To Peer ◽  
P2p Networks ◽  
Ant Algorithms ◽  
Resource Search ◽  
Successful Search ◽  
Peer To Peer Networks ◽  
Efficient Resource ◽  
Blind Search

In this chapter we describe a mechanism to search for resources in unstructured peer-to- peer (P2P) networks using ant algorithms implemented through software agents. Traditional resource search algorithms in P2P networks use an uninformed or blind search among the various nodes of the network. In contrast, the resource search algorithm described in this chapter performs an informed search using the ant-based heuristic. In our algorithm, ants, implemented as software agents, are created in response to a user’s resource search query. An ant reinforces the route that yields a successful search for directing ants in the future towards nodes with higher probability of locating resources. We describe and compare different reinforcement strategies used by ants to perform efficient resource search in 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.  

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.

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.

An Efficient Search Scheme in Unstructured Peer-to-Peer Networks

2011 ◽  
Vol 211-212 ◽  
pp. 295-299 ◽  
Author(s):  
Ya Dong Gong ◽  
He Ping Deng ◽  
Zhan Ran Gu ◽  
Ji Ye Hu ◽  
Yong Xiang Wen
Keyword(s):  
Success Rate ◽  
System Performance ◽  
Peer To Peer ◽  
Query Answering ◽  
Peer Networks ◽  
Search Efficiency ◽  
P2p Networks ◽  
Peer To Peer Networks ◽  
High Bandwidth ◽  
Simulation Results

In peer-to-peer (P2P) networks, nodes are quite different from each other in many aspects, such as sharing resources, online time and bandwidth. Some approaches have been introduced to take advantage of the query forwarding and answering heterogeneity such that the high bandwidth and query answering capability of nodes can be fully utilized to improve the system performance. In this paper, we suggest using the online time heterogeneity to improve the search efficiency of P2P networks. In our proposed Differentiated Index (Diff-Index) algorithm, the nodes with long online time will have higher priority to be queried. Because the online time is quite different among nodes, much search traffic can be saved by querying only a small portion of a network. The query success rate can be kept high because the nodes sharing a great amount of resources tend to have long online time. Our simulation results show that the Diff-Index algorithm can save 66 percent of search traffic.

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.

Sign in / Sign up

Export Citation Format

Share Document