AEGIS: Throughput-Guaranteed Resilient Routing via a Conditional Value-at-Risk Approach

Apr 16, 2026· Zhaofeng Zhang , Xuanli Lin , Guoliang Xue , Kevin S. Chan · 1 min read
Summary
AEGIS guarantees required throughput during normal operation while reducing the risk of throughput loss under network failures, without precomputing routing paths. It reformulates conditional value-at-risk optimization as a linear program and uses bisection to obtain acyclic routing with more efficient resource use. Numerical evaluations compare the resulting routing trade-offs.
Type
Publication
IEEE Transactions on Networking, 34, 4929-4943. IEEE
publication

Abstract

The past decade has witnessed significant progress in next-generation wireless networks. Resilient routing is essential for maintaining reliability in mission-critical network services, particularly in dynamic and adversarial environments. Traditional traffic engineering (TE) approaches rely on pre-computed paths. Still, they face performance limitations when the number of pre-computed paths is small and scalability challenges when the number is large. This study seeks to answer the fundamental question: “How can we achieve throughput-guaranteed resilient routing under network failures without pre-computing routing paths?” We propose AEGIS, a novel throughput-guaranteed resilient routing scheme leveraging a conditional value-at-risk (CVaR) approach, which proactively guarantees the required throughput under normal conditions and enables recovery during network failures. Specifically, we propose an optimization problem that minimizes the CVaR of total throughput loss across all the failure situations while respecting user budget and network constraints. The above optimization problem is non-differentiable and non-linear; we then reformulate it as an equivalent linear program (LP) and develop an optimal solution. However, the above solution will induce cyclic flows due to resource reservation behaviors. To achieve a more resource-efficient routing, we propose a bisection approach to obtain a CVaR upper bound so that the corresponding routing is acyclic. Extensive numerical evaluations demonstrate the trade-offs among various approaches and highlight the advantages of AEGIS.

Xuanli Lin
Authors
PhD Student in Computer Science

Xuanli Lin is a fifth-year PhD student in the Computer Science department at Arizona State University, supervised by Dr. Guoliang Xue.

His research interests include network optimization, network security, artificial intelligence, and the Internet of Things.

Guoliang Xue
Authors
Professor of Computer Science and Engineering
Guoliang Xue is a professor in Arizona State University’s School of Computing and Augmented Intelligence and an IEEE Fellow. He investigates wireless and quantum networks, network security and privacy, and optimization. He earned his PhD in computer science from the University of Minnesota in 1991. His honors include the IEEE Communications Society’s 2019 William R. Bennett Prize, and he chaired the IEEE INFOCOM Steering Committee from 2020 through 2025.
Kevin S. Chan
Authors
Lead Research Electronics Engineer
Kevin S. Chan is a lead research electronics engineer and Network Science Team Lead at the U.S. Army DEVCOM Army Research Laboratory. His research spans network science, edge computing, and cybersecurity. He holds a bachelor’s degree from Carnegie Mellon University and master’s and doctoral degrees in electrical and computer engineering from Georgia Tech. He received the IEEE Communications Society’s Leonard G. Abraham Prize in 2021.