Scheduling of Wireless Edge Networks for Feedback-Based Interactive Applications
Samuele Zoppi, Jaya Prakash Champati, James Gross, and Wolfgang, Kellerer

TL;DR
This paper addresses resource scheduling in wireless edge networks for feedback-based interactive applications, proposing policies that minimize delay violations and outperform existing algorithms.
Contribution
It introduces semi-static and dynamic scheduling policies tailored for feedback loops, optimizing end-to-end latency in two-hop wireless networks.
Findings
Semi-static policy achieves near-optimal delay violation probability.
Dynamic policy outperforms state-of-the-art algorithms.
Performance varies with system parameters and queue states.
Abstract
Interactive applications with automated feedback will largely influence the design of future networked infrastructures. In such applications, status information about an environment of interest is captured and forwarded to a compute node, which analyzes the information and generates a feedback message. Timely processing and forwarding must ensure the feedback information to be still applicable; thus, the quality-of-service parameter for such applications is the end-to-end latency over the entire loop. By modelling the communication of a feedback loop as a two-hop network, we address the problem of allocating network resources in order to minimize the delay violation probability (DVP), i.e. the probability of the end-to-end latency exceeding a target value. We investigate the influence of the network queue states along the network path on the performance of semi-static and dynamic…
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.
Taxonomy
TopicsAge of Information Optimization · Advanced Wireless Network Optimization · Wireless Networks and Protocols
