arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.4128cs.ITcs.NImath.ITmath.OC
收藏

时变信道下基于链路层反馈的有效吞吐量最大化速率自适应

Rate Adaptation via Link-Layer Feedback for Goodput Maximization over a Time-Varying Channel

Rohit Aggarwal, Philip Schniter, C. Emre Koksal

摘要:

我们考虑调整传输速率以最大化有效吞吐量,即,在连续马尔可夫平坦衰落无线信道上无差错传输的数据量。特别是,我们认为发射机信道状态推断从降级的因果错误率反馈,如在自动重传请求(ARQ)系统中的分组级ACK/NAK的计划。在这种方案中,传输速率的选择不仅影响随后的有效吞吐量,而且影响随后的反馈,这意味着最优速率调度是由部分可观测马尔可夫决策过程(POMDP)。由于POMDP的解决方案是计算上不切实际的,我们认为简单的次优贪婪率分配,并表明,最佳方案本身是贪婪的,如果错误率反馈是非退化的。此外,我们表明,贪婪的速率分配使用非退化反馈产生的总有效吞吐量的上限,使用退化反馈的最优速率分配。然后,我们详细的贪婪方案的实施,并提出了一个降低复杂性的贪婪方案,适应传输速率只有一次,每个数据包块。我们还研究了该计划的性能数值,并表明,所提出的贪婪计划实现稳态的有效吞吐量,合理地接近使用非退化反馈计算的有效吞吐量的上限。在存在数据缓冲区的情况下,在稳态有效吞吐量、丢弃率和平均缓冲区占用率方面获得了类似的改进。我们还研究了离散近似的信道的最佳速率分配的性能上界,并表明,这种量化导致可实现的有效吞吐量的显着损失。

英文摘要:

We consider adapting the transmission rate to maximize the goodput, i.e., the amount of data transmitted without error, over a continuous Markov flat-fading wireless channel. In particular, we consider schemes in which transmitter channel state is inferred from degraded causal error-rate feedback, such as packet-level ACK/NAKs in an automatic repeat request (ARQ) system. In such schemes, the choice of transmission rate affects not only the subsequent goodput but also the subsequent feedback, implying that the optimal rate schedule is given by a partially observable Markov decision process (POMDP). Because solution of the POMDP is computationally impractical, we consider simple suboptimal greedy rate assignment and show that the optimal scheme would itself be greedy if the error-rate feedback was non-degraded. Furthermore, we show that greedy rate assignment using non-degraded feedback yields a total goodput that upper bounds that of optimal rate assignment using degraded feedback. We then detail the implementation of the greedy scheme and propose a reduced-complexity greedy scheme that adapts the transmission rate only once per block of packets. We also investigate the performance of the schemes numerically, and show that the proposed greedy scheme achieves steady-state goodputs that are reasonably close to the upper bound on goodput calculated using non-degraded feedback. A similar improvement is obtained in steady-state goodput, drop rate, and average buffer occupancy in the presence of data buffers. We also investigate an upper bound on the performance of optimal rate assignment for a discrete approximation of the channel and show that such quantization leads to a significant loss in achievable goodput.

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

↑