Abstract The recent trend towards low-latency wireless communication requires a notion of non-ergodic capacity that deals with delays. Significant research has contributed such results for relevant physical layer aspects. Less attention has been paid to actual implementations of link layer automatic repeat request protocols. Instead, error-free transmission using instantaneous channel state information, simple stop-and-wait protocols, or instantaneous feedback are frequently assumed. In this work, we investigate protocols with pipelining that deal with packet errors under non-negligible round-trip-times. We define a stochastic service curve model of a general class of automatic repeat request protocols with pipelining and derive statistical waiting time and sojourn time bounds. We discover two regimes: under low to moderate load retransmissions cause the largest part of the sojourn time, whereas under high load the waiting time dominates the sojourn time. Generally, with increasing round-trip-time the basic cases of stop-and-wait protocols or instantaneous feedback neglect relevant effects and provide less accurate estimates.

中文翻译：

---

带有流水线的自动重复请求协议的统计延迟界限

摘要 低延迟无线通信的最新趋势需要处理延迟的非遍历容量概念。重要的研究为相关的物理层方面贡献了这样的结果。较少关注链路层自动重复请求协议的实际实现。相反，经常假设使用瞬时信道状态信息、简单的停止和等待协议或瞬时反馈的无差错传输。在这项工作中，我们研究了在不可忽略的往返时间下处理数据包错误的流水线协议。我们使用流水线定义了一类通用自动重复请求协议的随机服务曲线模型，并推导出统计等待时间和逗留时间界限。我们发现了两种制度：在低到中等负载下，重传造成了大部分逗留时间，而在高负载下，等待时间支配了逗留时间。通常，随着往返时间的增加，停止等待协议或即时反馈的基本情况会忽略相关影响并提供不太准确的估计。