P2P文件污染及其检测方法研究

为了更好地理解对等网络中的文件污染,介绍了文件污染的背景和分类,分析了文件污染的传播途径及检测方法,描述了用户行为对污染的影响,结合节点信誉系统和对象信誉系统阐述了反污染机制,并对各种方案进行了比较。     

P2P流量监控技术分析

分析了P2P应用对互联网的影响，着重介绍了目前常用的P2P流量监控技术的基本原理以及存在的优缺点。     

Potentials and challenges of peer-to-peer based content distribution

Multimedia content currently accounts for over three quarters of all Internet traffic. This increase in traffic volume and content availability derives from a paradigm shift from the traditional text and picture based Web, to more resource demanding audio and video content. A controversial driver for this development is content distribution systems based on peer-to-peer overlay networks. Flooding the Internet with often illegal content, these networks now pose challenges to all actors in the value chain. However, if viewed as surmountable challenges in an evolutionary path, peer-to-peer technology has the potential of increasing efficiency in content distribution and unleashing resources to form scalable and resilient overlay networks of unprecedented dimensions.

In this paper we examine the potentials and challenges of peer-to-peer technology in content distribution, and analyse how, and under which circumstances, peer-to-peer technology can be used to increase the efficiency of multimedia services. The paper provides an up-to-date overview of the development of peer-to-peer networks as well as describing the economics laws governing their use. To conclude the study, the paper analyses Skype, a well known telecommunications service utilising the peer-to-peer technology, as well as demonstrating the benefits of peer-to-peer based content distribution using empirical data from the Danish Broadcasting Corporation.     

Optimizing Bloom Filter Settings for Multi-keyword Search in Kademlia-like DHT Peer-to-Peer Networks

This paper has proposed a novel method to reduce the multi-keyword query traffic in Kademlia-like Peer-to-peer （P2P） networks by optimizing the Bloom fil- ter settings. We build some models to estimate the com- munication cost, the union set size, and the loss rate of per- forming union and intersection operations. We implement a Kademlia-like system and generate a group of datasets. We use one part of the datasets to obtain the functions how to compute the optimal parameters and use another part of datasets to verify our method. Each query can de- termine the optimal settings of Bloom filter with no extra configuration. Our simulation experimental results show that with optimal Bloom filters settings, we can greatly reduce the communication cost under an acceptable loss rate.     

Providing incentives in providerless networks

This paper explores the extension of a model for the operation of an ad hoc mobile network to more general providerless networks, such as peer-to-peer systems. The model incorporates incentives for users to act as transit nodes on multi-hop paths and to be rewarded with their own ability to send traffic. The paper explores some of the trust questions that arise in this problem space and conjectures that the very structure of a peer organisation may have some hidden benefits for trust re-enforcement, that have not been previously explored (to our knowledge).     

Cellular Controlled Short-Range Communication for Cooperative P2P Networking

This article advocates a novel communication architecture and associated collaborative framework for future wireless communication systems. In contrast to the dominating cellular architecture and the upcoming peer-to-peer architecture, the new approach envisions a cellular controlled short-range communication network among cooperating mobile and wireless devices. The role of the mobile device will change, from being an agnostic entity in respect to the surrounding world to a cognitive device. This cognitive device is capable of being aware of the neighboring devices as well as on the possibility to establish cooperation with them. The novel architecture together with several possible cooperative strategies will bring clear benefits for the network and service providers, mobile device manufacturers and also end users.

An anti-attack model based on complex network theory in P2P networks

Complex network theory is a useful way to study many real systems. In this paper, an anti-attack model based on complex network theory is introduced. The mechanism of this model is based on a dynamic compensation process and a reverse percolation process in P2P networks. The main purpose of the paper is: (i) a dynamic compensation process can turn an attacked P2P network into a power-law (PL) network with exponential cutoff; (ii) a local healing process can restore the maximum degree of peers in an attacked P2P network to a normal level; (iii) a restoring process based on reverse percolation theory connects the fragmentary peers of an attacked P2P network together into a giant connected component. In this way, the model based on complex network theory can be effectively utilized for anti-attack and protection purposes in P2P networks.     

Flood search under the California Split rule

We consider flood search on a line and show that no algorithm can achieve an average-case competitive ratio of less than 4 when compared to the optimal off-line algorithm. We also demonstrate that the optimal scanning sequences are described by simple recursive relationships that yield surprisingly complex behavior related to Hamiltonian chaos.     

The many faces of (soft) power,democracy and the Internet

Starting from a brief roundup of the correlation between ICTs and politics in Asia, and especially China, this introduction to a special issue on China explores a number of the more political and technological issues related to power and the Internet. It highlights some opportunities and dangers from a democratic technology perspective.