Payload-Size and Deadline-Aware Scheduling for Time-critical Cyber Physical Systems
Marcus Haferkamp, Benjamin Sliwa, Christoph Ide, Christian Wietfeld

TL;DR
This paper introduces PayDA, a novel scheduling method for LTE networks that significantly improves latency and deadline compliance for time-critical cyber-physical systems by considering payload size and deadlines.
Contribution
The paper proposes the Payload-Size and Deadline-Aware (PayDA) scheduling approach, demonstrating its effectiveness in reducing latency and deadline misses in LTE simulations.
Findings
Latency reduced by a factor of 20
Mean data rates increased by about 3.5 times
Deadline-Miss-Ratio decreased by about 35%
Abstract
Compared to former mobile networks, Long Term Evolution (LTE) offers higher transfer speeds, significantly lower latencies and a widespread availability, qualifying LTE for a wide range of different applications and services in the field of conventional Human-to-Human (H2H) as well as fast growing Vehicle-To-X (V2X) and Cyber Physical Systems (CPS) communications. As a result, a steady growth of mobile data traffic, which is reflected in an increased interaction between different traffic classes, can be observed. In order to ensure timely transmissions of time-critical data in the future, we propose the novel Payload-Size and Deadline-Aware (PayDA) scheduling approach and compare its performance regarding the compliance for deadlines with those of other common packet scheduling mechanisms. The performance analysis is done with the complex and open-source LTE simulation environment…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
