DDR: A Deadline-Driven Routing Protocol for Delay Guaranteed Service
Pu Yang, Tianfang Chang, Lin Cai
Abstract
Time-sensitive applications have become increasingly prevalent in modern networks, necessitating the development of Delay-Guaranteed Routing (DGR) solutions. Finding an optimal DGR solution remains a challenging task due to the NP-hard nature of the problem and the dynamic nature of network traffic. In this paper, we propose Deadline-Driven Routing (DDR), a distributed traffic-aware adaptive routing protocol that addresses the DGR problem. Inspired by online navigation techniques, DDR leverages real-time traffic conditions to optimize routing decisions and ensure on-time packet delivery. By combining network topology-based path generation with real-time traffic knowledge, each router can adjust packet forwarding directions to meet its heterogeneous latency requirements. Comprehensive simulations on real-world network topologies demonstrate that DDR can consistently provide delay-guaranteed service in different network topologies with varying traffic conditions. In addition, DDR ensures backward compatibility with legacy devices and existing routing protocols, making it a viable solution for supporting delay-guaranteed service.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ba2e7de9-9936-4a2d-80ba-323d1bf95381Builds on4
- PLB: congestion signals are simple and effective for network load balancingMubashir Adnan Qureshi, Yuchung Cheng, Qianwen Yin, Qiaobin Fu et al.SIGCOMM 2022 · 82 citations
- LiveNet: a low-latency video transport network for large-scale live streamingJinyang Li, Zhenyu Li, Ri Lu, Kai Xiao et al.SIGCOMM 2022 · 59 citations
- Genet: automatic curriculum generation for learning adaptation in networkingZhengxu Xia, Yajie Zhou, Francis Y. Yan, Junchen JiangSIGCOMM 2022 · 57 citations
- Hop-by-Hop Multipath Routing: Choosing the Right Nexthop SetKlaus Schneider, Beichuan Zhang, Lotfi BenmohamedINFOCOM 2020 · 25 citations
Related papers
- DRL-OR: Deep Reinforcement Learning-based Online Routing for Multi-type Service RequirementsChenyi Liu, Mingwei Xu, Yuan Yang, Nan GengINFOCOM 2021 · 85 citations
- LARRI: Learning-based Adaptive Range Routing for Highly Dynamic Traffic in WANsMinghao Ye, Junjie Zhang, Zehua Guo, H. Jonathan ChaoINFOCOM 2023 · 15 citations
- Hard-Real-Time Routing in Probabilistic Graphs to Minimize Expected DelayKunal Agrawal, Sanjoy K. Baruah, Zhishan Guo, Jing Li et al.RTSS 2020 · 7 citations
- Optimizing Quantum Assignment for DRR in TSN: A Network Calculus-Based MethodAnlan Xie, Feng He, Luxi ZhaoRTSS 2024 · 2 citations
- On the Power of Randomization for Scheduling Real-Time Traffic in Wireless NetworksChristos Tsanikidis, Javad GhaderiINFOCOM 2020 · 24 citations
