User Tools

Site Tools


Title: Transitory Queues: A New Paradigm in Queueing Theory

Abstract: Queueing theory has mostly focused on the analysis of stationary and ergodic systems. In the last couple of decades there has been progress on analyzing time-varying systems. Here, we make the case that there are systems that existing theory does not address. We identify such systems, demonstrate that discrete event analysis is difficult, if not impossible, and develop well justified approximations to the performance metrics of these models.

We introduce the notion of a transitory queueing model, and develop the population acceleration technique for proving diffusion and fluid approximations to these models. We demonstrate that there are many different models that fit this paradigm, by introducing the Δ(i)/GI/1 queue, a conditioned renewal process queue and a model of queueing with scheduled arrivals that display uncertainty in the realized arrival times.

Speaker: Harsha Honnappa is a 5th year Ph.D. candidate in the Department of Electrical Engineering at USC. His research interests include stochastic networks, applied probability, statistics and game theory/network economics. He is a Ming-Hsieh Scholar for 2013-2014.

transitory_queues-_a_new_paradigm_in_queueing_theory.txt · Last modified: 2016/09/01 19:15 (external edit)