Lower-Latency Screen Updates over QUIC with Forward Error Correction
Guardado en:
| Udgivet i: | Future Internet vol. 17, no. 7 (2025), p. 297-322 |
|---|---|
| Hovedforfatter: | |
| Andre forfattere: | |
| Udgivet: |
MDPI AG
|
| Fag: | |
| Online adgang: | Citation/Abstract Full Text + Graphics Full Text - PDF |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3233189543 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1999-5903 | ||
| 024 | 7 | |a 10.3390/fi17070297 |2 doi | |
| 035 | |a 3233189543 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 231464 |2 nlm | ||
| 100 | 1 | |a Eghbal Nooshin | |
| 245 | 1 | |a Lower-Latency Screen Updates over QUIC with Forward Error Correction | |
| 260 | |b MDPI AG |c 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a There are workloads that do not need the total data ordering enforced by the Transmission Control Protocol (TCP). For example, Virtual Network Computing (VNC) has a sequence of pixel-based updates in which the order of rectangles can be relaxed. However, VNC runs over the TCP and can have higher latency due to unnecessary blocking to ensure total ordering. By using Quick UDP Internet Connections (QUIC) as the underlying protocol, we are able to implement a partial order delivery approach, which can be combined with Forward Error Correction (FEC) to reduce data latency. Our earlier work on consistency fences provides a mechanism and semantic foundation for partial ordering. Our new evaluation on the Emulab testbed, with two different synthetic workloads for streaming and non-streaming updates, shows that our partial order and FEC strategy can reduce the blocking time and inter-delivery time of rectangles compared to total delivery. For one workload, partially ordered data with FEC can reduce the 99-percentile message-blocking time to 0.4 ms versus 230 ms with totally ordered data. That workload was with 0.5% packet loss, 100 ms Round-Trip Time (RTT), and 100 Mbps bandwidth. We study the impact of varying the packet-loss rate, RTT, bandwidth, and CCA and demonstrate that partial order and FEC latency improvements grow as we increase packet loss and RTT, especially with the emerging Bottleneck Bandwidth and Round-Trip propagation time (BBR) congestion control algorithm. | |
| 653 | |a Computer & video games | ||
| 653 | |a Control theory | ||
| 653 | |a Control algorithms | ||
| 653 | |a Protocol | ||
| 653 | |a Error correction & detection | ||
| 653 | |a Error correction | ||
| 653 | |a TCP (protocol) | ||
| 653 | |a Network latency | ||
| 653 | |a Workload | ||
| 653 | |a Virtual networks | ||
| 653 | |a Workloads | ||
| 653 | |a Fences | ||
| 653 | |a Semantics | ||
| 653 | |a Bandwidths | ||
| 700 | 1 | |a Lu, Paul | |
| 773 | 0 | |t Future Internet |g vol. 17, no. 7 (2025), p. 297-322 | |
| 786 | 0 | |d ProQuest |t ABI/INFORM Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3233189543/abstract/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text + Graphics |u https://www.proquest.com/docview/3233189543/fulltextwithgraphics/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3233189543/fulltextPDF/embedded/L8HZQI7Z43R0LA5T?source=fedsrch |