Department of Electrical and Computer Engineering
The Ohio State University
I will overview the methods we have developed on the heavy-traffic analysis of multi-server systems using “Lyapunov-drift conditions”, with applications to routing to parallel servers and wireless scheduling. I will illustrate the extended use of the methodology for a new wireless scheduling strategy that aims to provide regular inter-service times to all the users while also preserving the heavy-traffic optimality of maximum-weight scheduling. I will also present our investigations on the routing problem under overloaded conditions, where the classical tools and performance metrics do not apply. We introduce a new metric of cumulative unused service that enables the sharp distinction of different strategies, and provide an interesting “queue-reversal” argument to analyze its characteristics under the well-known join-the-shortest-queue strategy.
Atilla Eryilmaz received his M.S. and Ph.D. degrees in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign in 2001 and 2005, respectively. Between 2005 and 2007, he worked as a Postdoctoral Associate at the Laboratory for Information and Decision Systems at the Massachusetts Institute of Technology. Since 2007 he has been a faculty at the Ohio State University, where he currently is an Associate Professor of Electrical and Computer Engineering. He served in numerous technical program committees, including IEEE Infocom, ACM MobiHoc, IEEE ISIT, IEEE WiOpt, NetGCOOP, IEEE SDP, IEEE NetCod, and is a TPC co-chair for IEEE WiOpt 2015. His paper with his student received the Best Student Paper Award in WiOpt 2012. His research interests include modeling and optimal control of complex networked systems with applications to wireless communication networks and smart power grids, low-complexity algorithm design and analysis, network pricing and economics. He received the NSF CAREER and Lumley Research Awards in 2010.