Abstract

In this talk, I will discuss the challenge of maintaining the freshness of terminals, like smartphones connecting to a base station. The first part of the talk explores the corresponding offline packet scheduling problem, aiming to minimize the total age of information (AoI). Transitioning to its online counterpart, the second part of the talk focuses on its hidden core: the online job scheduling problem of minimizing the L2 norm of flow times in real-time scenarios. Finally, we will discuss the importance of packet management in AoI minimization.

Bio.

Tung-Wei Kuo received the B.S. degree from National Chiao Tung University, Taiwan, in 2009, and the M.S. and Ph.D. degrees in computer science from National Tsing Hua University, Taiwan, in 2011 and 2015, respectively. He was a postdoctoral fellow with the Research Center for Information Technology Innovation, Academia Sinica, Taiwan from 2015 to 2016. He is now an associate professor in the Department of Computer Science at National Chengchi University, Taiwan. His current research interests include online algorithms and distributed systems.

All faculty and students are welcome to join.