Topology-aware peer-to-peer overlay network for Ad-hoc

The mismatch between the structured peer-to-peer (P2P) overlay network, which is based on Hashing, and the actual physical network, leads to query repeatedly passing through some nodes in the actual route when it is applied in Ad-hoc networks. An approach of getting an appropriate node identifier (ID) bearing its local physical information is proposed, in which the traditional theory of getting node ID through Hashing the node's Internet protocol (IP) address is abandoned, and a topology-aware overlay network suiting Ad-hoc networks is constructed. The simulation results show that the overlay network constructed in the proposed method can avoid the route being iteratively accessed. Meanwhile, it can effectively minimize the latency and improve the load balance.     

P2P环境下的文本检索综述

对等网络在可扩展性、数据更新和隐私保护等方面的特点,使其成为下一代网络发展的重要方向.在对等网络环境下实现文本的检索,已经成为对等技术应用研究的一个重要领域.文中关注对等网络环境下文本检索领域的研究现状,讨论了对等网络中文本检索的研究热点和未来几年的发展趋势并指出了进一步的研究方向.     

A location‐aware peer‐to‐peer overlay network

This work describes a novel location‐aware, self‐organizing, fault‐tolerant peer‐to‐peer (P2P) overlay network, referred to as Laptop. Network locality‐aware considerations are a very important metric for designing a P2P overlay network. Several network proximity schemes have been proposed to enhance the routing efficiency of existing DHT‐based overlay networks. However, these schemes have some drawbacks such as high overlay network and routing table maintenance overhead, or not being completely self‐organizing. As a result, they may result in poor scalability as the number of nodes in the system grows. Laptop constructs a location‐aware overlay network without pre‐determined landmarks and adopts a routing cache scheme to avoid maintaining the routing table periodically. In addition, Laptop significantly reduces the overlay maintenance overhead by making each node maintain only the connectivity between parent and itself. Mathematical analysis and simulations are conducted to evaluate the efficiency, scalability, and robustness of Laptop. Our mathematical analysis shows that the routing path length is bounded by log_d N, and the joining and leaving overhead is bounded by d log_d N, where N is the number of nodes in the system, and d is the maximum degree of each node on the overlay tree. Our simulation results show that the average latency stretch is 1.6 and the average routing path length is only about three in 10 000 Laptop nodes, and the maximum degree of a node is bounded by 32. Copyright © 2006 John Wiley & Sons, Ltd.     

Widely tunable long-period fiber grating with nm-thick higher refractive index film overlay

By introducing a four-layer step-index waveguide modeling, the characteristics of long-period fiber grating (LPFG) with an nm-thick film overlay, which has higher refractive index than that of fiber cladding are investigated in detail. The influence of both the overlay thickness and refractive index on the tuning ability of LPFG is analyzed. The numerical results demonstrate that spectral response of LPFG is divided into three distinct regions as the overlay deposition increases and the shift of resonant wavelength is drastic in some special thickness range. In conjunction with higher-order cladding mode coupling and fiber cladding etching, the sensitivity of LPFG to the overlay refractive index is enhanced significantly and over 120 nm resonant wavelength tunable range is achieved.     

基于DSP与FPGA的全姿态指引仪图形显示系统设计

针对机载电子全姿态指引仪显示图形信息的特征及其变化特点,在系统初始化时将图形内容分为背景层、填充层和动态字符层三层,运算过程中只改变根据参数变化的填充层和字符层;将图形运算过程分为图形轮廓生成和硬件区域填充,分别由DSP软件标记区域边界,FPGA根据标记硬件完成区域填充;同时图形运算处理算法在所设计的DSP＋FPGA的硬件平台上进行了实现与验证,结果表明,这种图形处理方法减轻了传统处理方法中主处理器的运算负担,很大程度上提高了系统的实时性。     

PAPER—Accelerating parallel evaluations of ROCS

Modern graphics processing units (GPUs) are flexibly programmable and have peak computational throughput significantly faster than conventional CPUs. Herein, we describe the design and implementation of PAPER, an open‐source implementation of Gaussian molecular shape overlay for NVIDIA GPUs. We demonstrate one to two order‐of‐magnitude speedups on high‐end commodity GPU hardware relative to a reference CPU implementation of the shape overlay algorithm and speedups of over one order of magnitude relative to the commercial OpenEye ROCS package. In addition, we describe errors incurred by approximations used in common implementations of the algorithm. © 2009 Wiley Periodicals, Inc. J Comput Chem 2010     

适用于无线通信的动态拓扑感知性P2P网络

 在无线信道环境下,如何解决逻辑拓扑与物理拓扑之间的失配是设计P2P网络的主要挑战之一。本文提出一种适用于无线系统的P2P组网协议。在该协议中,首先,新入网节点从其邻居节点处获得一个数值上相近的节点标号,从而实现网络的瞬时拓扑感知。当节点的位置改变时,它们向中心节点更新自己的位置信息。然后,在中心节点处将节点标号的最优分配转换为旅行商问题,并用模拟退火算法对旅行商问题进行最优化求解,得到优化标号序列。最后,由中心节点向网络广播更新信息,引导节点进行标号和数据交换,从而使无线P2P网络在任何时刻都具有拓扑感知性。仿真结果表明,在基于该协议的无线P2P网络中,文件的定位路径明显缩短,定位延时明显减小。     

具有位置感知和语义特征的P2P网络模型

 非结构化P2P网络中常用的泛洪搜索方法造成了严重的通信消耗.提出一种基于位置感知和语义的P2P网络模型,在覆盖网络的构建过程中考虑底层的物理网络拓扑,同时兼顾拓扑结构与共享资源之间的相关性.该网格模型基础上,给出了语义搜索算法.实验结果表明,提出的网络模型能够减少覆盖网络与底层物理网络拓扑不匹配带来的网络开销,并且在查找性能和网络开销之间取得了良好的平衡.     

支持延时约束的覆盖多播路由协议的研究

研究有度和延时约束的覆盖多播路由问题,提出了一个新的覆盖多播路由协议-延时受限的树协议(DBTP)。该协议采用分布式和树优先的策略,使多播组成员之间能自组织地构建一棵基于源的覆盖多播树。DBTP协议采用了一种新的启发式局部优化算法,通过调节启发因子,能灵活地在延时和代价之间进行折衷。仿真实验表明,无论在静态还是动态节点模型下,选择适当的启发参数,DBTP都能获得较高的节点接纳率。     

基于覆盖网络的应用层选播服务的设计与研究

针对网络层的选播通信存在着可扩展性和无状态服务等根本问题,在现有的应用层选播研究基础上,提出了一种基于覆盖网络的应用层选播的结构,并把这种结构从代理节点的部署和链路的选取上进行求解,并通过实验对此拓扑结构进行了验证.