arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.4443cs.ITmath.IT
收藏

时分双工中的广播:一种随机线性网络编码方法

Broadcasting in Time-Division Duplexing: A Random Linear Network Coding Approach

Daniel E. Lucani, Muriel Médard, Milica Stojanovic

摘要:

本文研究了时分复用信道中的随机线性网络广播编码。我们假设一个包擦除信道的节点不能同时发送和接收信息。发送器在停止以等待接收器确认正确解码信息所需的自由度的数量(如果有的话)之前连续地发送编码数据分组。我们研究的平均时间完成传输的数据包块的所有接收器。我们还提出了一个边界上的停止等待确认,以完成传输的概率至少为$1-ε$,任何$ε>0$的数量。我们目前的分析和数值结果表明,我们的计划优于最优调度策略的广播,在平均完成时间。我们提供了一个简单的启发式计算的编码数据包的数量停止之前发送,达到接近最佳性能的搜索时间大大减少的优势。

英文摘要:

We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receivers to acknowledge the number of degrees of freedom, if any, that are required to decode correctly the information. We study the mean time to complete the transmission of a block of packets to all receivers. We also present a bound on the number of stops to wait for acknowledgement in order to complete transmission with probability at least $1-ε$, for any $ε>0$. We present analysis and numerical results showing that our scheme outperforms optimal scheduling policies for broadcast, in terms of the mean completion time. We provide a simple heuristic to compute the number of coded packets to be sent before stopping that achieves close to optimal performance with the advantage of a considerable reduction in the search time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑