论文标题
关于Gilbert-Elliott频道上流码的性能分析
On the Performance Analysis of Streaming Codes over the Gilbert-Elliott Channel
论文作者
论文摘要
Gilbert-elliot（GE）渠道是网络中数据包擦除的普遍模型。流码是一类数据包级擦除代码，旨在在GE通道上提供可靠的通信。流码的设计可能被视为两步过程。首先，一个更可拖动，更延迟约束的滑动窗口（DCSW）模型被认为是GE通道的代理。然后，该流码旨在可靠地从DCSW Channel模型引入的所有擦除中恢复。仿真通常用于评估原始GE渠道上流码的性能，因为分析性能评估具有挑战性。在本文中，我们朝着分析性能评估迈出了重要的第一步。认识到流式代码的大多数高效构造是基于数据包流中标量块代码的对角线嵌入或水平嵌入，因此在通过GE通道操作时，基础标量块代码的块蠕虫概率上的上限和下限。
The Gilbert-Elliot (GE) channel is a commonly-accepted model for packet erasures in networks. Streaming codes are a class of packet-level erasure codes designed to provide reliable communication over the GE channel. The design of a streaming code may be viewed as a two-step process. In the first, a more tractable, delay-constrained sliding window (DCSW) channel model is considered as a proxy to the GE channel. The streaming code is then designed to reliably recover from all erasures introduced by the DCSW channel model. Simulation is typically used to evaluate the performance of the streaming code over the original GE channel, as analytic performance evaluation is challenging. In the present paper, we take an important first step towards analytical performance evaluation. Recognizing that most, efficient constructions of a streaming code are based on the diagonal embedding or horizontal embedding of scalar block codes within a packet stream, this paper provides upper and lower bounds on the block-erasure probability of the underlying scalar block code when operated over the GE channel.
