158,047 research outputs found
Exploiting Semantic Proximity in Peer-to-Peer Content Searching
A lot of recent work has dealt with improving performance of content searching in peer-to-peer file sharing systems. In this paper we attack this problem by modifying the overlay topology describing the peer relations in the system. More precisely, we create a semantic overlay, linking nodes that are "semantically close", by which we mean that they are interested in similar documents. This semantic overlay provides the primary search mechanism, while the initial peer-to-peer system provides the fail-over search mechanism. We focus on implicit approaches for discovering semantic proximity. We evaluate and compare three candidate methods, and review open questions
Analysis and Comparison of P2P Search Methods
The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Internet community. Efficient object discovery is the first step towards the realization of distributed resource-sharing. In this work, we present a detailed overview of recent and existing search methods for unstructured Peer-to-Peer networks. We analyze the performance of the algorithms relative to various metrics, giving emphasis on the success rate, bandwidth-efficiency and adaptation to dynamic network conditions. Simulation results are used to empirically evaluate the behavior of nine representative schemes under a variety of different environments
Exploiting semantic locality to improve peer-to-peer search mechanisms
A Peer-to-Peer(P2P) network is the most popular technology in file sharing today. With the advent of various commercial and non-commercial applications like KaZaA, Gnutella, a P2P network has exercised its growth and popularity to the maximum. Every node (peer) in a P2P network acts as both a client and a server for other peers. A search in P2P network is performed as a query relayed between peers until the peer that contains the searched data is found. Huge data size, complex management requirements, dynamic network conditions and distributed systems are some of the difficult challenges a P2P system faces while performing a search. Moreover, a blind and uninformed search leads to performance degradation and wastage of resources. To address these weaknesses, techniques like Distributed Hash Table (DHT) has been proposed to place a tight constraint on the node placement. However, it does not considers semantic significance of the data. We propose a new peer to peer search protocol that identities locality in a P2P network to mitigate the complexity in data searching. Locality is a logical semantic categorization of a group of peers sharing common data. With the help of locality information, our search model offers more informed and intelligent search for different queries. To evaluate the effectiveness of our model we propose a new P2P search protocol - LocalChord. LocalChord relies on Chord and demonstrates potential of our proposed locality scheme by re-modelling Chord as a Chord of sub-chords
A path-quality-aware peer-to-peer file sharing protocol for mobile ad-hoc networks: Wi-Share
Peer-to-peer networks are rather well-studied and currently there are numerous systems based on peer-to-peer principles running on the Internet. On the other hand peer-to-peer networks for mobile ad-hoc networks have attracted attention only in the recent years. In this paper, we propose a novel peer-to-peer file sharing system particularly designed for mobile ad-hoc networks. The proposed system, namely Wi-Share, has both network and application layer aspects enabling efficient search and download of the shared files. Wi-Share uses reactive routing for the search operation combined with source discovery and uses the routing tables constructed during the search operation for the download operation. In order to increase the overall efficiency of the file sharing in the network, Wi-Share applies techniques to reduce the required traffic and to increase efficient parallelism of the download operation. These techniques include filtering search results, preferring the higher quality routing paths, using partitioned download scheme and allowing the nodes that have joined to the network recently to contribute to the ongoing downloads. Wi-Share is implemented to work on mobile computers and the results of several experiments are also presented in the paper. © 2009 IEEE
Local Search in Unstructured Networks
We review a number of message-passing algorithms that can be used to search
through power-law networks. Most of these algorithms are meant to be
improvements for peer-to-peer file sharing systems, and some may also shed some
light on how unstructured social networks with certain topologies might
function relatively efficiently with local information. Like the networks that
they are designed for, these algorithms are completely decentralized, and they
exploit the power-law link distribution in the node degree. We demonstrate that
some of these search algorithms can work well on real Gnutella networks, scale
sub-linearly with the number of nodes, and may help reduce the network search
traffic that tends to cripple such networks.Comment: v2 includes minor revisions: corrections to Fig. 8's caption and
references. 23 pages, 10 figures, a review of local search strategies in
unstructured networks, a contribution to `Handbook of Graphs and Networks:
From the Genome to the Internet', eds. S. Bornholdt and H.G. Schuster
(Wiley-VCH, Berlin, 2002), to be publishe
Peer-to-Peer File Sharing WebApp: Enhancing Data Security and Privacy through Peer-to-Peer File Transfer in a Web Application
Peer-to-peer (P2P) networking has emerged as a promising technology that enables distributed systems to operate in a decentralized manner. P2P networks are based on a model where each node in the network can act as both a client and a server, thereby enabling data and resource sharing without relying on centralized servers. The P2P model has gained considerable attention in recent years due to its potential to provide a scalable, fault-tolerant, and resilient architecture for various applications such as file sharing, content distribution, and social networks.In recent years, researchers have also proposed hybrid architectures that combine the benefits of both structured and unstructured P2P networks. For example, the Distributed Hash Table (DHT) is a popular hybrid architecture that provides efficient lookup and search algorithms while maintaining the flexibility and adaptability of the unstructured network.To demonstrate the feasibility of P2P systems, several prototypes have been developed, such as the BitTorrent file-sharing protocol and the Skype voice-over-IP (VoIP) service. These prototypes have demonstrated the potential of P2P systems for large-scale applications and have paved the way for the development of new P2P-based systems
Analysis and Comparison of P2P Search Methods
The popularity and bandwidth consumption attributed to current
Peer-to-Peer file-sharing applications makes the operation of these
distributed systems very important for the Internet community. Efficient
object discovery is the first step towards the realization of distributed
resource-sharing. In this work, we present a detailed overview of recent
and existing search methods for unstructured Peer-to-Peer networks. We
analyze the performance of the algorithms relative to various metrics,
giving emphasis on the success rate, bandwidth-efficiency and adaptation
to dynamic network conditions. Simulation results are used to empirically
evaluate the behavior of nine representative schemes under a variety of
different environments.
(UMIACS-TR-2003-107
Controlling P2P File-Sharing Networks Traffic
Since the appearance of Peer-To-Peer (P2P) file-sharing networks some time ago, many
Internet users have chosen this technology to share and search programs, videos, music,
documents, etc. The total number of P2P file-sharing users has been increasing and
decreasing in the last decade depending on the creation or end of some well known P2P
file-sharing systems. P2P file-sharing networks traffic is currently overloading some data
networks and it is a major headache for network administrators because it is difficult to
control this kind of traffic (mainly because some P2P file-sharing networks encrypt their
messages). This paper deals with the analysis, taxonomy and characterization of eight Public
P2P file-sharing networks: Gnutella, Freeenet, Soulseek, BitTorrent, Opennap, eDonkey,
MP2P and FastTrack. These eight most popular networks have been selected due to their
different type of working architecture. Then, we will show the amount of users, files and the
size of files inside these file-sharing networks. Finally, several network configurations are
presented in order to control P2P file-sharing traffic in the network.García Pineda, M.; Hammoumi, M.; Canovas Solbes, A.; Lloret, J. (2011). Controlling P2P File-Sharing Networks Traffic. Network Protocols and Algorithms. 3(4):54-92. doi:10.5296/npa.v3i4.1365S54923
Peer-to-peer Searching and Sharing of Electronic Documents
Peer-to-peer systems have existed since the first incarnation of the Internet. In recent times the Internet has taken on a more hierarchical form, power has been taken away from the individual and placed in the hands of operators of large servers. However, with the re-emergence of p2p the individual is gaining more freedom. End users attached to the Internet now have the power to host and publish content through the user of p2p technologies. Peer-to-peer systems present significant design challenges and have opened up a floodgate of research in an effort to overcome some of the fundamental problems. This thesis details a conceptual peer-to-peer design solution to some of the fundamental problems facing p2p systems today. A prototype is developed as a proof-of-concept. The prototype demonstrates how by enabling users to join communities of other like-minded users in order to exchange files, the p2p environment becomes more structured. It is argued that this structuring of the network into communities leads the way for a more scalable p2p system. Utilising the routing capabilities of the latest p2p algorithms, the prototype includes an indexing service that facilitates the creation of virtual rendezvous points for users with similar interests (manifested by shared keywords). Users are described by the content they store. By using state of the art Information Retrieval techniques users can be grouped together to content sensitive communities. It is intended that this system be used as the basis of a distributed archive of research papers. The concept presented seeks to improve the efficiency of file searches associated with p2p file sharing applications. This can be achieved by incorporating a novel content community service layer in order to organise nodes based on the content they store. This has the potential to improve on existing systems such as Gnutella where nodes are organised in a somewhat random fashion. Initial findings suggest that the system has better scalability properties giving the user better search results that reflect the true content available within the system. Search results are more comprehensive; as search queries on semantic meaning rather than literal matching
- …