11 22 1926 00 0uhr Challenges To Achieve Low Latency
11 22 1926 00 0uhr Challenges To Achieve Low Latency
11-22/1926r0
Introduction
• The need for deterministic (highly reliable) low latency and high
throughput will only grow for consumer and autonomous applications
• AR/VR/XR, remote work, factory/process automation, robotics, audio/video, …
• Wi-Fi (802.11) needs to support these plus typical IT applications in a converged network
• On the other hand serving deterministic traffic also impacts network’s
ability to serve other traffic.
• This presentation focuses on challenges and directions to address the low
latency requirements of deterministic traffic in next generation 802.11 by
exploiting the known traffic characteristics and scheduling requirements.
“Actuation” “Sensing”
Sensing Actuation
C Client
Motion to Photon
Cycle
Rendering
HMD state Video
Control Cycle: sensing (I/O input), computing (control algorithm) and actuation (I/O output) Motion to Photon Cycle: user tracking, computing (rendering) and display
“Actuation”
(Display) Periodic channel access for large data volumes
10 msec
• We already have tools for improving channel access for predictable traffic like
• Explicit triggering (SU or MU)
• SP reservation (e.g. rTWT/TWT or similar). Moreover, an AP-controlled SP assume triggered access for better efficiency.
• In some scenarios the OTA overhead is too high or prohibitive to meet QoS requirements even with the existing mechanisms (see
next slides), e.g.
• Increased number of channel access attempts because of medium fragmentation caused by frequent r-TWT SPs may
increase overall OTA overhead
• Hence, there is a need to improve signaling and efficient use of allocated resources
Submission Slide 4 Intel Corporation
November 2022 doc.: IEEE 802.11-22/1926r0
• Repetitive channel access cycles can be used to serve both latency sensitive
TF BA and non-latency sensitive traffic
…
SIFS SIFS • Overhead prevents shorter cycles and/or leaves less time to serve other traffic
128µs 16µs 298 µs*
16µs 200µs
(53 µs PHY preamble)
658 µs
• Major sources of overhead:
• Resource allocation (TF and DL MU PPDUs)
Overhead
• Block ack
*256 Bytes at MSC 8, 20 MHz channel, 802.11ax
• PHY Preambles
Submission Slide 5 Intel Corporation
November 2022 doc.: IEEE 802.11-22/1926r0
TF + UL Camera + BA
XR + Video + Voice + BA
TF + XR IMU+ voice + BA
TF + XR IMU + BA
TF +XR IMU + BA
TF +XR IMU + BA
TF + XR IMU
DL Conf Video +
Display + BA
Voice + BA
• Model frame exchanges between STAs and AP using
baseline .11be (single link) signaling
time
used for OFDMA type transmission to minimize number of frame TXOP sequence duration defined by 2ms IMU traffic pattern
exchanges
Each bar represent time necessary to deliver all buffered data for a given traffic stream assuming 1 ms TXOP
Throughput during free times: throughput using SU DL PPDU @ MCS7 during times left after serving all other scheduled traffic
Submission Slide 7 Intel Corporation
November 2022 doc.: IEEE 802.11-22/1926r0
Factory scenario
Factory Scenario
Traffic parameters
Interarrival time
Source/Destination description # of links Frame size, bytes
Camera (ms)
15 Controllers .
.
PLC, UL 15 50 1
.
Camera UL 6 1500 2
Robot control, DL 6 50 2
Worker ArVr DL 2 25000 10
Robot Mobile Robot
ArVr IMU control, UL 2 50 2
1ms Possible medium access pattern
TF + PLC + Sync + BA
TF + PLC + Sync + BA
TF + Camera + BA
TF + PLC + Sync + BA
TF + PLC + AR + BA
TF + PLC + AR + BA
AR/VR Safety Heartbeat
Worker
Robot + BA
ARVr + BA
ARVr + BA
time
UL UL UL DL UL DL UL DL UL
This scenario is a compilation of use cases and requirements for 5G and Wi-Fi:
https://avnu.org/wirelessTSN/
https://5g-acia.org/whitepapers/5g-quality-of-service-for-industrial-automation/ TXOP duration/sequence duration defined by 1ms PLC traffic pattern
Submission Slide 8 Intel Corporation
November 2022 doc.: IEEE 802.11-22/1926r0
Conclusion
• There is a clear need to improve reliability and latency for many applications
• While existing tools enable better control of channel access (i.e. OFDMA TF/
SP allocations/SCS ), they do not take full advantage of known scheduling
requirements from applications, resulting in efficiency/capacity loss for the
overall network
• For example, an AP can use low overhead TF when serving application with known
characteristics (i.e. use same pre-negotiated resources)
BACKUP
References:
https://avnu.org/wirelessTSN/
https://5g-acia.org/whitepapers/5g-quality-of-service-for-industrial-automation/
Submission Slide 12 Intel Corporation
Jan 2019 doc.: IEEE 802.11-19-0065r6
Use
Use cases
cases and requirements
Intra BSS Jitter
(examples)
Packet loss Data rate/
latency/ms variance/ms Mbps
[4]
Real-time gaming [2] <5 <2 < 0.1 % <1
Cloud gaming [15] < 10 <2 Near-lossless <0.1 (Reverse
[1]
link) >5Mbps
(Forward
link)
Each bar represent time necessary to deliver all buffered data for a given traffic stream assuming 2 ms TXOP
Submission Slide 14
November 2022 doc.: IEEE 802.11-22/1926r0
Each bar represent time necessary to deliver all buffered data for a given traffic stream assuming 2 ms TXOP
Submission Slide 15
November 2022 doc.: IEEE 802.11-22/1926r0
Backoff
Frame Second
exchange frame
finishes exchange
before start with same
of next r- allocation R-TWT SP
R-TWT SP start
TWT SP
start
If r-TWT SPs are scheduled more frequently (potentially incl r-TWT SPs of OBSS
in same channel), STAs (incl. APs) respecting start of those SPs would need to stop
their non-LL frame exchanges frequently as well; also SP length could be smaller
=> Ctrl overhead may be high.