Details
| Original language | English |
|---|---|
| Article number | 102029 |
| Journal | Performance evaluation |
| Volume | 135 |
| Early online date | 26 Aug 2019 |
| Publication status | Published - Nov 2019 |
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.
Keywords
- Automatic repeat request protocols, Performance evaluation, Stochastic network calculus
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Mathematics(all)
- Modelling and Simulation
- Computer Science(all)
- Hardware and Architecture
- Computer Science(all)
- Computer Networks and Communications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Performance evaluation, Vol. 135, 102029, 11.2019.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Statistical delay bounds for automatic repeat request protocols with pipelining
AU - Akselrod, Mark
AU - Fidler, Markus
PY - 2019/11
Y1 - 2019/11
N2 - 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.
AB - 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.
KW - Automatic repeat request protocols
KW - Performance evaluation
KW - Stochastic network calculus
UR - http://www.scopus.com/inward/record.url?scp=85071477211&partnerID=8YFLogxK
U2 - 10.1016/j.peva.2019.102029
DO - 10.1016/j.peva.2019.102029
M3 - Article
AN - SCOPUS:85071477211
VL - 135
JO - Performance evaluation
JF - Performance evaluation
SN - 0166-5316
M1 - 102029
ER -