Structured P2P Overlay Networks Research Articles

Unreachable Peers Communication Scheme in Decentralized Networks Based on Peer-to-Peer Overlay Approaches

Decentralized networks bring us many benefits, but as networks evolve, many nodes either actively or passively become unreachable behind an NAT or a firewall. This has become a hindrance to the development of decentralized networks, where peer-to-peer communication data transfer between unreachable nodes cannot be accomplished, whether in decentralized file systems, decentralized social, or decentralized IoT. The existing scheme requires a series of centralized servers or requires network-wide flooding for consensus data, which can lead to the loss of decentralized nature of the network and cause flooding bottlenecks, contrary to the design concept of decentralization. In this paper, our proposed scheme uses a structured P2P overlay network to store the indexes of unreachable nodes in the whole network, so that the characteristics of a decentralized network are still maintained while ensuring the efficiency of lookup. When nodes communicate, the transmission channel is established so that both nodes continuously transmit data streams peer-to-peer without relying on the central server. Moreover, the scheme guarantees the security and privacy of nodes’ data transmission and the P2P overlay network without relying on centralized trusted institutions. Finally, we deploy a real cluster environment to verify the effectiveness of each module at different network sizes and prove the overall feasibility of the scheme. The scheme has certain advantages over existing solutions in terms of security, privacy, communication efficiency, device democracy, etc.

Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P

This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P network.

Preventing Sybil attacks in chord and Kademlia protocols

Structured p2p overlay networks, such as chord, Kademlia, CAN, pastry and tapastry allow participant to generate multiple identities on shared physical node. This practice of Sybil attacks introduces the risks of damaging the routing protocol and blocking access to information by impeding queries. Most existing security monitoring mechanisms are inefficient when applied to structured p2p overlay networks. In this work we propose a monitoring strategy allowing the decrease of Sybil nodes rate. We investigate this problem and find ways to detect suspicious behaviours. The key idea of our solution is to use the attack against the attack. We use Sybil attacks to infiltrate and launch monitor peers under different strategies to maximise the likelihood of detection. We were able to infiltrate and monitor in-depth the overlay using a small number of Sybils introduced in strategic zones, which allows us to estimate the number of malicious nodes. The proposed strategy is evaluated against the use of multiple identities both in chord and Kademlia protocols as most cited and popular p2p overlay networks. We find that adoption of limited number of monitors makes Sybil attacks ineffective.

Detection of Sybil Attacks in Structured P2P Overlay Network

Sybil attack in computer security is an attack where in a reputation system is subverted by forging identities in peer- to-peer networks. The name was suggested in or before 2002 by Brian Zill at Microsoft Research. In a Sybil attack the attacker subverts the reputation system of a peer-to- peer network by creating a large number of pseudonymous identities, using them to gain a disproportionately large influence. A reputation system's vulnerability to a Sybil attack depends on how cheaply identities can be generated, the degree to which the reputation system accepts inputs from entities that do not have a chain of trust linking them to a trusted entity, and whether the reputation system treats all entities identically. Main motto is to secure the Peer to Peer network (P2P) by Sybil attackers. Considering more parameter for labeling a node genuine or Sybil. Our system has two server one is main server and another is trusted server. Trusted server is act as a centralized server so it has the complete list of members with their details. So when the new member is added to the network, trusted server take the identity check test with its database by checking the new member details with the complete database. If it found common parameters then it label that member as Sybil otherwise genuine.

Delay and capacity analysis of structured P2P overlay for lookup service

In this paper, we provide an analytical model for the performance study of different structured P2P overlay networks used for lookup service in IP telephony systems. The overlay provides an infrastructure for the lookup service required before an actual voice communication is initiated. Our model captures the performance behavior of such overlays including the mean session set-up delay of a call as well as the system capacity. These parameters reflect how good an IP telephony overlay is performing. We formulate the system as a queuing network. We idealize Chord routing semantics to extract useful observations to obtain closed form expressions for the session setup delay and capacity as a function of the number of participating supernodes (SN). The analysis also answers the question of finding an optimum number of SN for minimum session setup delay.

Sybil Nodes as a Mitigation Strategy Against Sybil Attack

Sybil attack is considered one of the most damaged attack that menace structured p2p overlay networks. It's the most sophisticated node active, used for a variety of illicit activities. A key requirement for these activities is the ability of such malicious user to generate a huge number of node identifiers and possibly choose some of them in order to disrupt availability and integrity in such systems. This paper highlights the problem of Sybil attack and presents a Sybil tracking process to deal with such problem.

Hierarchical architectures in structured peer-to-peer overlay networks

Distributed Hash Tables (DHT) are presently used in several large-scale systems in the Internet and envisaged as a key mechanism to provide identifier-locator separation for mobile hosts in Future Internet. Such P2P-based systems become increasingly complex serving popular social networking, resource sharing applications, and Internet-scale infrastructures. Hierarchy is a standard mechanism for coping with heterogeneity and scalability in distributed systems. To address the shortcomings of flat DHT designs, many hierarchical P2P designs have been proposed over recent years. The last generation is hierarchical DHTs (HDHTs) where nodes are organized onto layers and groups. This article discusses hierarchical architectures applied in structured P2P overlay networks, focusing on HDHT designs. We introduce a framework consisting of conceptual models of network hierarchy, multi-layer hierarchical DHT architectures, principles affecting the design choices, and cost models for system tradeoff analysis, performance evaluation, and scalability estimation. Based on the framework we provide a taxonomy and survey more than 20 hierarchical HDHT proposals.

Taxonomy of Structured P2P Overlay Networks Security Attacks

The survey and classification of the different secu rity attacks in structured peer-to-peer (P2P) overlay ne tworks can be useful to computer system designers, programmers, administrators, and users. In this paper, we attempt to provide a t axonomy of structured P2P overlay networks security attacks. W e have specially focused on the way these attacks can arise at each level of the network. Moreover, we observed that most of the exi sting systems such as Content Addressable Network (CAN), Chord, Pastry, Tapestry, Kademlia, and Viceroy suffer from threats and vulnerability which lead to disrupt and corrupt their functioning . We hope that our survey constitutes a good help for who's working on this area of research. Keywords—P2P, Structured P2P Overlay Networks, DHT, Security, classification I. INTRODUCTION 2P networks systems have generated substantial inte rest in the last few years because the emergent of global s cale phenomena. As more and more users own powerful processors, large storage spaces and fast network c onnections, P2P networks represent an attractive way to mobiliz e these resources. They were designed to provide many services such as creating large scale data sharing, distributed c omputing, instant messages communication, collaborative appli cations, multi players games, and ad-hoc network. These popular services make P2P networks an attractive target for attackers. Knowing how systems have failed can help us build systems that resist failure (1). This paper collects and or ganizes a number of current security attacks that have caused failure in structured P2P overlay networks, so computer system designer, programmers, administrators, and users ma y do their work with a precise knowledge of what has gone before. Based on the overlay topology and the organization of the network connection different types of P2P networks have been defined as hierarchical P2P network, and flat P2P n etwork. In this paper, we will focus on hierarchical P2P netwo rk, more precisely on structured P2P overlay networks. Security attacks of structured P2P overlay network are any condition or circumstance that can threaten the bes t functioning of the system. To evaluate these attacks, an analyst must do a dee ply research, understand the system fluently, and recog nize that attacks may exist anywhere in the system.

A Binary-Tree based Hierarchical Load Balancing Algorithm in Structured Peer-to-Peer Systems

In structured P2P overlay networks, nodes and objects are assigned unique IDs in the same identifier space by using a consistent hashing function, and have been known to result in an imbalance factor of O(log n), where n is the number of nodes in the systems. Further imbalance may become severely due to the heterogeneity of objects loads and nodes capacities, and dynamic of objects and nodes in practical P2P network environment. Aiming at the issue of load distribution unbalancing in large scale DHT network, a binary-tree hierarchical load balance model is presented in this paper. Our proposed load balance model organizes the system into a hierarchy of balancing domain, therefore, load balancing decision are based solely on information pertaining to those nodes within each domain, and thus load balancing is performed independently. In addition, because our load balancing scheme is built on the proximity-aware hypercube overlay network, therefore, the loads on the heavily nodes can be transferred to lightly loaded nodes in a proximity-aware fashion. Consequently, it provides rapid convergence on load balance and reduces the load transfer cost. Simulations show that our proposed scheme can balance the load of the nodes in proportion to their capacity, and reduced the load transfer cost in the heterogeneous and dynamic network state.

P2PONS: A Distributed Object Naming Service Architecture based on P2P for EPC Network

This paper presents a distributed object naming service based on P2P for EPC network. Each participant is a peer in the P2PONS network. These peers form a structured P2P overlay network with each peer having partial EPC association information of other peers. The experiment results show that the proposed object naming resolution mechanism has low lookup hops, response time and load balance for server, and the proposed method has many advantages such as tolerance for single point failure, good scalability, robust, etc.

Continuous Join Query Processing over Structured Overlay Networks

P2P network is more suitable for distributed data flow processing. This paper concentrates on how to answer continuous join query in structured p2p overlay networks. In the algorithm proposed, the data that cannot contribute the queries’ results will not be distributed in the network based on global query indices. Experiment shows that the algorithm ensures the availability of join query and network traffic is reduced.

A Multi-Dimensional Query Scheme in Structured Overlays

Structured peer-to-peer (P2P) systems are creating a large proportion of network traffic in today’s Internet. Peer-to-peer systems enable access to data spread over an extremely large number of machines. A P2P system typically involves thousands or millions of live peers in the network. Multi-dimensional data indexing has received much attention in a centralized database. In this paper, we propose and evaluate a multi-dimensional searching scheme in structured P2P networks. We present the design and implementation of a peer-to-peer index service for high dimensional data that is capable of handling complex queries. We design a VibIndex scheme in structured P2P overlay networks. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to search efficiently.

Assisted interest-based method for searching shared files in P2P network

Having studied the advantages and disadvantages of some traditional searching methods in structured and unstructured P2P networks, an assisted interest-based searching method was proposed to enhance the search in unstructured P2P overlay networks by registering interests of nodes in structured P2P overlay networks. Experimental results show that this method achieves good performance in success rate and search latency.

Dynamic Web Service discovery architecture based on a novel peer based overlay network

Service Oriented Computing and its most famous implementation technology Web Services (WS) are becoming an important enabler of networked business models. Discovery mechanisms are a critical factor to the overall utility of Web Services. So far, discovery mechanisms based on the UDDI standard rely on many centralized and area-specific directories, which poses information stress problems such as performance bottlenecks and fault tolerance. In this context, decentralized approaches based on Peer to Peer overlay networks have been proposed by many researchers as a solution. In this paper, we propose a new structured P2P overlay network infrastructure designed for Web Services Discovery. We present theoretical analysis backed up by experimental results, showing that the proposed solution outperforms popular decentralized infrastructures for web discovery, Chord (and some of its successors), BATON (and it’s successor) and Skip-Graphs.

A structured P2P network based on the small world phenomenon

In this paper, we propose a new structured P2P overlay network, named SW-Uinta(small-world). In order to reduce the routing latency, we firstly construct the Uinta network in which both physical characteristics of network and data semantic are considered. Furthermore, based on Uinta, a nondeterministic caching strategy is employed to allow for poly-logarithmic search time while having only a constant cache size. Compared with the deterministic caching strategy proposed by previous P2P systems, the nondeterministic caching strategy can reduce communication overhead for maintaining the routing cache table. Cache entries in the cache table of peer nodes can be updated by subsequent queries rather than only by running stabilization periodically. In the following, a novel cache replacement scheme, named the SW cache replacement scheme, is used to improve lookup performance, which has proved to satisfy the small-world principle. So we call this network SW-Uinta(small-world). After that, according to the theoretical analysis, it can be proved that SW-Uinta(small-world) can get O((log?2 N)/k) search time with O(k) cache size. Lastly, the performance of SW-Uinta(small-world) is compared with those of other structured P2P networks such as Chord and Uinta. It shows that SW-Uinta(small-world) can achieve improved object lookup performance and reduce maintenance cost.

Message Passing in Semantic Peer-to-Peer Overlay Networks [Exploratory DSP

In this column, we discuss exploratory research related to data management in P2P overlay networks. First, we discuss the notions of unstructured and structured P2P overlay networks. Then, we discuss data management in such networks by introducing an additional layer to handle semantic heterogeneity and data integration. Finally, we present a method based on sum-product message passing to detect inconsistent information in this setting.