一种新颖的具有小世界特征的结构化P2P覆盖网络

如何构建一个高可用性的、并且具有路由表小、查询路径长度短和鲁棒性强的P2P覆盖网络是研究人员一直追求的目标,但他们往往会忽略了人们使用P2P网络的行为,比如除了搜索服务,人们还希望获取文件浏览服务。我们注意到现有的P2P覆盖网络都难以把具有共同兴趣的对等点连接起来,因而不适用文件浏览服务。本文首先推广了CCC图,并研究了推广CCC图GCCC的拓扑性质。然后采用GCCC图作为P2P覆盖网络的静态拓扑定义了一种新颖的结构化P2P覆盖网络GCNET,GCNET具有平均距离短和高的聚集系数等小世界网络的特征,同时GCNET协议能提供有效的文件浏览服务。最后通过模拟实验,验证了GCNET的路由表和查询长度能达到理论下界以及具有良好的小世界特征,而且通过与其它的P2P覆盖网络比较,证明了GCNET具有更好的鲁棒性。     

Adaptive Trust Management Framework in P2P Grid Computing

In P2P Grid computing systems, the authorization decision is often tackled by two different trust management methods： policy-based approach, where authorization are built on logical rules and verifiable properties encoded in signed credentials, and reputation-based approach, based on collecting, aggregating and disseminating reputation among the peers. However, the overhead caused by proof of compliance on authorization and the absence of certifying authorities may negate the strong and objective security advantages of policy-based approach, whilst vagueness, complexity and inaccurate characterization caused by reputation evolution may eliminate the quantitative and flexible advantages of reputation-based approach. We propose an adaptive trust management framework, which combines the merit of policy proof and reputation evolution such that authorization is aware of not only the strong and objective security traits, but also the calculability and the availability security traits. Finally, the framework of system is proposed.     

ISS： Efficient Search Scheme Based on Immune Method in Modern Unstructured Peer-to-Peer Networks

Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query （DQ） and different variants of such algorithms. Dynamic query is a new flooding technique which could estimate a proper time-to-live （TTL） value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. However, all DQ-like search algorithms are ＂blind＂ so that a large amount of redundant messages are caused. In this paper, we proposed a new search scheme, called Immune Search Scheme （ISS）, to cope with this problem. In ISS, an immune systems inspired concept of similarity-governed clone proliferation and mutation for query message movement is applied. Some assistant strategies, that is, shortcuts creation and peer traveling are incorporated into ISS to develop ＂immune memory＂ for improving search performance, which can make ISS not be blind but heuristic.     

PeerMD： A P2P Molecular Dynamics Simulation Framework Based on Web Services

PeerMD, a P2P molecular dynamics simulation frame-work based on Web services is proposed. It utilizes rich free CPU time and network bandwidth of P2P networks to provide enough resources for dynamics simulation of bio-macromolecule, and has resolved the problem that it is difficult to interoperate between heterogeneous peers in P2P environment through Web services. Structure of PeerMD is given. Function, input and output of molecular dynamics simulation Web service are defined. Processes of publishing, discovering and invoking of molecular dynamics simulation Web service based on multi-level SuperPeer are given. A protocol system of PeerMD is implemented on a basic P2P platform JXTA, and experimental simulations of tumor necrosis fact alpha （TNF-α） and two mutations of it are executed on the protocol system. Simulation results show that PeerMD can speed up molecular dynamics simulation perfectly.     

Resource Search in Unstructured Peer-to-Peer System Based on Multiple-Tree Overlay Structure

We propose a multiple-tree overlay structure for resource discovery in unstructured P2P systems. Peers that have similar interests or hold similar type of resources will be grouped into a tree-like cluster. We exploit the heterogeneity of peers in each cluster by connecting peers with more capacities closer to the root of the tree. The capacity of a peer can be defined in different ways （e.g. higher network bandwidth, larger disk space, more data items of a certain type etc.） according to different needs of users or applications.     

结构化P2P网络中基于副本的负载均衡方法研究

针对结构化P2P网络中的“热点”问题,提出基于后继节点复制的负载均衡算法DLB-Chord.当任意节点处于超载状态并管理热门数据时,在其后继节点上创建热门数据的副本,放置副本的节点周期性地向源节点报告自己的状态,以热门数据为目标的查询到达源节点时,采用最小负载调度方法选择合适的节点响应查询.实验结果表明DLB-Chord算法可以获得较好的负载均衡效果,对网络的路由效率影响很小,同时不会引入较大的通信开销.     

P2P网络资源共享中基于信誉的访问控制

在分析了传统的访问控制的基础上,针对P2P网络的特点,提出了基于信誉-角色的访问控制模型在P2P网络资源共享中的应用,研究了信誉的量化机制和信誉度的计算方法,最后给出了该访问控制模型的体系结构,并分析了该模型的优点.     

一种新的基于移动代理的P2P模型及资源定位算法研究

如何在P2P网络中进行资源的搜索定位是相关研究中最为关键的问题。但是目前的资源定位方法都存在不同的问题,尤其表现在占用过多的网络带宽、资源定位时延过长,peer节点的随意加入离开导致资源定位的稳定性不高等。针对上述问题,提出了一种基于移动代理的两层P2P模型。在该模型下,首先设计了一个确定Query Agent数量及路线的算法;然后将这些Query Agent派发出去,再根据资源定位算法进行资源定位。最后,对算法进行了性能分析。分析表明,算法在资源定位效率、带宽节约、鲁棒性等方面均优于一般的资源定位算法。     

基于SIP和P2P的移动设备远程控制

针对现有移动设备远程控制方案在覆盖范围、网络承载能力和控制信令标准化方面的不足,结合P2P网络高数据承载能力和SIP协议在3G网络标准化中的核心作用,提出了一种新的基于SIP和P2P的层叠网络工作模式,在此基础上设计了一套移动设备远程控制的解决方案,并实现了一个简单但完整的原型系统.该方案具有覆盖范围广、承载能力高和标准化的特点.     

基于DHT的结构化P2P覆盖网络算法分析

目前P2P覆盖网络应用十分广连,关于覆盖网的研究已成为当前网络技术研究领域的热点。关于覆盖网络相应的路由算法在不断发展和完善,先后提出了集中目录式的算法和分布式查找算法。针对基于DHT的覆盖网络算法进行介绍和分析,并指出该领城的最近研究趋势。     

面向可管理和可控制的P2P内容存取的DRM系统

为了在P2P网络环境下保护数字化音视频内容,提出和实现了一个新的服务于广播电视系统影视资料分发与交换的DRM系统(PCADRM).PCADRM以适用于P2P应用环境的智能节点重叠网络为架构,将权限证书与媒体资源文件分开存储,通过PKI的双向身份认证提供混合模式的权限代理实现对媒体资源文件的访问控制,通过基于视频水印提取和验证的行为监测进行盗版追踪实现事后控制.在PCADRM的实践中证明,所提出的带有智能节点重叠网络的系统架构和采用的数字版权技术,实现了对P2P内容存取的管理和控制.     

基于语义的对等网络检索机制

 Content based full text search is a challenging problem in Peer to Peer (P2P) systems. A distributed P2P overlay network that supports semantic based content searches, called S-Peer, is proposed. Peers in this overlay are grouped based on the semantics of their data, and self organized as a semantic overlay network. To reduce overheads incurred by peer joining and leaving in a high dimensional overlay network, peers are constructed as a one dimensional semantic space that facilitates efficient routing. The results show the effectiveness, efficiency and scalability of the proposed system.     

A Method to Implement Full Anonymous Attestation for Trusted Computing Platform

Trusted computing （TC） technology is brought out by trusted computing group （TCG） to make computing as safe and reliable as people expect. Attestation is one main function specified by TCG, which is the means by which a trusted computer assures a remote computer whose platform is not tampered with. There are two protocols that implement attestation without disclosing the platform＇s real identity, which are Privacy CA-based protocol and direct anonymous attestation （DAA） protocol. However, in the first protocol the privacy CA is the bottleneck and the platform＇s identity will be disclosed if the privacy CA is compromise, while DAA protocol can do profiling when dealing with rogue hardware device. In this paper, we propose a DAA-extended new approach to ensure full anonymous attestation that can not only detect a rogue TPM, but also reveal rogue TPM＇s real identity.     

基于主题划分的有组织P2P搜索算法

提出一种基于主题划分的P2P搜索算法———主题覆盖网络搜索算法(TONS).TONS在有组织P2P网络基础上,将结点按主题组织成覆盖网络,使含有相似主题的结点链接在一起,因此可以根据内容将查询限定在P2P网络的局部范围内.通过在覆盖网络中随机添加一些长距离链接,使覆盖网络具有Small-World特性.TONS为有组织的P2P系统提供了一种能依据部分匹配、多关键词等复杂条件搜索结点数据对象的有效方法,与现有的有组织P2P系统相比,它可以将搜索的查全率提高74.7%,并减少P2P网络信息搜索的平均路径距离和平均消息数目.     

Solving the factorization problem with P systems

P systems have been used many times to face with computationally difficult problems, such as NP-complete decision problems and NP-hard optimization problems. In this paper we focus our attention on another computationally intractable problem: factorization. In particular, we first propose a simple method to encode binary numbers using multisets. Then, we describe three families of P systems: the first two allow to add and to multiply two binary encoded numbers, respectively, and the third solves the factorization problem.     

Solving the factorization problem with P systems

P systems have been used many times to face with computationally difficult problems, such as NP-complete decision problems and NP-hard optimization problems. In this paper we focus our attention on another computationally intractable problem: factorization. In particular, we first propose a simple method to encode binary numbers using multisets. Then, we describe three families of P systems: the first two allow to add and to multiply two binary encoded numbers, respectively, and the third solves the factorization problem.     

A Chord-based resource scheduling approach in drug discovery grid

This paper presents a resource scheduling approach in grid computing environment. Using P2P technology, this novel approach can schedule dynamic grid computing resources efficiently. Grid computing resources in different domains are organized into a structured P2P overlay network. Available resource information is published in type of grid services. Task requests for computational resources are also presented as grid services. Problem of resources scheduling is translated into services discovery. Different from central scheduling approaches that collect available resources information, this Chord-based approach forwards task requests in the overlay network and discovers satisfied resources for these tasks. Using this approach, the computational resources of a grid system can be scheduled dynamically according to the real-time workload on each peer. Furthermore, the application of this approach is introduced into DDG, a grid system for drug discovery and design, to evaluate the performance. Experimental results show that computational resources of a grid system can be managed efficiently, and the system can hold a perfect load balance state and robustness.     

一个层次式物理位置相关的P2P网络拓扑结构

针对现有的拓扑感知方法普遍存在消耗带宽较大、需要复杂计算的缺点,提出一种层次式物理位置相关的拓扑结构--multi-level chord(MLC).MLC采用直接利用物理网络拓扑结构构造overlay网络的方法,实现了在overlay网络中临近的节点在真实物理网络中也临近,同时避免了现有方法的缺点.理论分析和实验结果表明,MLC中分层的机制和各层Leader的引入,实现了较好的负载均衡;自底向上的查询机制,改善了路由效率,加快了查找速度;局部定期更新算法的引入,有效地减少了网络的通信流量.MLC在逻辑路径跳数、物理路径延时、平均传输时间等方面的性能均优于Chord.     

基于主题划分的搜索策略设计与研究

在P2P网络结构中,提出一种基于主题划分的搜索策略(TONS),该策略基于主题将网络中的节点层次化、形成叠加网络.具体查询算法包括基于DHT的非结构化P2P网络和基于主题划分的叠加网络搜索索引结构.实验结果表明:包含相似主题的节点联系在一起,这样就能够确保将搜索局限在仅与查询主题相关的节点子集中.该策略为基于分布式哈希表的P2P系统提供了一种可满足复杂查询条件、部分匹配搜索数据要求的有效途径.