**Please note that this Colloquium has been cancelled**

Speaker: Peter Glynn (Stanford University)
Title: Limit Theorems for Queues in the Presence of Non-renewal Traffic
Date: Friday, December 9, 2016
Time: 3:30-4:30 p.m.
Place: HP 4351 (MacPhail Room), Carleton University

ABSTRACT: Much of the mathematical theory for queues has been developed in a setting in which the arriving traffic is assumed to follow a renewal process or some Markov-modulated variant. In this talk, we discuss how queues behave when the traffic is either â??scheduledâ?? or â??randomly scatteredâ??. A scheduled arrival process is one in which the customers are scheduled to arrive at regularly spaced intervals, but customer-specific behavior induces random perturbations that determine their actual arrival times.

Many service facilities use scheduling to â??even outâ?? their workload over time. The â??random scatteringâ?? model is one that pertains to situations where customers choose their own customer-specific time at which to access a resource, as may occur when visiting a website or downloading a daily update to a server farm. In this talk, we describe various limit theorems associated with such arrival models, including heavy traffic limit theory and large deviations results. This work is joint with Victor Araman, Hong Chen, Harsha Honnappa, and Li Xia.

Short bio :


Leave a Reply

Your email address will not be published. Required fields are marked *