Exploring probabilistic follow relationship to prevent collusive peer-to-peer piracy

P2P collusive piracy, where paid P2P clients share the content with unpaid clients, has drawn significant concerns in recent years. Study on the follow relationship provides an emerging track of research in capturing the followee (e.g., paid client) for the blocking of piracy spread from all his followers (e.g., unpaid clients). Unfortunately, existing research efforts on the follow relationship in online social network have largely overlooked the time constraint and the content feedback in sequential behavior analysis. Hence, how to consider these two characteristics for effective P2P collusive piracy prevention remains an open problem. In this paper, we proposed a multi-bloom filter circle to facilitate the time-constraint storage and query of P2P sequential behaviors. Then, a probabilistic follow with content feedback model to fast discover and quantify the probabilistic follow relationship is further developed, and then, the corresponding approach to piracy prevention is designed. The extensive experimental analysis demonstrates the capability of the proposed approach.

Reducing the bandwidth requirements of P2P keyword indexing

This paper describes the design and evaluation of a federated, peer-to-peer indexing system, which can be used to integrate the resources of local systems into a globally addressable index using a distributed hash table. The salient feature of the indexing systems design is the efficient dissemination of term-document indices using a combination of duplicate elimination, leaf set forwarding and conventional techniques such as aggressive index pruning, index compression, and batching. Together these indexing strategies help to reduce the number of RPC operations required to locate the nodes responsible for a section of the index, as well as the bandwidth utilization and the latency of the indexing service. Using empirical observation we evaluate the performance benefits of these cumulative optimizations and show that these design trade-offs can significantly improve indexing performance when using a distributed hash table.

Reducing cache lookup and publish overhead through locality awareness in P2P web caching

Peer-to-Peer (P2P) Web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P Web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations by using routing table locality, aggregation and soft state. The experiments show that our P2P cache system improves the performance of index operations through the reduction of the amount of information processed by nodes, the reduction of the number of index messages sent by nodes, and the improvement of the locality of cache pointers.

Product piracy : the problem that will not go away

The phenomenon of product piracy, when examined against different cultural, social and developmental needs, may result in a moderation of traditional moral judgments that have tended to deprecate piracy at every conceivable opportunity. Outlines the magnitude of product piracy, notably in the Asian region, presents a delineation of the relevant terminology, discusses strategies used in preventing product piracy and examines alternative views on the ethics of the practice.

Cache and replica lookup, indexing and synchronization in P2P environments

The major outcomes of this research project were the development of a set of decentralized algorithms to index, locate and synchronize replicated information in a networked environment. This study exploits the application specific design constraints of networked systems to improve performance, instead of relying on data structures and algorithms best suited to centralized systems.

Adjacency cache : an efficient P2P web cache indexing and lookup system

This paper describes the design and evaluation of an efficient per-to-peer (P2P) web cache indexing and lookup system, which can be used to integrate the resources of locally available web pages into globally addressable index using a distributed hash table. The salient feature of the indexing system’s design is the efficient dissemination of cache index information using a next-url index which allows cache clients to determine ahead of time whether linked content is also available at a remote cache. In addition, conventional optimizations such as in browser caching and batching of index write requests are also used. These optimizations are evaluated using trace-driven simulation and the results show that these design trade-offs improve cache lookup performance.

Reducing the bandwidth requirements of P2P keyword indexing

This paper describes the design and evaluation of a peer-to-peer indexing system to integrate the resources of local document database systems into a globally addressable index using a distributed hash table. The salient feature of the indexing systems design is the efficient dissemination of term-document indices using a combination of duplicate elimination, ring based forwarding and conventional techniques such as aggressive index pruning, and batching. Together these indexing strategies help to reduce, the number of RPC operations required to locate the nodes responsible for a section of the index, the bandwidth utilization and the latency of the indexing service.

Courting kazaa : judicial approaches towards P2P networks in the US and Australia

As with the litigation involving its predecessor Napster, cases involving the Australian based P2P service Kazaa and its US licensees Grokster and Morpheus required from the courts to balance the legitimate interests of the computer industry and the public in new and advanced technologies on the one hand and of so-called "content providers " of the media and entertainment industry on the other hand. The article examines, how US and Australian courts have approached this task and, in spite of differences in the legal frameworks of the two countries, have reached similar conclusions.

Improving P2P IPTV random peers search through user similarity

With internet services to the end users becoming more homogenous, thus providing high bandwidth for all users, multimedia services such as IPTV to the public as a whole will finally become a reality, but even given the more abundant resources, IPTV architecture is far from being highly available due to technical limitations, we aim to provide a meaningful optimization in the P2P distribution model, which is currently based on a random structure bounded by high delays and low performance, by using channel probability, user's habits studies and users' similarity, in order to optimize one of the key aspects of IPTV which is the peers management, which directly reflects on resources and user's Quality of Experience.

The high seas (C’s) of music piracy in information systems : cost, convenience and choice

Systems and technologies used for unauthorised file sharing have received little attention in the Information Systems literature. This paper attempts to fill this gap by presenting a critical, qualitative study on the motivations for using unauthorised file sharing systems. Based on 30 interviews with music consumers, musicians, and the music industry, this paper reports on the decision of music consumers to ‘pirate or purchase’. This paper highlights file sharing from multiple perspectives of users, musicians, and representatives from the music recording industry. Three main themes emerged on the cost, convenience and choice as motivators for unauthorised file sharing.

Securing recommendations in grouped P2P e-commerce trust model

In dynamic peer to peer (P2P) e-commerce, it is an important and difficult problem to promote online businesses without sacrificing the desired trust to secure transactions. In this paper, we address malicious threats in order to guarantee secrecy and integrity of recommendations exchanged among peers in P2P e-commerce. In addition to trust, secret keys are required to be established between each peer and its neighbors. Further, we propose a key management approach gkeying to generate six types of keys. Our work mainly focuses on key generation for securing recommendations, and ensuring the integrity of recommendations. The proposed approach presented with a security and performance analysis, is more secure and more efficient in terms of communication cost, computation cost, storage cost, and feasibility. © 2012 IEEE.