On localized application-driven topology control for energy-efficient wireless peer-to-peer file sharing

Wireless Peer-to-Peer (P2P) file sharing Is widely envisioned as one of the major applications of ad hoc networks in the near future. This trend is largely motivated by the recent advances in high-speed wireless communication technologies and high traffic demand for P2P file sharing applications. To achieve the ambitious goal of realizing a practical wireless P2P network, we need a scalable topology control protocol to solve the neighbor discovery problem and network organization problem. Indeed, we believe that the topology control mechanism should be application driven in that we should try to achieve an efficient connectivity among mobile devices in order to better serve the file sharing application. We propose a new protocol, which consists of two components, namely, Adjacency Set Construction (ASC) and Community-Based Asynchronous Wakeup (CAW). Our proposed protocol is shown to be able to enhance the fairness and provide an incentive mechanism in wireless P2P file sharing applications. It is also capable of increasing the energy efficiency. © 2008 IEEE.published_or_final_versio

Piracy on Peer-to-Peer File Sharing Networks: Why a Streamlined Online Dispute Resolution System Should Not Be Forgotten in the Shadow of a Federal Small Claims Tribunal

This Article proposes application of an ADR system for resolving online copyright disputes related to P2P file sharing. Section II provides an overview of P2P file sharing networks and associated copyright infringement. Section III explores current approaches that fall short in resolving P2P copyright disputes, namely the Digital Millennium Copyright Act, litigation, and private agreements. Section IV examines the two primary proposed solutions to online copyright disputes: alternative dispute resolution and federal small claims. Section V recommends that a streamlined online dispute resolution system is necessary (even if a federal small claims tribunal is adopted), and concludes

Peer-to-peer networking: A security analysis

Abstract only availablePeer-to-peer (p2p) networks have developed as an alternative to the typical client-server model of networking which has a single point of entry, a server connected to all of the users on the network, with the server handling all of the work. In a p2p network there is no central server. Instead, all of the users in the system are equal, distributing the resources amongst themselves. When creating a p2p network there are many things that have to be considered in order to minimize the effect that a malicious user can have on the entirety of the network. I will analyze the security issues of p2p networking by first examining the possible attacks on a general p2p network. File sharing is one application of a p2p system and file sharing clients are numerous and vary considerably,I compared 3 popular clients, eMule, LimeWire and BitTorrent. I used these clients as a basis for examining the security issues outlined in this paper. Outlining the security features of these file sharing clients will come in 2 ways; outlining the general structure of the network and examining the way requests for files are handled within the network. Outlining the structure of the network will look into how node Ids are assigned and how nodes and files are stored in the network. Examining the structure of file requests will show how well each of these clients distribute files and search for them. With all the p2p file sharing networks being created and used today, this will hopefully provide a good background on what needs to be considered in order to create a p2p network that is more secure.NSF-REU Program in Home Networking Technologie

CLOSER: A Collaborative Locality-aware Overlay SERvice

Current Peer-to-Peer (P2P) file sharing systems make use of a considerable percentage of Internet Service Providers (ISPs) bandwidth. This paper presents the Collaborative Locality-aware Overlay SERvice (CLOSER), an architecture that aims at lessening the usage of expensive international links by exploiting traffic locality (i.e., a resource is downloaded from the inside of the ISP whenever possible). The paper proves the effectiveness of CLOSER by analysis and simulation, also comparing this architecture with existing solutions for traffic locality in P2P systems. While savings on international links can be attractive for ISPs, it is necessary to offer some features that can be of interest for users to favor a wide adoption of the application. For this reason, CLOSER also introduces a privacy module that may arouse the users' interest and encourage them to switch to the new architectur

Special Issue on Information Dissemination and New Services in P2P Systems

Information dissemination is an important P2P application that has received considerable research attention in recent years. P2P information dissemination systems range from simple file sharing applications to more complex systems that allows users to securely and efficiently publish, organize, index, search, update and retrieve data in a distributed storage medium. For complex P2P information dissemination systems, there is a need for features which include security, anonymity, fairness, scalability, resource management, and organization capabilities. For effective information dissemination, following features of P2P systems and infrastructure need to be updated: distributed object location and routing mechanisms, novel approaches to content replication, caching and migration, encryption, authentication, access control, and resource trading and management schemes

Scheduling algorithms for peer-to-peer collaborative file distribution

Peer-to-Peer file sharing applications on the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discovery, overlay topology formation, fairness and incentive issues, etc, but seldom investigates the data distribution problem which is also a core component of any file sharing application. In this paper, we present the first effort in addressing this collaborative file distribution problem and formally define the scheduling problem in a simplified context. We suggest several types of algorithms, including a novel Bipartite Matching algorithm, for solving the problem. Simulation results show that our weighted bipartite algorithm finds an optimal solution for all cases tested. Therefore, we believe our algorithm is a promising solution to be employed as the core scheduling module in P2P file sharing applications, shortening the total download time experienced by users. © 2005 IEEE.published_or_final_versio

Improvement and Performance Evaluation for Multimedia Files Transmission in Vehicle-Based DTNs

In recent years, P2P file sharing has been widely embraced and becomes the largest application of the Internet traffic. And the development of automobile industry has promoted a trend of deploying Peer-to-Peer (P2P) networks over vehicle ad hoc networks (VANETs) for mobile content distribution. Due to the high mobility of nodes, nodes’ limited radio transmission range and sparse distribution, VANETs are divided and links are interrupted intermittently. At this moment, VANETs may become Vehicle-based Delay Tolerant Network (VDTNs). Therefore, this work proposes an Optimal Fragmentation-based Multimedia Transmission scheme (OFMT) based on P2P lookup protocol in VDTNs, which can enable multimedia files to be sent to the receiver fast and reliably in wireless mobile P2P networks over VDTNs. In addition, a method of calculating the most suitable size of the fragment is provided, which is tested and verified in the simulation. And we also show that OFMT can defend a certain degree of DoS attack and senders can freely join and leave the wireless mobile P2P network. Simulation results demonstrate that the proposed scheme can significantly improve the performance of the file delivery rate and shorten the file delivery delay compared with the existing schemes

Improvement and Performance Evaluation for Multimedia Files Transmission in Vehicle-Based DTNs

In recent years, P2P file sharing has been widely embraced and becomes the largest application of the Internet traffic. And thedevelopment of automobile industry has promoted a trend of deploying Peer-to-Peer (P2P) networks over vehicle ad hoc networks(VANETs) for mobile content distribution. Due to the high mobility of nodes, nodes’ limited radio transmission range and sparsedistribution, VANETs are divided and links are interrupted intermittently. At this moment, VANETs may become Vehicle-basedDelay Tolerant Network (VDTNs). Therefore, this work proposes an Optimal Fragmentation-based Multimedia Transmissionscheme (OFMT) based on P2P lookup protocol in VDTNs, which can enable multimedia files to be sent to the receiver fast andreliably in wireless mobile P2P networks over VDTNs. In addition, a method of calculating the most suitable size of the fragmentis provided, which is tested and verified in the simulation. And we also show that OFMT can defend a certain degree of DoS attackand senders can freely join and leave the wireless mobile P2P network. Simulation results demonstrate that the proposed schemecan significantly improve the performance of the file delivery rate and shorten the file delivery delay compared with the existingschemes

Backward-Compatible Cooperation of Heterogeneous P2P Systems

International audiencePeer-to-peer (P2P) systems are used by millions of users everyday. In many scenarios, it is desirable for the users from different P2P systems to communicate and exchange content resources with each other. This requires co-operation between the P2P systems, which is often difficult or impossible, due to the two following reasons. First, we have the lack of a dedicated routing infrastructure throughout these systems, caused by the incompatibilities in overlay networks on top of which they are built. Second, there are incompatibilities in the application protocols of these systems. In this paper, we introduce a new model for backward-compatible co-operation between heterogeneous P2P systems. The routing across systems is enabled by introducing a super-overlay formed by a small subset of peers from every system, which run an overlay protocol called OGP (Overlay Gateway Protocol). The incompatibilities in the application protocols of P2P systems are solved by a co-operation application, running on top of OGP, bridging these systems at interface level. As a real application, we present a protocol named Inter-network File-sharing Protocol (IFP), running on top of OGP, aimed at co-operation of P2P file-sharing networks. The experimental results performed on the large-scale Grid5000 platform show our model to be efficient and scalable