Peer-to-Peer File Sharing WebApp

2006

Peer-to-Peer systems have become, in a short period of time, one of the fastest growing and most popular applications. The decentralized and distributed nature of p2p systems leads to living aside the client-server model. In p2p model each node takes both the roles of client and server. As a client, it can query and download its wanted data files from other nodes and as a server, it can provide data files to other nodes. Two main objectives in p2p systems are data location and search for interesting data. In order to present these topics, we survey various structured and unstructured p2p systems. We also study content-based p2p systems that are systems with clusters of nodes, according to the content of their data files. We point replication strategies and techniques and we show how range queries are performed.

P2P (peer-to-peer) systems gain more interest from both the user and research communities, building a search system on top of P2P networks is becoming an attractive and promising alternative. The paper introduces the concept of P2P network architecture and structure of current P2P systems. The background, scope, objectives, and methodology adopted for carrying out the research work is also presented in this paper. This paper also evaluates the extensive research done in the field of p2p networks. A survey is very important part of every research. So here this paper shows the application based survey on peer to peer systems.

Handbook of Peer-to-Peer Networking, 2009

In this chapter, we survey P2P data sharing systems. All along, we focus on the evolution from simple file-sharing systems, with limited functionalities, to Peer Data Management Systems (PDMS) that support advanced applications with more sophisticated data management techniques. Advanced P2P applications are dealing with semantically rich data (e.g. XML documents, relational tables), using a high-level SQL-like query language. We start our survey with an overview over the existing P2P network architectures, and the associated routing protocols. Then, we discuss data indexing techniques based on their distribution degree and the semantics they can capture from the underlying data. We also discuss schema management techniques which allow integrating heterogeneous data. We conclude by discussing the techniques proposed for processing complex queries (e.g. range and join queries). Complex query facilities are necessary for advanced applications which require a high level of search expressiveness. This last part shows the lack of querying techniques that allow for an approximate query answering.

2001

Peer-to-peer" systems like Napster and Gnutella have recently become popular for sharing information. In this paper, we study the relevant issues and tradeoffs in designing a scalable P2P system. We focus on a subset of P2P systems, known as "hybrid" P2P, where some functionality is still centralized. (In Napster, for example, indexing is centralized, and file exchange is distributed.) We model a file-sharing application, developing a probabilistic model to describe query behavior and expected query result sizes. We also develop an analytic model to describe system performance. Using experimental data collected from a running, publicly available hybrid P2P system, we validate both models. We then present several hybrid P2P system architectures and evaluate them using our model. We discuss the tradeoffs between the architectures and highlight the effects of key parameter values on system performance.

B. Tech (CSE) Seminar Report, Semester VI, Department of Computer Science and Engineering, NIST, Odisha, India., 2013

A peer-to-peer (P2P) network is a distributed system in which the autonomous peers can leave and join the network at their will and share their resources to perform some functions in a distributed manner. In an unstructured P2P network, there is no centralized administrative entity that controls the operations of the peers, and the resources (i.e., the files) that the peers share are not related to the their topological positions in the network. With the advent of the Internet of Things (IoT), the P2P networks have found increased interest in the research community since the search protocols for these networks can be gainfully utilized in the resource discovery process for the IoT applications. However, there are several challenges in designing an efficient search protocol for the unstructured P2P networks since these networks suffer from problems such as fake content distribution, free riding, whitewashing, poor search scalability, lack of a robust trust model and the absence a of user privacy protection mechanism. Moreover, the peers can join and leave the network frequently, which makes trust management and searching in these networks quite a challenging task. In this chapter, a secure and efficient searching protocol for unstructured P2P networks is proposed that utilizes topology adaptation by constructing an overlay of trusted peers and increases the search efficiency by intelligently exploiting the formation of semantic community structures among the trustworthy peers. It also guarantees that the privacy of the users and data in the network is protected. Extensive simulation results are presented and the performance of the protocol is also compared with those of some of the existing protocols to demonstrate its advantages.

2010

Distributed Hash Tables (DHT’s) are sophisticated Peer-to- Peer (P2P) overlay networks. Such overlays have the ability to retrieve stored data in a limited time, usually in a logarithmic number of steps. However in contrast to the well-known Gnutella and FastTrack networks, these can only locate data quickly, if the key associated with the data requested is accurately specified. In this article we analyze the reliability of the Kademlia network, and describe our model, which can be used to determine its system-wide configuration parameters. We also present a novel algorithm that implements broadcast messages in Kademlia. The developed algorithm ensures reliable delivery of broadcast messages in an error prone environment. Broadcast messaging is an elementary service in an overlay network. Using broadcast messages, queries of any key type or part of key, can be realized.

2001

Storage technology trends are providing massive storage in extremely small packages while declining computing costs are resulting in a rising number of devices per person. The confluence of these trends are presenting a new, critical challenge to storage and file system designers: how to enable users to effectively manage, use, and share huge amounts of data stored across a multitude of devices. In this paper, we present a novel middleware storage system, PlanetP, which is designed from first principles as a peerto-peer (P2P), semantically indexed storage layer. Plan-etP makes two novel design choices to meet the above challenge. First, PlanetP concentrates on content-based querying for information retrieval and assumes that the unit of storage is a snippet of XML, allowing it to index arbitrary data for search and retrieval, regardless of the applications used to create and manipulate the data. Second, PlanetP adopts a P2P approach, avoiding centralization of storage and indexing. This makes PlanetP particularly suitable for information sharing among ad hoc groups of users, each of which may have to manage data distributed across multiple devices. PlanetP is targeted for groups of up to 1000 users; results from studying communities of 100-200 peers running on a cluster of PCs indicates that PlanetP should scale well to the 1000-member threshold. Finally, we describe BreezeFS, a semantic file system that we have implemented to validate PlanetP's utility.

ACM Computing Surveys, 2004

Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by their ability to adapt to failures and accommodate transient populations of nodes while maintaining acceptable connectivity and performance.Content distribution is an important peer-to-peer application on the Internet that has received considerable research attention. Content distribution applications typically allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content.In this survey, we propose a framework for analyzing peer-to-peer content distribution technologies. Our approach focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource man...