Quality-of-service-aware adaptation scheme for multi-core protocol processing architecture

Employing adaptable protocol processing architectures has shown a high potential in provisioning Quality-of-Service (QoS) while retaining efficient use of available energy budget. Nevertheless, successful QoS provisioning using adaptable protocol processing architectures requires adaption to be agile and to have low latency. That is, a long adaptation latency might lead to violating desired packet processing latency, desired throughput or loss of packets if the memory fails to accommodate packet accumulation. This paper presents an elastic management scheme to permit agile and QoS-aware adaptation of processing elements (PEs) within the protocol processing architecture, such that desired QoS is maintained. Moreover, our proposed scheme has the potential to reduce energy consumption since it employs the PEs upon demand. We quantify the latency required for PEs adaptation, the reduction in energy and the reduction in area that can be achieved using our scheme. We also consider two different real-life use cases to demonstrate the effectiveness of our proposed management scheme in maintaining QoS while conserving available energy.     

Robust throughput and routing for mobile ad hoc wireless networks

Flows transported across mobile ad hoc wireless networks suffer from route breakups caused by nodal mobility. In a network that aims to support critical interactive real-time data transactions, to provide for the uninterrupted execution of a transaction, or for the rapid transport of a high value file, it is essential to identify robust routes across which such transactions are transported. Noting that route failures can induce long re-routing delays that may be highly interruptive for many applications and message/stream transactions, it is beneficial to configure the routing scheme to send a flow across a route whose lifetime is longer, with sufficiently high probability, than the estimated duration of the activity that it is selected to carry. We evaluate the ability of a mobile ad hoc wireless network to distribute flows across robust routes by introducing the robust throughput measure as a performance metric. The utility gained by the delivery of flow messages is based on the level of interruption experienced by the underlying transaction. As a special case, for certain applications only transactions that are completed without being prematurely interrupted may convey data to their intended users that is of acceptable utility. We describe the mathematical calculation of a network’s robust throughput measure, as well as its robust throughput capacity. We introduce the robust flow admission and routing algorithm (RFAR) to provide for the timely and robust transport of flow transactions across mobile ad hoc wireless network systems.     

DVE architecture based on message category

By importing the idea of P2P,and transmitting messages among clients directly into the client-server architecture,a new hybrid architecture was presented with the help of AOI technology and message category.Theoretical analysis of this architecture was presented in detail.A series of simulation experiments was carried out to verify its effectiveness.Results indicate that the new architecture produces less server message workload than traditional architectures,which can improve the scalability of DVE systems.     

基于H．264的宏块级码率控制算法

基于H．264码率控制算法的研究,考虑到图像中各宏块之间的差异,提出了宏块级的码率控制算法。实验结果表明,与JVT-G012提案相比,该方法在准确控制码率的同时,图像的视觉质量也有一定的提高。     

广义Jacobi序列的自相关函数

相关函数是衡量序列密码安全性的重要指标。该文讨论了两类广义Jacobi序列的自相关特性,给出了它们的自相关函数的取值,结论表明:两类广义Jacobi序列都具有良好的自相关特性。     

一种利用虚拟极坐标的横向融合算法*

针对无线传感器网络汇聚节点周围的热区问题提出一种横向融合的算法,从簇首中再挑选出一部分节点充当融合点,将数据包充分融合,以减少网络中流动的数据包数量。该算法通过给节点标记跳数和角度范围,建立虚拟极坐标结构。利用角度选择融合点,外层节点数据横向传送到融合点进行充分融合再递交给内层节点,以减少内层节点负担,从而缓解热区节点能耗过快的情况。     

基于H.264码率控制算法的研究与改进

基于对H.264码率控制算法的研究,考虑到图像中各宏块之间的差异,提出了宏块级的码率控制算法。实验结果表明,与JVT-G012提案相比,该方法在准确控制码率的同时,图像的视觉质量也得到了提高。