LDPC码串行解码算法建模

消息传递机制是影响LDPC码解码性能的重要因素。简要介绍了Gallager提出的LDPC码和基于洪水消息传递机制的和积解码算法。在此基础上引入基于校验节点的串行消息传递机制并提出具体可实现的解码算法模型。该串行解码算法按照校验节点一定的顺序进行消息处理和传递,保证更新的消息能够马上进入迭代过程,从而改善消息传递的收敛特性;同时充分利用消息间相互关联的特点,融合消息传递步骤,可以降低所需的存储容量,简化解码复杂度。分别应用洪水解码算法和串行解码算法在AWGN信道下进行性能仿真。仿真结果表明串行解码算法使解码性能得到明显提高。     

ASHs: application-specific handlers for high-performance messaging

Application-specific safe message handlers (ASHs) are designed to provide applications with hardware-level network performance. ASHs are user-written code fragments that safely and efficiently execute in the kernel in response to message arrival. ASHs can direct message transfers (thereby eliminating copies) and send messages (thereby reducing send-response latency). In addition, the ASH system provides support for dynamic integrated layer processing (thereby eliminating duplicate message traversals) and dynamic protocol composition (thereby supporting modularity). ASHs offer this high degree of flexibility while still providing network performance as good as, or (if they exploit application-specific knowledge) even better than, hard-wired in-kernel implementations. A combination of user-level microbenchmarks and end-to-end system measurements using TCP demonstrates the benefits of the ASH system     

Performance measurement of data transfer services in MAP

The emergence of the enhanced performance architecture, which provides the application process with direct access to a fast datalink datagram service provided by the full MAP (manufacturing automation protocol), is discussed. An explanation is given of the functional differences between the two service types and why both are useful in the manufacturing environment. It is shown that message segmentation makes a substantial contribution to overall message latency. The effect of retransmission timer setting and the maximum credit window size is illustrated. Throughput and end-to-end delay for one implementation of MAP are reported, and conclusions are drawn about the expected performance cost of messages sent as datagrams versus messages sent over virtual circuits     

Channel-quality-aware multihop broadcast for asynchronous multi-channel wireless sensor networks

In this paper, we propose Multi-channel EMBA (M-EMBA), efficient multihop broadcast for asynchronous multi-channel wireless sensor networks. Our scheme employs two channel-quality-aware forwarding policies of improved forwarder’s guidance and fast forwarding to improve multihop broadcast performance. The improved forwarder’s guidance allows forwarders to transmit broadcast messages with guidance to their receivers through channels with good quality. The guidance indicates how each receiver should forward the broadcast message to its neighbor nodes. The improved forwarder’s guidance tremendously reduces redundant transmissions and collisions. Fast forwarding allows adjacent forwarders to send their broadcast messages simultaneously through different channels that have good quality, which helps to reduce multihop broadcast latency and improve multi-channel broadcast utility. In this work, we evaluate the multihop broadcast performance of M-EMBA through theoretical analysis of the system design and empirical simulation-based analysis. We implement M-EMBA in ns-2 and compare it with the broadcast schemes of ARM, EM-MAC, and MuchMAC. The performance results show that M-EMBA outperforms these protocols in both light and heavy network traffic. M-EMBA reduces message cost in terms of goodput, total bytes transmitted, as well as broadcast redundancy and collision. M-EMBA also achieves a high broadcast success ratio and low multihop broadcast latency. Finally, M-EMBA significantly improves energy efficiency by reducing average duty cycle.     

Novel Advanced Broadcast Scheme for Efficient Safety Message Collision Alleviation in Vehicular Networks

Safety message broadcasting may cause a broadcast storm in vehicular ad-hoc network without an effective feedback mechanism. In particular, with increasing number of vehicles, serious collisions and incurred long delays are not acceptable for emergency safety messages. In this paper, we proposed an advanced broadcast scheme by the functionality of distributed coordination function and multi-channel operation in dedicated short range communication to decrease collision probability and increase received ratio of safety messages. The proposed scheme can increases safety message transmission efficiency and reduce the latency by delicately designing a rebroadcast probability, choosing the channel and selecting the backoff timer. After broadcasting in the control channel, transmitters return to their original service channel. Then, the vehicles receiving the safety message should inform the others in the same service channel to switch to the control channel for the safety message. Afterwards, the vehicles broadcast the safety message once and go back to the original service channel. This method can inform the other vehicles in different channels to increase the broadcast penetration. The proposed scheme can work without global positioning system (GPS). However, GPS can adapt the rebroadcast probability on hot spots to enhance the efficiency of the proposed scheme. Through detailed simulations, the proposed scheme is shown to be more efficient compared to the existing ones.     

The MIT Alewife Machine

A variety of models for parallel architectures, such as shared memory, message passing, and data flow, have converged in the recent past to a hybrid architecture form called distributed shared memory (DSM). Alewife, an early prototype of such DSM architectures, uses hybrid software and hardware mechanisms to support coherent shared memory, efficient user level messaging, fine grain synchronization, and latency tolerance. Alewife supports up to 512 processing nodes connected over a scalable and cost effective mesh network at a constant cost per node. Four mechanisms combine to achieve Alewife's goals of scalability and programmability: software extended coherent shared memory provides a global, linear address space; integrated message passing allows compiler and operating system designers to provide efficient communication and synchronization; support for fine grain computation allows many processors to cooperate on small problem sizes; and latency tolerance mechanisms-including block multithreading and prefetching-mask unavoidable delays due to communication. Extensive results from microbenchmarks, together with over a dozen complete applications running on a 32-node prototype, demonstrate that integrating message passing with shared memory enables a cost efficient solution to the cache coherence problem and provides a rich set of programming primitives. Our results further show that messaging and shared memory operations are both important because each helps the programmer to achieve the best performance for various machine configurations     

基于并发事务逻辑的Web服务编制验证

 服务编制解决的是组织之间的业务集成问题,面临的是一个广泛分布、动态、自治、异构的网络环境,保障组合服务的正确执行以及相关特性的验证问题显得尤为重要.形式化方法是一种有效的解决方法,服务编制需要建立在严格的形式化模型的基础上,可以通过具有明确的、形式化语义的形式化模型研制验证工具来完成组合服务正确性的验证.本文基于并发事务逻辑(CTR:Concurrent TRansaction Logic)对服务编制的元素进行了描述和建模,给出了从WS-BPEL到并发事务逻辑的转换规则,讨论了服务编制在CTR中的验证问题以及WS-BPEL和CTR的表达能力,最后给出了一个实际的服务编制在CTR中建模的例子,验证了服务编制的CTR模型的有效性.     

基于贝叶斯算法的短信营业厅防护系统设计

针对电信运营商短信营业厅系统易受垃圾短信影响的问题,给出一种基于贝叶斯算法的短信营业厅防护系统构建方法,即在现有系统的基础上,另外构建一个与现有业务系统无耦合的独立系统,部署在短信营业厅系统前端进行短信预处理。新系统主要由文本特征提取模块、分类模块、过滤模块组成,对接收到短信按贝叶斯算法进行分类,按规则库进行过滤和清洗垃圾短信,将有价值的短信送到短信营业厅系统处理,减少垃圾短信对系统资源的开销。理论分析显示,利用所建系统,可达到对短信营业厅有效防护效果。实践证明,防护系统应用后,短信营业厅系统资源消耗下降。     

短信业务与语音信箱业务的融合方案探讨

针对短信业务不能解决阅读能力受限群体的使用问题,以现有的短信业务和语音信箱业务为基础,结合文本转语音技术,提出一种融合型的听短信业务技术方案,以实现阅读能力受限群体听短信的业务需求。按此技术方案,短信业务系统根据用户约定和服务策略可以把短信转换成语音留言后转发给语音信箱业务系统,用户可以通过语音信箱业务系统收听短信。     

Impact of number of angles on the performance of the data vortex optical interconnection network

Reducing communication latency in multiprocessor interconnection networks can increase system performance on a broad range of applications. The data vortex photonic network reduces message latency by utilizing all-optical end-to-end transparent links and deflection routing. Cylinders replace node storage for buffering messages. The cylinder circumference (measured as number of angles) has a significant impact on the message acceptance rate and average message latency. A new symmetric mode of usage for the data vortex is discussed in which a fraction of the angles is used for input/output (I/O), and the remainder is used for "virtual buffering" of messages. For single-angle injection, six total angles provide the best performance. Likewise, the same ratio of 5 : 1 purely routing nodes versus I/O nodes is shown to produce greater than 99% acceptance, under normal loading conditions for all other network sizes studied. It is shown that for a given network I/O size, a shorter height and wider circumference data vortex organization provides acceptable latency with fewer total nodes than a taller but narrower data vortex. The performance versus system cost is discussed and evaluated, and the 5 : 1 noninjection-to-injection angle ratio is shown to be cost effective when constructing a system in current optical technology.