Design of two-dimensional spatially coupled LDPC codes for combating burst erasures

Spatially-coupled low-density parity-check(SC-LDPC)codes are prominent candidates for fu-ture communication standards due to their‘threshold saturation’properties.However,when facing burst erasures,the decoding process will stop and the decoding performances will dramatically de-grade.To improve the ability of burst erasure corrections,this paper proposes a two-dimensional SC-LDPC(2D-SC-LDPC)codes constructed by parallelly connecting two asymmetric SC-LDPC coupled chains for resistance to burst erasures.Density evolution algorithm is presented to evaluate the as-ymptotic performances against burst erasures,by which the maximum correctable burst erasure length can be computed.The analysis results show that the maximum correctable burst erasure lengths of the proposed 2D-SC-LDPC codes are much larger than the SC-LDPC codes and the asym-metric SC-LDPC codes.Finite-length performance simulation results of the 2D-SC-LDPC codes over the burst erasure channel confirm the excellent asymptotic performances.

A Hybrid ARQ System with Erasures Correction and Parity Retransmission

A modified type of Hybrid ARQ system with erasures correction and parity bits retransmission is considered. Performance of the system is analyzed under assumption that the forward channel suffers from Nakagami common fading and additive white Gaussian noise. A good agreement between theoretical results and simulation is achieved. The proposed ARQ protocol is compared with other known Hybrid ARQ algorithms. It demonstrates significantly higher throughput efficiency in a range of SNR.

Priority-Based Real-Time Stream Coding over Multi-Channel with Packet Erasures

Multi-channel can be used to provide higher transmission ability to the bandwidth-intensive and delay-sensitive real-time streams. However, traditional channel capacity theories and coding schemes are seldom designed for the real-time streams with strict delay constraint, especially in multi-channel context. This paper considers a real-time stream system, where real-time messages with different importance should be transmitted through several packet erasure channels, and be decoded by the receiver within a fixed delay. Based on window erasure channels and i.i.d.(identically and independently distributed) erasure channels, we derive the Multi-channel Real-time Stream Transmission(MRST) capacity models for Symmetric Real-time(SR) streams and Asymmetric Real-time(AR) streams respectively. Moreover, for window erasures, a Maximum Equilibrium Intra-session Code(MEIC) is presented for SR and AR streams, and is shown able to asymptotically achieve the theoretical MRST capacity. For i.i.d. erasures, we propose an Adaptive Maximum Equilibrium Intra-session Code(AMEIC), and then prove AMEIC can closely approach the MRST transmission capacity. Finally, the performances of the proposed codes are verified by simulations.

Stable recovery of signals from frame coefficients with erasures at unknown locations

In an earlier work, we proposed a frame-based kernel analysis approach to the problem of recovering erasures from unknown locations. The new approach led to the stability question on recovering a signal from noisy partial frame coefficients with erasures occurring at unknown locations. In this continuing work, we settle this problem by obtaining a complete characterization of frames that provide stable reconstructions. We show that an encoding frame provides a stable signal recovery from noisy partial frame coefficients at unknown locations if and only if it is totally robust with respect to erasures. We present several characterizations for either totally robust frames or almost robust frames. Based on these characterizations several explicit construction algorithms for totally robust and almost robust frames are proposed. As a consequence of the construction methods, we obtain that the probability for a randomly generated frame to be totally robust with respect to a fixed number of erasures is one.

AVirtual Cloud Storage Architecture for Enhanced Data Security

The sensitive data stored in the public cloud by privileged users,such as corporate companies and government agencies are highly vulnerable in the hands of cloud providers and hackers.The proposed Virtual Cloud Storage Archi-tecture is primarily concerned with data integrity and confidentiality,as well as availability.To provide confidentiality and availability,thefile to be stored in cloud storage should be encrypted using an auto-generated key and then encoded into distinct chunks.Hashing the encoded chunks ensured thefile integrity,and a newly proposed Circular Shift Chunk Allocation technique was used to determine the order of chunk storage.Thefile could be retrieved by performing the opera-tions in reverse.Using the regenerating code,the model could regenerate the missing and corrupted chunks from the cloud.The proposed architecture adds an extra layer of security while maintaining a reasonable response time and sto-rage capacity.Experimental results analysis show that the proposed model has been tested with storage space and response time for storage and retrieval.The VCSA model consumes 1.5x(150%)storage space.It was found that total storage required for the VCSA model is very low when compared with 2x Replication and completely satisfies the CIA model.The response time VCSA model was tested with different sizedfiles starting from 2 to 16 MB.The response time for storing and retrieving a 2 MBfile is 4.96 and 3.77 s respectively,and for a 16 MBfile,the response times are 11.06 s for storage and 5.6 s for retrieval.

一种基于Erasure Code的分布式文件系统模型

提出了一种基于Erasure code容错理论的分布式文件系统模型并对其关键技术进行了深入的研究和探讨。介绍了文件系统和分布式文件系统的概念,基于Erasure code理论提出了具有适度容错机制的分布式文件系统架构。详细讨论和分析了该系统实现中涉及的一系列关键技术,最后简短描述了本模型的实现,并给出了其性能评价。

基于Erasure Code的分割文件P2P存储结构设计

在充分考虑P2P存储特点的前提下,设计了一种新颖的基于Erasure Code的分割文件P2P存储方案,构建Chord协议上的P2P文件存储结构。通过设计有效的文件存储、访问和更新功能,克服传统Erasure Code冗余文件存储方案的不足,使存储文件具有一定的数据修改能力和结构伸缩能力。理论分析和实验仿真验证了设计方案在P2P存储系统中的可行性和有效性。

基于无比率限制纠错编码的内容分布网络的设计与实现

结合CDN和P2P两种不同网络结构的优点,改善传统内容分布网络的拓扑结构,给出了一种基于无比率限制纠错编码实现的P2P内容分布网络设计。介绍了该内容分布网络的系统结构及相关关键技术等方面内容,以及这种新内容分布网络的特性。

一种安全增强的容灾数据保护体制研究

本文在利用可信计算技术的基础上,结合分布式门限存储思想,提出了一种容灾系统的安全增强体制。该体制引用了嵌有可信平台模块的可信计算平台,这种具有安全存储、远程证明等优势特性的平台有效保证了容灾终端的高可信性;为了保障信息数据的存储安全性,则采用基于Erasure码的分布式门限存储的安全增强技术,该技术不仅能解决海量数据的存储问题,而且可以较好地防止单点失效、减轻在容灾过程中网络负载以及解决联合欺骗等安全问题。因此,通过应用这些安全增强技术,可以为容灾系统中的海量数据提供全面的安全保护。

SegEra:一种Erasure Code与分割相结合的P2P存储结构

基于Erasure Code编码冗余存储技术,结合传统的文件分割存储思想,提出称为SegEra的Erasure Code与分割相结合的P2P存储结构.研究了SegEra的文件构成方式和存储结构特性,讨论其所适合的索引化离散数据存储分布架构;然后,从理论上研究了SegEra的P2P存储节点选择的优化方案,并针对P2P存储环境特点设计了与之相适应的简化算法;并通过仿真实验表明SegEra采用简化节点选择算法能够有效的提高存储文件的可用性水平.

一种基于Erasure码的数据安全体制研究

在利用可信计算技术的基础上,结合分布式门限存储思想,提出一种容灾系统的安全增强体制。该体制采用基于Erasure码的分布式门限存储的安全增强技术,不仅能解决海量数据的存储问题,而且可以较好地防止单点失效、减轻在容灾过程中网络负载以及解决联合欺骗等安全问题,通过应用这些安全增强技术,可以为容灾系统中的海量数据提供全面的安全保护。

基于Erasure Code的分布式文件存储系统

在局域网环境下,实现一种基于Erasure Code的分布式文件存储系统。该系统由元数据服务器和多个文件存储节点组成,通过对元数据与文件数据分离存储以提高文件访问效率,将Erasure Code有效冗余存储技术应用于文件编解码以增强可靠性,采用MD5消息摘要技术保证文件完整性。对30 MB^600 MB大小的文件测试结果表明,该系统具有更高的可靠性、安全性以及资源利用率。

The Erasure of Signifiers and Refusal of Signification in Philip Larkin's Poem“High Window”

This paper tries to analyze Philip Larkin's poem"High Window"from a deconstructive perspective. It is to show that in the poem the key words/signifiers are always under erasure, and thus the chain of signification is endless since the poem is self-deconstructing. Then, the paper argues that the linguistic features of the poem paradoxically meaningful in the sense that it reflects the poet's skepticism and anxiety.

拜占庭环境下新成员加入容错组状态同步

在主动复制技术下,为了容忍少量节点的拜占庭错误并提高组成员加入时状态同步的效率,提出了快速状态同步协议FSSP.FSSP利用Erasure Coding将状态数据分成P块,经过线性运算,编码成Q块(Q>P).新加入节点只需获得Q块中的任意P块数据即可完成解码,获得状态数据.同时FSSP使用Hash技术屏蔽了拜占庭节点带来干扰.仿真实验结果表明:在100M bit/s以太网环境下,网络传输时延是系统的主要瓶颈,无论待同步状态数据驻留在内存还是硬盘中,FSSP均要优于直接同步协议DSSP.这是因为FSSP有效地减少了网络中传输的报文量,以少量的编解码计算代价换取了较大的网络传输时延,最终达到了加快状态同步过程的目的.

基于Erasure code的实时流媒体传输系统

传统的流媒体传输系统需要一定规模的服务器群和集中式的带宽,在丢包问题中大部分采用丢包重传,即带ACK回执和重传的数据报文。提出一种新的容忍丢包和边缘服务器的传输方式,基于Erasure code的可恢复性,实现容忍丢包的发送接收模型。采用边缘计算的思想,将集中式的服务器群分散到任意主机上,通过动态地获取服务端地址,将实时数据流分成多块,经由不连续的边缘服务器进行转发,以降低对边缘服务器的带宽要求。可以根据边缘服务器的服务能力的不同分配传输数据量,达到动态的负载均衡。同时该系统具备隐私保护的功能。实验结果表明,该系统即使在较高丢包率和较差的网络环境下,仍然可以保证较低延迟的正常使用。

Network Coding Cooperation Performance Analysis in Wireless Network over a Lossy Channel, M Users and a Destination Scenario

Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels;typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fact, in some protocols the ARQ dropped from the rate 10ˉ1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).

A Fault Detection Mechanism in Erasure-Code Byzantine Fault-Tolerance Quorum

Fault-tolerance is increasingly significant for large-scale storage systems in which Byzantine failure of storage nodes may happen. Traditional Byzantine Quorum systems that tolerate Byzantine failures by using replication have two main limitations： low space-efficiency and static quorum variables. We propose an Erasure-code Byzantine Fault-tolerance Quorum that can provide high reliability with far lower storage overhead than replication by adopting erasure code as redundancy scheme. Through read/write operations of clients and diagnose operation of supervisor, our Quorum system can detect Byzantine nodes, and dynamically adjust system size and fault threshold. Simulation results show that our method improves performance for the Quorum with relatively small quorums.

Research of Methods for Lost Data Reconstruction in Erasure Codes over Binary Fields

In the process of encoding and decoding,erasure codes over binary fields,which just need AND operations and XOR operations and therefore have a high computational efficiency,are widely used in various fields of information technology.A matrix decoding method is proposed in this paper.The method is a universal data reconstruction scheme for erasure codes over binary fields.Besides a pre-judgment that whether errors can be recovered,the method can rebuild sectors of loss data on a fault-tolerant storage system constructed by erasure codes for disk errors.Data reconstruction process of the new method has simple and clear steps,so it is beneficial for implementation of computer codes.And more,it can be applied to other non-binary fields easily,so it is expected that the method has an extensive application in the future.

基于RS和Chord的分布式存储系统的设计

文章首先分析并实现了基于Vander monde矩阵的RS算法。接着本文提出并初步实现了一种基于RS编码算法和Chord协议的分布式存储系统,详细分析了系统的关键技术:Chord协议在分布式存储中的应用。最后本文介绍了系统的体系结构并进行了性能分析。

Channel Estimation for Cyclic Postfixed OFDM

A novel channel estimation algorithm is presented in this paper for the recently proposed cyclic postfix based on orthogonal frequency division multiplexing （OFDM） systems. Phase equalization with the erasure decision is used to reduce both the channel estimation error and the computational complexity. Simulation results show that the proposed channel estimation algorithm can effectively estimate the channel impulse response （CIR） and the performance of the proposed phase equalization with erasure decision is comparable with the minimal mean square error （MMSE） equalization, but it offers less computational complexity.