论文部分内容阅读
无结构P2P网络中普遍存在搭便车(freeriding)现象,从而严重威胁到P2P网络的性能(如公平性、容错性和扩展性)和广泛应用.本文提出一种新的分布式算法,通过对搭便车者(free-rider)的准确定位并采取的应对制约措施,来降低搭便车者对网络的危害.在本文算法中,每一个对等节点仅监控自己的邻居,判断其是否为搭便车者,进而对其采取限制或惩罚措施.和绝大多数现有的对抗搭便车者的方法不同,本文的算法既不需要一个用来维护系统全局信誉的安全基础结构,也不需要永久节点ID,每个节点只需存储来自邻居的消息(message)并维护一组邻居消息计数器,因此是高效、轻量级的.仿真结果表明本算法对抗free-riding的效能良好,对无结构P2P网络的吞吐量等有显著提高.
Unstructured P2P networks generally exist free-rider phenomenon, which seriously threatens the performance of P2P networks (such as fairness, fault tolerance and scalability) and a wide range of applications.This paper presents a new distributed algorithm, (Free-rider) and take countermeasures to reduce the hazard of free-rider on the network.In this algorithm, each peer only monitors its neighbors to determine whether it is free-rider , And then to take its restrictions or penalties.And most of the existing methods to fight the free rider different, the algorithm in this paper neither need to maintain a system’s global reputation of the security infrastructure, do not need a permanent node ID, Each node only needs to store messages from neighbors and maintain a set of neighbor message counters, so it is efficient and lightweight. The simulation results show that this algorithm performs well against free-riding and hunts for unstructured P2P networks The amount of such a significant increase.