A Proof of Optimality on EDF Scheduling in Sink-tree Packetized Networks

Abstract

Earliest Deadline First (EDF) scheduling, is known to obtain the optimality of deterministic delay performance upon the single link. However, due to the generality of the network with multiple nodes and multiple flows transmitted within it, the optimal online scheduling is impossible. In this paper, we prove that EDF can still provide the optimal delay performance in a class of practical multiple-nodes-and-multiple-flows network scenarios, such as 5G Cloud VR/AR applications in up-link cases, namely in sink-tree networks multiple flows sharing the root node as the same destination node. The proof uses the delay-based schedulability region to quantify the performance of different scheduling policies. Finally, the proof indicates that EDF can achieve the largest schedulability region in sink-tree networks.