Abstract
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 scheduling policy that provides excellent results for packets with rewards and deadlines. We prove that the policy is optimal under deterministic service time and binomial reward distribution. In the more general case, we prove that the policy processes the maximal number of packets while collecting rewards higher than the expected reward. We present simulation results that show its high performance in more generic cases compared to the most commonly used scheduling policies.
| Original language | American English |
|---|---|
| Article number | 8471112 |
| Pages (from-to) | 2296-2308 |
| Number of pages | 13 |
| Journal | IEEE/ACM Transactions on Networking |
| Volume | 26 |
| Issue number | 5 |
| DOIs | |
| State | Published - Oct 2018 |
| Externally published | Yes |
Bibliographical note
Funding Information:Manuscript received April 12, 2017; revised March 8, 2018 and August 11, 2018; accepted August 21, 2018; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor A. Ferragut. Date of publication September 24, 2018; date of current version October 15, 2018. This work was supported by the Israeli Innovations Authority as part of the HERON 5G Magnet Consortium and the ISF-NRF Research under Grant 2277/2016. (Corresponding author: Li-On Raviv.) The authors are with the Faculty of Engineering, Bar-Ilan University, Ramat Gan 52900, Israel (e-mail: li.raviv@hotmail.com; leshem.amir2@gmail.com). Digital Object Identifier 10.1109/TNET.2018.2867815
Publisher Copyright:
© 1993-2012 IEEE.
Keywords
- Queues
- deadline
- earliest deadline first
- packet networks
- real time
- renewal reward
- scheduling