3,474 research outputs found
Survey of Search and Replication Schemes in Unstructured P2P Networks
P2P computing lifts taxing issues in various areas of computer science. The
largely used decentralized unstructured P2P systems are ad hoc in nature and
present a number of research challenges. In this paper, we provide a
comprehensive theoretical survey of various state-of-the-art search and
replication schemes in unstructured P2P networks for file-sharing applications.
The classifications of search and replication techniques and their advantages
and disadvantages are briefly explained. Finally, the various issues on
searching and replication for unstructured P2P networks are discussed.Comment: 39 Pages 5 Figure
P2P Domain Classification using Decision Tree
In Peer-to-Peer context, a challenging problem is how to find the appropriate
peer to deal with a given query without overly consuming bandwidth? Different
methods proposed routing strategies of queries taking into account the P2P
network at hand. This paper considers an unstructured P2P system based on an
organization of peers around Super-Peers that are connected to Super-Super-
Peer according to their semantic domains; By analyzing the queries log file, a
predictive model that avoids flooding queries in the P2P network is constructed
after predicting the appropriate Super-Peer, and hence the peer to answer the
query. A challenging problem in a schema-based Peer-to-Peer (P2P) system is how
to locate peers that are relevant to a given query. In this paper,
architecture, based on (Super-)Peers is proposed, focusing on query routing.
The approach to be implemented, groups together (Super-)Peers that have similar
interests for an efficient query routing method. In such groups, called
Super-Super-Peers (SSP), Super-Peers submit queries that are often processed by
members of this group. A SSP is a specific Super-Peer which contains knowledge
about: 1. its Super-Peers and 2. The other SSP. Knowledge is extracted by using
data mining techniques (e.g. Decision Tree algorithms) starting from queries of
peers that transit on the network. The advantage of this distributed knowledge
is that, it avoids making semantic mapping between heterogeneous data sources
owned by (Super-)Peers, each time the system decides to route query to other
(Super-) Peers. The set of SSP improves the robustness in queries routing
mechanism, and the scalability in P2P Network. Compared with a baseline
approach,the proposal architecture shows the effect of the data mining with
better performance in respect to response time and precision.Comment: 20 pages, 13 figure
Efficient Super-Peer-Based Queries Routing: Simulation and Evaluation
Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of
internet traffic. P2P systems have emerged as a popular way to share huge
volumes of data. Requirements for widely distributed information systems
supporting virtual organizations have given rise to a new category of P2P
systems called schema- based. In such systems each peer is a database
management system in itself, ex-posing its own schema. A fundamental problem
that confronts peer-to-peer applications is the efficient location of the node
that stores a desired data item. In such settings, the main objective is the
efficient search across peer databases by processing each incoming query
without overly consuming bandwidth. The usability of these systems depends on
effective techniques to find and retrieve data; however, efficient and
effective routing of content- based queries is an emerging problem in P2P
networks. In this paper, we propose an architecture, based on super-peers, and
we focus on query routing. Our approach considers that super-Peers having
similar interests are grouped together for an efficient query routing method.
In such groups, called Knowledge-Super-Peers (KSP), super-peers submit queries
that are often processed by members of this group.Comment: Journal of Emerging Technologies in Web Intelligence, Vol 3, No 3
(2011), 206-216, Aug 201
P2P-PL: A Pattern Language to Design Efficient and Robust Peer-to-Peer Systems
To design peer-to-peer (P2P) software systems is a challenging task, because
of their highly decentralized nature, which may cause unexpected emergent
global behaviors. The last fifteen years have seen many P2P applications to
come out and win favor with millions of users. From success histories of
applications like BitTorrent, Skype, MyP2P we have learnt a number of useful
design patterns. Thus, in this article we present a P2P pattern language
(shortly, P2P-PL) which encompasses all the aspects that a fully effective and
efficient P2P software system should provide, namely consistency of stored
data, redundancy, load balancing, coping with asymmetric bandwidth,
decentralized security. The patterns of the proposed P2P-PL are described in
detail, and a composition strategy for designing robust, effective and
efficient P2P software systems is proposed.Comment: 43 pages, 27 figure
Queries mining for efficient routing in P2P communities
Peer-to-peer (P2P) computing is currently attracting enormous attention. In
P2P systems a very large number of autonomous computing nodes (the peers) pool
together their resources and rely on each other for data and services.
Peer-to-peer (P2P) Data-sharing systems now generate a significant portion of
Internet traffic. Examples include P2P systems for network storage, web
caching, searching and indexing of relevant documents and distributed
network-threat analysis. Requirements for widely distributed information
systems supporting virtual organizations have given rise to a new category of
P2P systems called schema-based. In such systems each peer exposes its own
schema and the main objective is the efficient search across the P2P network by
processing each incoming query without overly consuming bandwidth. The
usability of these systems depends on effective techniques to find and retrieve
data; however, efficient and effective routing of content-based queries is a
challenging problem in P2P networks. This work was attended as an attempt to
motivate the use of mining algorithms and hypergraphs context to develop two
different methods that improve significantly the efficiency of P2P
communications. The proposed query routing methods direct the query to a set of
relevant peers in such way as to avoid network traffic and bandwidth
consumption. We compare the performance of the two proposed methods with the
baseline one and our experimental results prove that our proposed methods
generate impressive levels of performance and scalability.Comment: 20 pages, 9 figures. arXiv admin note: substantial text overlap with
arXiv:1108.137
Query Routing and Processing in Peer-To-Peer Data Sharing Systems
Sharing musical files via the Internet was the essential motivation of early
P2P systems. Despite of the great success of the P2P file sharing systems,
these systems support only "simple" queries. The focus in such systems is how
to carry out an efficient query routing in order to find the nodes storing a
desired file. Recently, several research works have been made to extend P2P
systems to be able to share data having a fine granularity (i.e. atomic
attribute) and to process queries written with a highly expressive language
(i.e. SQL). These works have led to the emergence of P2P data sharing systems
that represent a new generation of P2P systems and, on the other hand, a next
stage in a long period of the database research area. ? The characteristics of
P2P systems (e.g. large-scale, node autonomy and instability) make impractical
to have a global catalog that represents often an essential component in
traditional database systems. Usually, such a catalog stores information about
data, schemas and data sources. Query routing and processing are two problems
affected by the absence of a global catalog. Locating relevant data sources and
generating a close to optimal execution plan become more difficult. In this
paper, we concentrate our study on proposed solutions for the both problems.
Furthermore, selected case studies of main P2P data sharing systems are
analyzed and compared.Comment: 24 Pages, IJDM
Performance Modeling of BitTorrent Peer-to-Peer File Sharing Networks
BitTorrent is undoubtedly the most popular P2P file sharing application on
today's Internet. The widespread popularity of BitTorrent has attracted a great
deal of attention from networking researchers who conducted various performance
studies on it. This paper presents a comprehensive survey of analytical
performance modeling techniques for BitTorrent networks. The performance models
examined in this study include deterministic models, Markov chain models, fluid
flow models, and queuing network models. These models evaluate the performance
metrics of BitTorrent networks at different regimes with various realistic
factors considered. Furthermore, a comparative analysis is conducted on those
modeling techniques in the aspects of complexity, accuracy, extensibility, and
scalability
Adaptive Lookup for Unstructured Peer-to-Peer Overlays
Scalability and efficient global search in unstructured peer-to-peer overlays
have been extensively studied in the literature. The global search comes at the
expense of local interactions between peers. Most of the unstructured
peer-to-peer overlays do not provide any performance guarantee. In this work we
propose a novel Quality of Service enabled lookup for unstructured peer-to-peer
overlays that will allow the user's query to traverse only those overlay links
which satisfy the given constraints. Additionally, it also improves the
scalability by judiciously using the overlay resources. Our approach
selectively forwards the queries using QoS metrics like latency, bandwidth, and
overlay link status so as to ensure improved performance in a scenario where
the degree of peer joins and leaves are high. User is given only those results
which can be downloaded with the given constraints. Also, the protocol aims at
minimizing the message overhead over the overlay network
An Efficient Framework for Network Code based Multimedia Content Distribution in a Hybrid P2P Network
Most of the existing P2P content distribution schemes implement a random or
rarest piece first dissemination procedure to avoid duplicate transmission of
the same pieces of data and rare pieces of data occurring in the network. This
problem can be solved using peer-to-peer content distribution based on network
coding scheme. Network coding scheme uses random linear combination of coded
pieces. Hence the above stated problem can be solved ease and simple. Our
proposed mechanism uses network coding mechanism in which several contents of
same message is grouped into different group and coding operation is performed
only within the same group. The interested peers are also divided into several
groups with each group have the responsibility to spread one set of contents of
some message. The coding system is designed to assure the property that any
subset of the messages can be utilized to decode the original content as long
as the size of the subset is suitably large. To meet this condition, dynamic
smart network coding scheme is defined which assures the preferred property,
then peers are connected in the same group to send the corresponding message,
and connect peers in different groups to disseminate messages for carrying out
decoding operation. Moreover, the proposed system can be readily expanded to
support topology change to get better system performance further in terms of
reliability, link stress and throughput. The simulation results prove that the
proposed system can attain 20 to 25% higher throughput than existing systems,
it also further attains good reliability, link failure and robustness to peer
churn.Comment: this article consists of 14 page
A Comparative Study of Replication Techniques in Grid Computing Systems
Grid Computing is a type of parallel and distributed systems that is designed
to provide reliable access to data and computational resources in wide area
networks. These resources are distributed in different geographical locations,
however are organized to provide an integrated service. Effective data
management in today`s enterprise environment is an important issue. Also,
Performance is one of the challenges of using these environments. For improving
the performance of file access and easing the sharing amongst distributed
systems, replication techniques are used. Data replication is a common method
used in distributed environments, where essential data is stored in multiple
locations, so that a user can access the data from a site in his area. In this
paper, we present a survey on basic and new replication techniques that have
been proposed by other researchers. After that, we have a full comparative
study on these replication strategies. Also, at the end of the paper, we
summarize the results and points of these replication techniques.Comment: 10 pages, 3 figures, 4 tabl
- …