Abstract: File sharing in networks is generally achieved using
Peer-to-Peer (P2P) applications. Structured P2P approaches are
widely used in adhoc networks due to its distributed and scalability
features. Efficient mechanisms are required to handle the huge
amount of data distributed to all peers. The intrinsic characteristics of
P2P system makes for easier content distribution when compared to
client-server architecture. All the nodes in a P2P network act as both
client and server, thus, distributing data takes lesser time when
compared to the client-server method. CHORD protocol is a resource
routing based where nodes and data items are structured into a 1-
dimensional ring. The structured lookup algorithm of Chord is
advantageous for distributed P2P networking applications. However,
structured approach improves lookup performance in a high
bandwidth wired network it could contribute to unnecessary overhead
in overlay networks leading to degradation of network performance.
In this paper, the performance of existing CHORD protocol on
Wireless Mesh Network (WMN) when nodes are static and dynamic
is investigated.
Abstract: P2P Networks are highly dynamic structures since
their nodes – peer users keep joining and leaving continuously. In the
paper, we study the effects of network change rates on query routing
efficiency. First we describe some background and an abstract system
model. The chosen routing technique makes use of cached metadata
from previous answer messages and also employs a mechanism for
broken path detection and metadata maintenance. Several metrics are
used to show that the protocol behaves quite well even with high rate
of node departures, but above a certain threshold it literally breaks
down and exhibits considerable efficiency degradation.
Abstract: The survey and classification of the different security
attacks in structured peer-to-peer (P2P) overlay networks can be
useful to computer system designers, programmers, administrators,
and users. In this paper, we attempt to provide a taxonomy of
structured P2P overlay networks security attacks. We have specially
focused on the way these attacks can arise at each level of the
network. Moreover, we observed that most of the existing 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.
Abstract: It is expected that ubiquitous era will come soon. A ubiquitous environment has features like peer-to-peer and nomadic environments. Such features can be represented by peer-to-peer systems and mobile ad-hoc networks (MANETs). The features of P2P systems and MANETs are similar, appealing for implementing P2P systems in MANET environment. It has been shown that, however, the performance of the P2P systems designed for wired networks do not perform satisfactorily in mobile ad-hoc environment. Subsequently, this paper proposes a method to improve P2P performance using cross-layer design and the goodness of a node as a peer. The proposed method uses routing metric as well as P2P metric to choose favorable peers to connect. It also utilizes proactive approach for distributing peer information. According to the simulation results, the proposed method provides higher query success rate, shorter query response time and less energy consumption by constructing an efficient overlay network.
Abstract: Recently, there have been considerable efforts towards the convergence between P2P and Grid computing in order to reach a solution that takes the best of both worlds by exploiting the advantages that each offers. Augmenting the peer-to-peer model to the services of the Grid promises to eliminate bottlenecks and ensure greater scalability, availability, and fault-tolerance. The Grid Information Service (GIS) directly influences quality of service for grid platforms. Most of the proposed solutions for decentralizing the GIS are based on completely flat overlays. The main contributions for this paper are: the investigation of a novel resource discovery framework for Grid implementations based on a hierarchy of structured peer-to-peer overlay networks, and introducing a discovery algorithm utilizing the proposed framework. Validation of the framework-s performance is done via simulation. Experimental results show that the proposed organization has the advantage of being scalable while providing fault-isolation, effective bandwidth utilization, and hierarchical access control. In addition, it will lead to a reliable, guaranteed sub-linear search which returns results within a bounded interval of time and with a smaller amount of generated traffic within each domain.