In online service systems, delay experienced by a user from the service request to the service completion is one of the most critical performance metrics. To improve user delay experience, in this paper, we investigate a novel aspect of system design: proactive serving, where the system can predict future user request arrivals and allocate its capacity to serve these upcoming requests proactively. In particular, we investigate the average user delay under proactive serving from a queuing theory perspective. We show that proactive serving reduces the average user delay exponentially (as a function of the prediction window size) under M/M/1 queueing models. Our simulation results show that, for G/G/1 queueing models, the average user delay also decreases significantly under proactive serving.
[1]
Dvir Shabtay,et al.
Scheduling unit length jobs on parallel machines with lookahead information
,
2011,
J. Sched..
[2]
Joel H. Spencer,et al.
Queueing with future information
,
2014,
PERV.
[3]
Ben Coleman.
Quality vs. Performance in Lookahead Scheduling
,
2006,
JCIS.
[4]
Madhu Sudan,et al.
Queuing with future information
,
2012
.
[5]
Atilla Eryilmaz,et al.
Proactive Resource Allocation: Harnessing the Diversity and Multicast Gains
,
2011,
IEEE Transactions on Information Theory.