Modern processing systems, such as those that arise in manufacturing, information technology and other service industries, are becoming increasingly complex. Common to these systems is a large number of processing activities, coupled by resource constraints, and the key operational challenge is efficient and timely resource allocation.
We focus on a special but broad class of constrained queueing networks (switched networks) that faithfully capture the fine details of many processing systems. Examples include input-queued switches (the Internet router architecture), data centers, call centers and transportation networks. In this talk, we describe a class of online resource allocation policies, inspired by the classical insensitivity theory for product-form queueing networks, which admits explicit performance bounds. It also achieves optimal delay scaling in a heavy-traffic regime, for a broad class of switched networks, thus settling a long-standing conjecture on delay scaling in input-queued switches.
This is based on joint works with Devavrat Shah, John Tsitsiklis and Neil Walton.
Yuan Zhong is currently an assistant professor in the IEOR Department at Columbia University. Before joining Columbia, he spent one year as a Postdoctoral Scholar in the Computer Science Department at UC Berkeley. He received a Ph.D in Operations Research from MIT in 2012, an M.A in Mathematics from Caltech in 2008, and a B.A. in mathematics from the University of Cambridge in 2006.
Yuan Zhong is broadly interested in the modeling and analysis of large-scale stochastic systems, with business and engineering applications in areas such as Communication Networks, Data Centers, Cloud Computing and Health Care. He is a recipient of the best student paper award at Sigmetrics in 2012.