Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.14281 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912545121501184 |
|---|---|
| author | Yin, Zhun Li, Xiaotian Mei, Lifan Liu, Yong Jiang, Zhong-Ping |
| author_facet | Yin, Zhun Li, Xiaotian Mei, Lifan Liu, Yong Jiang, Zhong-Ping |
| contents | Routing configurations of a network should constantly adapt to traffic variations to achieve good network performance. Adaptive routing faces two main challenges: 1) how to accurately measure/estimate time-varying traffic matrices? 2) how to control the network and application performance degradation caused by frequent route changes? In this paper, we develop a novel data-enabled predictive traffic engineering (DeeP-TE) algorithm that minimizes the network congestion by gracefully adapting routing configurations over time. Our control algorithm can generate routing updates directly from the historical routing data and the corresponding link rate data, without direct traffic matrix measurement or estimation. Numerical experiments on real network topologies with real traffic matrices demonstrate that the proposed DeeP-TE routing adaptation algorithm can achieve close-to-optimal control effectiveness with significantly lower routing variations than the baseline methods. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_14281 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | DeeP-TE: Data-enabled Predictive Traffic Engineering Yin, Zhun Li, Xiaotian Mei, Lifan Liu, Yong Jiang, Zhong-Ping Networking and Internet Architecture Routing configurations of a network should constantly adapt to traffic variations to achieve good network performance. Adaptive routing faces two main challenges: 1) how to accurately measure/estimate time-varying traffic matrices? 2) how to control the network and application performance degradation caused by frequent route changes? In this paper, we develop a novel data-enabled predictive traffic engineering (DeeP-TE) algorithm that minimizes the network congestion by gracefully adapting routing configurations over time. Our control algorithm can generate routing updates directly from the historical routing data and the corresponding link rate data, without direct traffic matrix measurement or estimation. Numerical experiments on real network topologies with real traffic matrices demonstrate that the proposed DeeP-TE routing adaptation algorithm can achieve close-to-optimal control effectiveness with significantly lower routing variations than the baseline methods. |
| title | DeeP-TE: Data-enabled Predictive Traffic Engineering |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2508.14281 |