2018/05/29 by Li-on Raviv, Raviv, Li-on, Amir Leshem +1
Computer Science · Engineering · Mathematics · #Advanced Wireless Network Optimization #Computer network #Computer science #Distributed computing #Economics #FOS: Computer and information sciences #Mathematical optimization #Mathematics #Network Traffic and Congestion Control #Network packet #Networking and Internet Architecture (cs.NI) #Performance (cs.PF) #Queue #Queueing theory #Scheduling (production processes) #Service (business) #Wireless Communication Networks Research #cs.NI #cs.PF
paper · pdf · doi:10.48550/arxiv.1805.11681
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2018/05/29 · arxiv created 2018/08/23 · arxiv updated 2018/08/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we consider a real time queuing system with rewards and deadlines. We assume that 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.