Sigmetrics Achievement Award

Speaker: Bruce Hajek
Professor, University of Illinois, Urbana Champaign

Title: Bounds Implied by Drift and Applications

Abstract: A recurring theme in the design of control schemes for computer communication networks has been to identify the drift of critical quantities such as queue lengths, and then devise control strategies that close the loop. A useful tool for the performance analysis of such strategies are bounds on deviations from the expected trajectory. This talk identifies an incomplete list of such tools that have been used in a broad class of applications, for both stochastic and deterministically constrained models of load.

Bio: Dr. Hajek is Center for Advanced Study Professor of Electrical and Computer Engineering, Professor in the Coordinated Science Laboratory, and Hoeft Chair in Engineering at the University of Illinois at Urbana-Champaign, where he has been on the faculty since 1979. Professor Hajek's research interests include communication networks, stochastic analysis, wireless communications, and auctions. He served as Editor-in-Chief for the IEEE Transactions on Information Theory, and as President of the IEEE Information Theory Society. Dr. Hajek received the IEEE Kobayashi Award for Computer Communication and was elected to the National Academy of Engineering.

Sigmetrics Rising Star Award

Speaker: Jinwoo Shin
Professor, KAIST, Korea

Title: Message Passing Algorithms: Communication, Inference and Optimization

Abstract: Simple, distributed and iterative algorithms have emerged as distributed architectural choices for communication networks and parallel computational tools for large-scale statistical inference or optimization. Despite their simplicity, they have been surprisingly effective. In this talk, I will try to argue in favor of such algorithms in the context of resource allocation (e.g., medium access) in communication networks and statistical inference or optimization (e.g., belief propagation) in Bayesian networks. I will present generic novel frameworks for designing simple, distributed and iterative algorithms solving these network problems. They rely on a common conceptual strategy: identify `efficient' equilibrium pertinent to the problem at hand and design a simple, iterative procedure to achieve it in a computationally efficient manner.

Bio: Jinwoo Shin is an assistant professor at the Department of Electrical Engineering at KAIST, Korea. He obtained the Ph.D. degree from Massachusetts Institute of Technology in 2010. After spending two years at Georgia Institute of Technology and one year at IBM T. J. Watson Research, he started teaching at KAIST in Fall 2013. He received Kennneth C. Sevcik Outstanding Student Paper Award at SIGMETRICS 2009, George M. Sprowls Award 2010 (for Best MIT CS PhD Theses), Best Paper Award at MOBIHOC 2013, Best Publication Award from INFORMS Applied Probability Society 2013 and Bloomberg Scientific Research Award 2015.