Maximizing Service Reward for Queues With Deadlines
Maximizing Service Reward for Queues With Deadlines
In this paper, we consider a real-time queuing system with rewards and deadlines. We assume that the packet processing time is known upon arrival, as is the case in communication networks. This assumption allows us to demonstrate that the well-known earliest-deadline-first policy performance can be improved. We then propose a …