Optimal scheduling in a queue with differentiated impatient users

Authors:
Amy Csizmar Dalal;Scott Jordan
Affiliations:
Department of Mathematics and Computer Science, Carleton College, Northfield, MN;Department of Electrical Engineering and Computer Science, University of California, Irvine, CA
Venue:
Performance Evaluation
Year:
2005

Citing 5
Cited 1

Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service

Journal of the ACM (JACM)
Delay analysis of a cellular mobile priority queueing system

IEEE/ACM Transactions on Networking (TON)
A distributed overload control algorithm for delay-bounded call setup

IEEE/ACM Transactions on Networking (TON)
Introduction to Stochastic Dynamic Programming: Probability and Mathematical

Introduction to Stochastic Dynamic Programming: Probability and Mathematical
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines

IEEE Transactions on Computers

Scheduling for end-to-end deadline-constrained traffic with reliability requirements in multihop networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a M/M/1 queue in which the average reward for servicing a job is an exponentially decaying function of the job's sojourn time. The maximum reward and mean service times of a job are i.i.d. and chosen from arbitrary distributions. The scheduler is assumed to know the maximum reward, service rate, and age of each job. We prove that the scheduling policy that maximizes average reward serves the customer with the highest product of potential reward and service rate.