抢占在编码多径通信中的作用
On the Role of Preemption for Timing Metrics in Coded Multipath Communication
摘要：
通信网络中的最近趋势集中在通过诸如延迟或信息年龄（AoI）的定时度量表达的服务质量（QoS）要求上。实现这一点的一种可能方法是编码多路径通信：通过强大的数据包级代码将冗余添加到信息块中，在多个独立信道上传输，以减少阻塞或速率波动的影响。这些链路的数量可以比传统的双路径方案显著增加：在这些场景中，定时度量的优化是不平凡的，并且延迟和AoI可能需要不同的设置。特别地，分组抢占通常是优化未编码通信中的AoI的最佳解决方案，但是可以显著降低各个块的可靠性。在这项工作中，我们的多路径通信模型为fork-join D/M/（K，N）/L队列，其中K块的信息被编码成N>K冗余块。我们推导出延迟和峰值AoI（PAoI）分布的不同值的队列大小L。我们的研究结果表明，抢占并不总是最佳选择，因为在一条路径上丢弃一个迟到的数据包可能会影响整个块的可靠性，并且最小化PAoI会导致延迟性能不佳。
英文摘要：
Recent trends in communication networks have focused on Quality of Service (QoS) requirements expressed through timing metrics such as latency or Age of Information (AoI). A possible way to achieve this is coded multipath communication: redundancy is added to a block of information through a robust packet-level code, transmitting across multiple independent channels to reduce the impact of blockages or rate fluctuation. The number of these links can grow significantly over traditional two-path schemes: in these scenarios, the optimization of the timing metrics is non-trivial, and latency and AoI might require different settings. In particular, packet preemption is often the optimal solution to optimize AoI in uncoded communication, but can significantly reduce the reliability of individual blocks. In this work, we model the multipath communication as a fork-join D/M/(K,N)/L queue, where K blocks of information are encoded into N>K redundant blocks. We derive the latency and Peak AoI (PAoI) distributions for different values of the queue size L. Our results show that preemption is not always the optimal choice, as dropping a late packet on one path might affect the reliability of the whole block, and that minimizing the PAoI leads to poor latency performance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
