Dynamic Flow Routing and Scheduling for Time-Critical Network Services

Oct 6, 2025· Xuanli Lin · 1 min read
Abstract
Time-critical applications require network services that meet both traffic demands and delivery deadlines. This talk presents a time-expanded graph model for jointly routing and scheduling flows to maximize the rewards of services completed within their deadlines. It covers a mixed-integer formulation, a linear programming heuristic with sequential rounding, and a static-flow feasibility check that reduces computation.
Date
Oct 6, 2025 — Oct 10, 2025
Event
Location

Los Angeles, California, United States

Los Angeles, CA

event

The dates shown are the conference dates. The individual presentation date and time have not been confirmed.

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.