Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 30th International Teletraffic Congress |
| Subtitle of host publication | ITC 2018 |
| Editors | Eitan Altman, Giuseppe Bianchi, Thomas Zinner |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 10-18 |
| Number of pages | 9 |
| ISBN (electronic) | 9780988304550 |
| Publication status | Published - 15 Oct 2018 |
| Event | 30th International Teletraffic Congress, ITC 2018 - Vienna, Austria Duration: 4 Sept 2018 → 7 Sept 2018 |
Abstract
The recent trend towards low-latency wireless communication requires a notion of non-ergodic capacity that deals with delays. Significant research in areas, such as effective capacity, delay-constrained capacity, and stochastic service curves, has contributed such results for relevant physical layer aspects, like fading processes, interference, and multiple antenna systems. 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, Stochastic Network Calculus
ASJC Scopus subject areas
- Computer Science(all)
- Computer Networks and Communications
- Decision Sciences(all)
- Information Systems and Management
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Proceedings of the 30th International Teletraffic Congress: ITC 2018. ed. / Eitan Altman; Giuseppe Bianchi; Thomas Zinner. Institute of Electrical and Electronics Engineers Inc., 2018. p. 10-18 8493049.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Statistical Delay Bounds for Automatic Repeat Request Protocols with Pipelining
AU - Akselrod, Mark
AU - Fidler, Markus
PY - 2018/10/15
Y1 - 2018/10/15
N2 - The recent trend towards low-latency wireless communication requires a notion of non-ergodic capacity that deals with delays. Significant research in areas, such as effective capacity, delay-constrained capacity, and stochastic service curves, has contributed such results for relevant physical layer aspects, like fading processes, interference, and multiple antenna systems. 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 in areas, such as effective capacity, delay-constrained capacity, and stochastic service curves, has contributed such results for relevant physical layer aspects, like fading processes, interference, and multiple antenna systems. 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
KW - Stochastic Network Calculus
UR - http://www.scopus.com/inward/record.url?scp=85057252149&partnerID=8YFLogxK
U2 - 10.1109/itc30.2018.00011
DO - 10.1109/itc30.2018.00011
M3 - Conference contribution
AN - SCOPUS:85057252149
SP - 10
EP - 18
BT - Proceedings of the 30th International Teletraffic Congress
A2 - Altman, Eitan
A2 - Bianchi, Giuseppe
A2 - Zinner, Thomas
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 30th International Teletraffic Congress, ITC 2018
Y2 - 4 September 2018 through 7 September 2018
ER -