A platform for P2P agent-based collaborative applications

The operational environment can be a valuable source of information about the behavior of software applications and their usage context. Although a single instance of an application has limited evidence of the range of the possible behaviors and situations that might be experienced in the field, the collective knowledge composed by the evidence gathered by the many instances of a same application running in several diverse user environments (eg, a browser) might be an invaluable source of information. This information can be exploited by applications able to autonomously analyze how they behave in the field and adjust their behavior accordingly. Augmenting applications with the capability to collaborate and directly share information about their behavior is challenging because it requires the definition of a fully decentralized and dependable networked infrastructure whose nodes are the user machines. The nodes of the infrastructure must be collaborative, to share information, and autonomous, to exploit the available information to change their behavior, for instance, to better accommodate the needs of the users to prevent known problems. This paper describes the initial results that we obtained with the design and the development of an infrastructure that can enable the execution of collaborative scenarios in a fully decentralized way. Our idea is to combine the agent-based paradigm, which is well suited to design collaborative and autonomous nodes, and the peer-to-peer paradigm, which is well suited to design distributed and dynamic network infrastructures. To demonstrate our idea, we augmented the popular JADE agent-based platform with a software layer that supports both the creation of a fully decentralized peer-to-peer network of JADE platforms and the execution of services within that network, thus enabling JADE multiagent systems (MASs) to behave as peer-to-peer networks. The resulting platform can be used to study the design of collaborative applications running in the field.     

基于超级节点的P2P信任模型的研究

提出基于超级节点的P2P网络信任模型—Super Trust。在Super Trust模型中,对节点的信任值采用了组内直接信任,组内间接信任和组间信任相结合的方式,从而提高了信任值计算的精确性;此外,通过引入超级节点机制,提高了系统交互的成功率。实验结果表明,与基于推荐信任传统模型和RBTrust模型相比,Super Trust具有较高的交易成功率,并且在不同的恶意节点攻击模式下具有较高的成功交易率。     

TSPN: Term-Based Semantic Peer-to-Peer Networks

In this paper,we propose Term-based Semantic Peerto-Peer Networks (TSPN) to achieve semantic search.For each peer,TSPN builds a full text index of its documents.Through the analysis of resources,TSPN o...     

BitTorrent系统节点行为研究

测量分析P2P文件共享系统是解决P2P优化、网络管理等问题的基础。当前P2P网络设计日趋复杂,并且部分运行机制直接导致测量数据不完整或测量周期过长,比如BitTorrent文件共享系统。针对这一问题,本文抽象出BitTorrent系统的3个测量层次,包括索引测量、节点测量和内容测量,并重点解决了3个层次中的测量难题,设计实现了一个面向BitTorrent的测量系统。在此基础上,本文对BitTorrent系统进行了持续测量,并重点分析了BitTorrent系统的节点行为:节点演化规律和节点到达模型。测量结果表明,节点演化规律和节点到达均呈现强烈的周期性。为此,本文改进了节点到达模型,新模型与实际测量数据拟合效果较好,进一步修正了节点到达模型。     

基于模糊识别的P2P流量检测方法

提出了一种应用模糊识别模型来对P2P流量进行检测的方法,将网络数据包分为P2P流和非P2P流,利用模糊理论中的最大隶属度原则将这些数据包进行二分类。实验证明,该方法具有较高的识别率,说明了采用模糊识别方法进行P2P流量检测的可行性和高效性。     

MP2P中资源检索方案研究

MP2P技术中以网络资源的搜索最为重要,因此文章研究了当前一段时间出现的性能出色的资源搜索算法,提高文件检索效率和减少无线环境中的网络拥堵等问题,重点分析了几种比较典型的资源搜索算法:集中式和洪泛式,该检索方式帮助节点在邻居间有效地进行资源请求;分布式资源搜索,有效地提高了查询效率;有基于组或者超级节点的,查询时间缩短了,但是投入的代价偏大。文章对这几种资源搜索算法做了总结和详细对比。     

基于混合P2P网络的积件教学系统的设计

基于混合P2P网络的积件教学系统,利用积件的思想,搭建了一种积件组合平台系统。它对网络教学资源按多媒体教学资料库、微教学单元库、虚拟积件资源库、资料呈现方式库和教学策略库进行分类管理。这样积件组合平台既符合教育的规律,又有混合P2P的特征,从而有效避免传统的客户端/服务器模式或浏览器/服务器模式所带来的一些网络教学资源建设问题。     

对等网络中DHT搜索算法综述*

在P2P网路中如何快速准确地对资源进行定位是衡量其性能的一个关键。现在的分布式P2P系统普遍采取的是DHT（distributed hash table,分布式哈希表）搜索方法。基于DHT的P2P网络搜索算法的研究已经是P2P研究的一个热点。从P2P定义出发,介绍了P2P网络按照拓扑结构的分类发展;然后深入介绍了目前对等网络几种分布式哈希查找算法Chord、CAN、SkipNet和Cycloid等,并对这些算法从拓扑结构、路由复杂度、路由表大小、容错性、扩展性、负载平衡性等方面进行了评估比较;最后分析了这些算法的优缺点及今后研究的重点。     

基于兴趣群组的P2P信任模型*

参考人类社会网络的结构,提出一种基于兴趣群组的P2P信任模型。该模型建立在混合式拓扑结构上,采用组内信任度与组间信任度合成的方法来计算总体信任度,并给出了模型的实现协议与仿真实验。实验结果表明,兴趣群组内、组间的信任度计算量小,信任度评价客观,保证了在开放环境下P2P节点信任度的可靠性和安全性,经验证本模型具备工程可行性。     

一种无结构P2P网络中的改进洪泛搜索协议*

提出的搜索协议通过两点实现洪泛协议的改进：a）以搜索预算取代TTL机制,使协议具有较好的搜索粒度;b）通过动态估计搜索副本的密度和接力搜索方式两种机制降低协议开销。仿真结果显示协议在网络开销、查询速度等方面具有较好的性能。