Optimising P2P Networks by Adaptive Overlay Construction

2011 ◽  
pp. 882-894
Author(s):  
James Salter ◽  
Nick Antonopoulos
Keyword(s):  
Network Size ◽  
Peer To Peer ◽  
Peer Networks ◽  
Distributed Hash Tables ◽  
P2p Networks ◽  
Hash Tables ◽  
Peer To Peer Networks ◽  
Routing State ◽  
Node Capacity ◽  
Chord Protocol

Distributed Hash Tables (DHTs) have been used in Peer-to-Peer networks to provide query lookups in typically O(log n) messages whilst requiring maintenance of only small amounts of routing state. We propose ROME, a layer which runs on top of the Chord DHT to provide control over network size through monitoring of node workload and propose the use of processes to control the addition or removal of nodes from the network. We show that this technique can reduce further the hop counts in networks where available node capacity exceeds workload, without the need to modify any processes of the underlying Chord protocol.

scholarly journals A Balanced Trust-Based Method to Counter Sybil and Spartacus Attacks in Chord

2018 ◽  
Vol 2018 ◽  
pp. 1-16
Author(s):  
Riccardo Pecori ◽  
Luca Veltri
Keyword(s):  
Peer To Peer ◽  
Peer Networks ◽  
Distributed Hash Tables ◽  
Sybil Attack ◽  
Hash Tables ◽  
Storage And Retrieval ◽  
Trust And Reputation ◽  
Peer To Peer Networks ◽  
Routing Tables ◽  
Standard Operations

A Sybil attack is one of the main challenges to be addressed when securing peer-to-peer networks, especially those based on Distributed Hash Tables (DHTs). Tampering routing tables by means of multiple fake identities can make routing, storing, and retrieving operations significantly more difficult and time-consuming. Countermeasures based on trust and reputation have already proven to be effective in some contexts, but one variant of the Sybil attack, the Spartacus attack, is emerging as a new threat and its effects are even riskier and more difficult to stymie. In this paper, we first improve a well-known and deployed DHT (Chord) through a solution mixing trust with standard operations, for facing a Sybil attack affecting either routing or storage and retrieval operations. This is done by maintaining the least possible overhead for peers. Moreover, we extend the solution we propose in order for it to be resilient also against a Spartacus attack, both for an iterative and for a recursive lookup procedure. Finally, we validate our findings by showing that the proposed techniques outperform other trust-based solutions already known in the literature as well.

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.

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.

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.

Hierarchical Structured Peer-to-Peer Networks

2010 ◽  
pp. 140-162
Author(s):  
Yong Meng Teo ◽  
Verdi March ◽  
Marian Mihailescu
Keyword(s):  
Overlay Network ◽  
Peer To Peer ◽  
Peer Networks ◽  
Hash Tables ◽  
Network Applications ◽  
Collision Problem ◽  
Peer To Peer Networks ◽  
Network Maintenance ◽  
Scale Network ◽  
Overlay Graph

Structured peer-to-peer networks are scalable overlay network infrastructures that support Internet-scale network applications. A globally consistent peer-to-peer protocol maintains the structural properties of the network with peers dynamically joining, leaving and failing in the network. In this chapter, the authors discuss hierarchical distributed hash tables (DHT) as an approach to reduce the overhead of maintaining the overlay network. In a two-level hierarchical DHT, the top-level overlay consists of groups of nodes where each group is distinguished by a unique group identifier. In each group, one or more nodes are designated as supernodes and act as gateways to nodes at the second level. Collisions of groups occur when concurrent node joins result in the creation of multiple groups with the same group identifier. This has the adverse effects of increasing the lookup path length due to a larger top-level overlay, and the overhead of overlay network maintenance. We discuss two main approaches to address the group collision problem: collision detection-and-resolution, and collision avoidance. As an example, they describe an implementation of hierarchical DHT by extending Chord as the underlying overlay graph.

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.

scholarly journals Digital Business Models for Peer-to-Peer Networks: Analysis and Economic Issue

2007 ◽  
Vol 6 (2) ◽  
Author(s):  
Ramayya Krishnan ◽  
Michael D. Smith ◽  
Zhulei Tang ◽  
Rahul Telang
Keyword(s):  
Business Models ◽  
Peer To Peer ◽  
Peer Networks ◽  
P2p Networks ◽  
Distribution Strategy ◽  
Commercial Media ◽  
Digital Business Models ◽  
Media Distribution ◽  
Peer To Peer Networks ◽  
Networks Analysis

Peer-to-peer (P2P) services allow users to share networked resources, notably bandwidth and content, from the edges of the network. These services have been popularized because of file sharing – particularly the sharing of unlicensed copyrighted files. However, content owners are increasingly exploring the ability of peer-to-peer networks to accommodate legitimate content distribution and promotion. In this article, we review the economic characteristics of P2P networks and outline the implications of these characteristics on efforts to counteract illegal piracy and on potential uses of P2P networks in a commercial media distribution strategy.

Partition Nodes: Topologically-Critical Nodes of Unstructured Peer-to-Peer Networks

2008 ◽  
Vol 19 (9) ◽  
pp. 2376-2388 ◽  
Author(s):  
Zhen-Hua LI ◽  
Gui-Hai CHEN ◽  
Tong-Qing QIU
Keyword(s):  
Peer To Peer ◽  
Peer Networks ◽  
Critical Nodes ◽  
Peer To Peer Networks
Sign in / Sign up

Export Citation Format

Share Document