Towards Maximizing Nonlinear Delay Sensitive Rewards in Queuing Systems

11/01/2022
by   Sushmitha Shree S, et al.
0

We consider maximizing the long-term average reward in a single server queue, where the reward obtained for a job is a non-increasing function of its sojourn time. The motivation behind this work comes from multiple applications, including quantum information processing and multimedia streaming. We introduce a new service discipline, shortest predicted sojourn time (SPST), which, in simulations, performs better than well-known disciplines. We also present some limited analytical guarantees for this highly intricate problem.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset