具有变化的信道质量和速率自适应的下行链路2流网络编码的鲁棒和最优调度（新的仿真图）
Robust And Optimal Opportunistic Scheduling For Downlink 2-Flow Network Coding With Varying Channel Quality and Rate Adaptation (New Simulation Figures)
摘要：
本文考虑从一个基站到两个不同的客户端的下行链路业务。当假设无限积压时，已知会话间网络编码（INC）可以显著增加吞吐量。然而，相应的调度解决方案（当假设动态到达，而不是需要有限的延迟）仍然是新生的。对于2流下行链路场景，我们提出了第一个机会INC +调度解决方案，该解决方案可证明对于时变信道是最优的，即，相应的稳定区域匹配最优香农容量。具体来说，我们首先介绍了一个新的二进制INC操作，这是明显不同于传统的智慧异或两个偷听到的数据包。然后，我们开发了一个基于长度的调度方案，并证明它，与新的INC操作的帮助下，实现了最佳的稳定区域随时间变化的信道质量。所提出的算法后来被推广到包括速率自适应的能力。仿真结果表明，它再次达到最佳的吞吐量与速率自适应。我们的结果的一个副产品是随机处理网络（SPN）的随机离开，放松了现有的结果中的确定性离开的调度计划。
英文摘要：
This paper considers the downlink traffic from a base station to two different clients. When assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput. However, the corresponding scheduling solution (when assuming dynamic arrivals instead and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, we propose the first opportunistic INC + scheduling solution that is provably optimal for time-varying channels, i.e., the corresponding stability region matches the optimal Shannon capacity. Specifically, we first introduce a new binary INC operation, which is distinctly different from the traditional wisdom of XORing two overheard packets. We then develop a queue-length-based scheduling scheme and prove that it, with the help of the new INC operation, achieves the optimal stability region with time-varying channel quality. The proposed algorithm is later generalized to include the capability of rate adaptation. Simulation results show that it again achieves the optimal throughput with rate adaptation. A byproduct of our results is a scheduling scheme for stochastic processing networks (SPNs) with random departure, which relaxes the of deterministic departure in the existing results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
