计算机支持的技术支援:概念与网络体系结构

首次提出了计算机支持的技术支援（CSTA）概念。计算机支持的技术支援是信息社会中技术支援的主要形式。分析了技术支援的过程、CSTA的技术特点和优点．总结了CSTA的基本研究内容和常用形式。针对技术支援的新需求、介绍了基于P2P的CSTA网络体系结构。     

对等网络的仿真研究

P2P网络和P2P相关技术一直是计算机网络研究的一大热点。P2P网络具有大规模、高动态性的特点,这使得在真实环境中实际运行、测试一个它需要付出巨大的努力和昂贵的开销。而P2P模拟器具有的优势能为P2P网络研究带来很大的方便,研究者们只需要将精力集中于想要关注的性能,丽不必花费大量的时间和精力去编写实验工具。文中深入研究了PeerSim模拟平台上模拟P2P环境的构建方法,并在其上实现了一个简单的负载平衡算法。最后,通过实验来说明PeerSim模拟器的使用方法,展示了PeerSim组件化的构造思想和灵活的配置机制。     

结构化对等网络特性及关键技术分析

本文简述了对等网络的概念及分类,分析了结构化对等网络特性、存在问题和关键技术,指出结构化对等网络的发展前景。     

Chord-PKI: A distributed trust infrastructure based on P2P networks

Many P2P applications require security services such as privacy, anonymity, authentication, and non-repudiation. Such services could be provided through a hierarchical Public Key Infrastructure. However, P2P networks are usually Internet-scale distributed systems comprised of nodes with an undetermined trust level, thus making hierarchical solutions unrealistic. In this paper, we propose Chord-PKI, a distributed PKI architecture which is build upon the Chord overlay network, in order to provide security services for P2P applications. Our solution distributes the functionality of a PKI across the peers by using threshold cryptography and proactive updating. We analyze the security of the proposed infrastructure and through simulations we evaluate its performance for various scenarios of untrusted node distributions.     

Self-scaling cooperative discovery of service compositions in unstructured P2P networks

We propose an efficient technique for improving the performance of automatic and cooperative compositions in unstructured Peer-to-Peer networks during service discovery. The technique exploits a probabilistic forwarding algorithm that uses different sources of knowledge, such as network density and service grouping, to reduce the amount of messages exchanged in the network. The technique, analysed in several network configurations by using a simulator to observe resolution time, recall and message overhead, presents good performance especially in dense and large-scale service networks.     

非结构化P2P网络中基于节点的MQR算法设计与实现

在非结构化P2P搜索中,由于缺少全局性的管理机制,网络节点无法获得整个网络的拓扑结构及目标数据的定位信息,因此查询消息的路由过程具有较高的随机性,不仅查询性能低,而且宽带消耗大。为在有效控制网络冗余消息规模的同时提高数据的搜索范围,在分析现有2类典型非结构化P2P路由算法的基础上,提出一种基于节点的MQR算法。利用网络节点的状态信息及搜索过程中查询消息的TTL值状态信息,从数据的搜索范围与网络使用情况2个方面来提高非结构化P2P网络搜索性能。仿真实验结果表明,与传统的P2P路由算法APS和Random Walk相比,该算法在搜索准确率、网络利用率及召回率方面有更好的表现。     

一种基于PKI的P2P计算平台设计与实现*

分布式P2P计算不同于传统的客户/服务器模式.通过分析P2P系统的安全需求,讨论了如何将PKI技术应用到P2P分布式计算中的问题.设计并实现了一种基于PKI技术的P2P安全计算平台.该平台结合了Web Services中的XML,SOAP等技术以及JXTA架构,在一定程度上实现了P2P环境中的安全认证与资源的访问控制,保证了P2P计算的安全性.     

基于P2P网络的机顶盒VoD系统条件接收机制

近年来,基于对等网络(Peer-to-Peer,P2P)的视频点播(Video-on-Demand,VoD)作为付费网络电视业务的一种新趋势受到了越来越多的关注,然而对等网络自身存在的不稳定性、异构性等缺陷,导致这种系统存在较大的信息安全隐患,从而严重阻碍了其推广使用.基于P2P网络的机顶盒VoD系统条件接收机制分析了现有系统的不安全因素及问题症结,提出了一种适用于P2P网络的VoD系统动态双向条件接收(Conditional Access,CA)机制,通过采用双向认证协议来保证通信双方身份的可靠性.同时在身份认证中可以结合密钥协商,生成用于传输控制字的业务密钥.另外,在简化设计的同时,也进一步提高了系统的安全性.     

基于TOF的海潮高度在线测量系统设计

为提高现有的潮汐及水位仪器(如浮子式、超声波式、雷达式水位计)在线测量的实时性和稳定性,减小仪器的体积、成本和功耗,设计了一种基于TOF(Time of Flight,即飞行时间法)三维成像测距并结合XBEE MESH技术的无线网络测量系统.传感节点使用准直的850 nm红外LED发射光源,采用ARM+CPLD控制和提取EPC610 TOF成像芯片的有效测量数据并进行实时校正和计算,单个测量节点能实现1 m~7 m范围内误差±1.25 cm,测量速率为500次/秒的高速测量,其尺寸只有2.5 cm×2.5 cm大小.无线网络部分采用Peer-to-Peer MESH自组织网络结构,采用无线模块主动唤醒传感器,同步和异步休眠相结合的控制形式大大降低了功耗.     

Analysis of distribution time of multiple files in a P2P network

Peer-to-Peer (P2P) file sharing attracts much attention due to its scalability and robustness. One important metric in measuring the performance of a P2P file sharing system is the amount of time required for all peers to get the files. We refer this time as the file distribution time. Researchers have proposed protocols to minimize the file distribution time under different situation. However, most works are based on the single-file scenario. On the other hand, there are studies showing that in a file sharing application, users may download multiple files at the same time. In this paper, we analyze the minimum time needed to distribute multiple files. We develop an explicit expression for the minimum amount of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file is not always achievable. With a comprehensive consideration of all the configurations, we elaborate how to partition the bandwidth capacities of both seeds and leechers for a particular file such that the finish time is optimal.