Joost——网络电视新星

如果说第一代和第二代P2P网络电视是一直在磨刀,那么从现在起,以Joost为代表的第三代P2P网络电视可以说是对电视工业开展了一场事先张扬的杀戮。     

基于P2P的协作系统研究

传统的协作存在固有的缺陷。系统可靠性和扩展性差，不能充分利用客户端资源。P2P系统不但架构灵活，有高可扩展性，而且能充分利用计算和网络资源。分析了协作系统采用P2P架构所具有的优点，并提出一个基于微软P2PSDK的协作系统设计与实现方案。     

基于语义路由的P2P系统综述

介绍了P2P系统的发展状况，归纳了典型的结构化P2P系统模型，对结构化P2P系统中的节点拓扑结构、语义路由算法、数据存储和共享、应用层多播等热点问题进行了讨论，介绍了非结构化P2P系统的语义路由过程，总结了当前主要的基于语义路由P2P系统的优缺点，并据此提出了该领域的发展趋势。     

P2P系统服务质量研究

随着P2P计算受到越来越多的关注,如何系统全面地对一个P2P系统作出评估成了一个非常重要的问题。本文从服务质量的角度来系统地考虑P2P系统评估的问题,提出了一个P2P系统服务质量度量框架,以帮助和指导P2P系统的设计和选择。     

下载软件——迅雷3.0

迅雷是深圳三代公司开发的一款P2P下载软件，它能够通过多媒体检索数据库将许多孤立的服务器资源和P2P资源整合到一起，从而提供给用户更高的下载速度。以往使用P2P下载的用户经常会遇到没有种子从而无法完成下载的情况，迅雷则通过在系统中整合服务器资源解决了这个问题，结合了服务器下载的稳定可靠和P2P下载的高速特点。     

P2P系统资源查询机制研究综述

随着计算机网络的迅速发展和个人计算机处理能力的不断提高，P2P技术已高度重视其新的特性。但是，P2P系统的高度动态性和资源的广泛分布性使其难以共享资源。本文讨论了P2P系统的资源查询机制，描述和分析了一些方法，给出了查询机制的要求和目标。     

P2P网络分布式入侵检测系统

本文介绍了P2P技术以及基于P2P的Gnutella网络模型，提出把P2P技术应用于入侵检测系统中，从而使分散的对等体中的入侵检测系统联合起来形成一个整体，协同合作入侵检测和共享日志信息，最后介绍了该系统的设计实现。     

Peer-to-Peer数据共享研究

最近一段时间，由于许多Peer-to-Peer(简写为P2P)系统例如Napster、Freenet和Gnutella等的成功应用，P2P数据共享问题成为国际上应用领域和研究领域内的热点。在数据管理领域内的国际会议和杂志上也可以纷纷见到这方面的文章，分别从体系结构、数据表示、数据检索、资源管理和安全与法律等方面着手研究在P2P的环境下进行数据共享的问题。由于Peer-to-Beer自身开放性和松散性的特点，导致了P2P系统在很多方面都需要进行进一步的深入研究。在本文中，我们将对P2P数据管理领域内目前的研究现状作一个综述。     

P2P网络中Windows系统安全策略研究

本文主要探讨了P2P技术及其网络模式中单个主机系统的网络安全策略分析,首先,对P2P概念、网络模型进行分析,指出P2P技术应用的特点,存在的安全问题;接着提P2P网络中Windows系统存在的安全问题及应对策略,最后提出防范措施和技巧。     

基于P2P的证书库系统设计与实现

采用P2P技术设计了一个证书库系统，与传统的采用目录服务器设计的证书库系统相比，该系统具有良好的可扩展性、健壮性、负载平衡和容灾容错等特性，解决了传统目录服务系统不易配置，出现访问瓶颈的问题。     

Structured P2P technologies for distributed command and control

The utility of Peer-to-Peer (P2P) systems extends far beyond traditional file sharing. This paper provides an overview of how P2P systems are capable of providing robust command and control for Distributed Multi-Agent Systems (DMASs). Specifically, this article presents the evolution of P2P architectures to date by discussing supporting technologies and applicability of each generation of P2P systems. It provides a detailed survey of fundamental design approaches found in modern large-scale P2P systems highlighting design considerations for building and deploying scalable P2P applications. The survey includes unstructured P2P systems, content retrieval systems, communications structured P2P systems, flat structured P2P systems and finally Hierarchical Peer-to-Peer (HP2P) overlays. It concludes with a presentation of design tradeoffs and opportunities for future research into P2P overlay systems.     

基于P2P系统信任机制的DRM模型

P2P技术的成熟同时也给数字内容的版权保护带来更大的挑战.传统C/S模式下的DRM已不能满足P2P环境下的数字版权保护.结合现阶段网络技术中P2P技术的实际应用情况和新一代数字版权管理(DRM)技术,提出了基于P2P系统信任机制的版权管理模型.该模型通过秘密共享思想将许可证密钥分发给P2P网络中的可信任节点,为基于P2P技术的数字内容分发提供了必要的安全保障.通过分析与仿真实验表明,该模型较现有数字版权管理模型在传输的容错性、入侵容忍性与安全性方面都有较大的提高.     

A Containment-Based Security Model for Cycle-Stealing P2P Applications

ABSTRACT

P2P networks and the computations they enable hold great potential in creating the next generation of large-scale distributed applications. However, the P2P phenomenon has largely left untouched large organizations and businesses that have stringent security requirements and are uncomfortable with the anonymity and lack of centralized control/censorship which are the features of P2P systems. Hence, there is an urgent need to address the security concerns in deploying P2P systems which can leverage the underutilized compute resources in organizations across the world. This article proposes a containment-based security model (CBSM) for cycle-stealing P2P applications, based on the Secure Linux (SE Linux) Operating System, which alleviates existing security concerns, allowing peers to host untrusted or even hostile applications. Our approach is suitable for pure P2P applications and requires no message exchanges or trust computations in ensuring security. Testing via deployment of potentially malicious remote code proves the effectiveness of the proposed system.     

Hierarchical architectures in structured peer-to-peer overlay networks

Distributed Hash Tables (DHT) are presently used in several large-scale systems in the Internet and envisaged as a key mechanism to provide identifier-locator separation for mobile hosts in Future Internet. Such P2P-based systems become increasingly complex serving popular social networking, resource sharing applications, and Internet-scale infrastructures. Hierarchy is a standard mechanism for coping with heterogeneity and scalability in distributed systems. To address the shortcomings of flat DHT designs, many hierarchical P2P designs have been proposed over recent years. The last generation is hierarchical DHTs (HDHTs) where nodes are organized onto layers and groups. This article discusses hierarchical architectures applied in structured P2P overlay networks, focusing on HDHT designs. We introduce a framework consisting of conceptual models of network hierarchy, multi-layer hierarchical DHT architectures, principles affecting the design choices, and cost models for system tradeoff analysis, performance evaluation, and scalability estimation. Based on the framework we provide a taxonomy and survey more than 20 hierarchical HDHT proposals.     

The problem of upload competition in peer‐to‐peer systems with incentive mechanisms

As peer‐to‐peer (P2P) file‐sharing systems revolve around cooperation, the design of upload incentives has been one of the most important topics in P2P research for more than a decade. Several deployed systems, such as private BitTorrent communities, successfully manage to foster cooperation by banning peers when their sharing ratio becomes too low. Interestingly, recent measurements have shown that such systems tend to have an oversupply instead of an undersupply of bandwidth designers that have been obsessed with since the dawn of P2P. In such systems, the ‘selfish peer’ problem is finally solved, but a new problem has arisen: because peers have to keep up their sharing ratios, they now have to compete to upload. In this paper, we explore this new problem and show how even highly cooperative peers might in the end not survive the upload competition. On the basis of recent measurements of over half a million peers in private P2P communities, we propose and analyze several algorithms for uploader selection under oversupply. Our algorithms enable sustained sharing ratio enforcement and are easy to implement in both existing and new systems. Overall, we offer an important design consideration for the new generation of P2P systems in which selfishness is no longer an issue. Copyright © 2012 John Wiley & Sons, Ltd.     

内容寻址网络CAN研究

新一代结构化可扩展P2P系统采用支持分布式哈希表(Distributed Hash Table,DHT)的路由算法。CAN（Content-Addressable Network）在d维虚拟坐标空间上利用DHT来实现内容定位,具有较好的可扩展性、容错性和完全自组等特点。介绍了CAN的原理,重点分析了CAN的构建和路由算法,并讨论了CAN算法的几种改进策略。     

Scalable heterogeneous parallelism for atmospheric modeling and simulation

Heterogeneous multicore chipsets with many levels of parallelism are becoming increasingly common in high-performance computing systems. Effective use of parallelism in these new chipsets constitutes the challenge facing a new generation of large scale scientific computing applications. This study examines methods for improving the performance of two-dimensional and three-dimensional atmospheric constituent transport simulation on the Cell Broadband Engine Architecture (CBEA). A function offloading approach is used in a 2D transport module, and a vector stream processing approach is used in a 3D transport module. Two methods for transferring incontiguous data between main memory and accelerator local storage are compared. By leveraging the heterogeneous parallelism of the CBEA, the 3D transport module achieves performance comparable to two nodes of an IBM BlueGene/P, or eight Intel Xeon cores, on a single PowerXCell 8i chip. Module performance on two CBEA systems, an IBM BlueGene/P, and an eight-core shared-memory Intel Xeon workstation are given.     

基于在线概率的P2P网络系统动力学模型

为了更好地刻画P2P文件共享系统中节点行为的随机性,提出了一种基于在线概率的动力学模型. 首先,引入节点的在线概率来刻画节点行为的随机性,并通过分析系统中节点之间交互演化的过程,建立了基于在线概率的动力学模型. 然后,通过对模型的分析,研究了影响系统演化的多个因素,这主要通过对相关算法的具体形式分析来体现. 之后,对算法进行改进,提出了基于在线概率的节点选择算法、带宽分配算法与节点阻塞算法. 最后,通过仿真实验对模型进行了验证和分析.     

结构化P2P系统路由机制的研究

基于分布式哈希表的结构化P2P系统得到了广泛的研究,这些系统的网络拓扑结构一般都以图论中的一些广为研究的图作基础,而且大量借鉴了并行系统的研究成果。介绍了几个常见的结构化P2P系统,对其拓扑结构和路由算法作了分析对比。     

非结构化P2P系统Overlay优化技术综述

非结构化P2P Overlay网络的结构松散, 网络中资源的分布没有明确的限制, 这使得非结构化P2P Overlay网络中的资源搜索在很大程度上依赖于通信开销巨大的泛洪法, 因而非结构化P2P系统在伸缩性, 可用性等方面, 存在明显的不足. 非结构化P2POverlay网络的上述特点决定了非结构化P2P Overlay优化技术的重要性. 本文分四大类别, 对非结构化P2P Overlay优化技术进行了介绍, 分析比较了各类方法的优劣以及它们的适用场合, 并在此基础上对未来工作进行了展望.