BC-DIR: Bandit-Controlled Deadline-Aware Incremental Redundancy for QUIC in V2X Networks

[2608.14593] BC-DIR: Bandit-Controlled Deadline-Aware Incremental Redundancy for QUIC in V2X Networks Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Networking and Internet Architecture arXiv:2608.14593 (cs) [Submitted on 25 Jun 2026] Title: BC-DIR: Bandit-Controlled Deadline-Aware Incremental Redundancy for QUIC in V2X Networks Authors: Weihao Liu , He Sun , Chen-Khong Tham View a PDF of the paper titled BC-DIR: Bandit-Controlled Deadline-Aware Incremental Redundancy for QUIC in V2X Networks, by Weihao Liu and 1 other authors View PDF HTML (experimental) Abstract: Vehicle-to-Everything (V2X) communications require timely and reliable message delivery under highly dynamic wireless conditions. Existing approaches that integrate forward error correction (FEC) into QUIC rely mainly on proactive redundancy and fall back to retransmission once losses exceed the correction capability of the configured code, leading to inefficient recovery under burst loss and unnecessary overhead when network conditions are favorable. This paper presents a Bandit-Controlled Deadline-Aware Incremental Redundancy (BC-DIR) framework for QUIC-based V2X transport. BC-DIR combines rateless coding with a soft decoding deadline and a redundancy margin, enabling repair to be triggered within the available delivery budget while injecting additional repair symbols beyond the immediate deficit to improve recovery under burst loss. A contextual bandit controller further adapts the redundancy configuration online according to end-to-end feedback. We also develop a deadline-constrained reliability analysis under burst loss, showing the advantage of the proposed repair mechanism over conventional retransmission and the existence of an optimal redundancy margin. Monte Carlo simulations validate the analytical results. BC-DIR is implemented in a QUIC-based transport stack and evaluated in Veins/OMNeT++ under both congested urban V2X scenarios and stable network conditions. Experimental results show that, across different traffic congestion levels, BC-DIR improves completion ratio by 10\%--40\% over benchmark schemes in congested V2X scenarios, while under favorable network conditions it can even reduce overhead by about 1\% compared with native QUIC. Subjects: Networking and Internet Architecture (cs.NI) ; Information Theory (cs.IT) Cite as: arXiv:2608.14593 [cs.NI] (or arXiv:2608.14593v1 [cs.NI] for this version) https://doi.org/10.48550/arXiv.2608.14593 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Weihao Liu [ view email ] [v1] Thu, 25 Jun 2026 00:50:53 UTC (1,149 KB) Full-text links: Access Paper: View a PDF of the paper titled BC-DIR: Bandit-Controlled Deadline-Aware Incremental Redundancy for QUIC in V2X Networks, by Weihao Liu and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.NI < prev | next > new | recent | 2026-08 Change to browse by: cs cs.IT math math.IT References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• BC-DIR: Bandit-Controlled Deadline-Aware Incremental Redundancy for QUIC in V2X Networks#610095
• Securing Load Balancing over QUIC#429287
• NETWORK SHAPING FOR PROACTIVE MAINTENANCE#674629
• Experiences Supporting By-Request Circuit-Switched T3 Networks#189828
• FORSLICE: An Automated Formal Framework for Efficient PRB-Allocation towards Slicing Multiple Network Services#2490