Structured Reinforcement Learning For Media Streaming At The Wireless Edge

Abstract

Media streaming is the dominant application over wireless edge (access) networks. The increasing softwarization of such networks has led to efforts at intelligent control, wherein application-specific actions may be dynamically taken to enhance the user experience. The goal of this work is to develop and demonstrate learning-based policies for optimal decision making to determine which clients to dynamically prioritize in a video streaming setting. We formulate the policy design question as a constrained Markov decision problem (CMDP), and observe that by using a Lagrangian relaxation we can decompose it into single-client problems. Further, the optimal policy takes a threshold form in the video buffer length, which enables us to design an efficient constrained reinforcement learning (CRL) algorithm to learn it. Specifically, we show that a natural policy gradient (NPG) based algorithm that is derived using the structure of our problem converges to the globally optimal policy. We then

Stats

• citations2
• S2 citations—
• github stars0
• HF likes0
• heat score3.58
• arxiv keybura2024structured

Related papers

• Fairstream: Fair Multimedia Streaming Benchmark For Reinforcement Learning Agents (2024)0.00
• Implications Of Decentralized Q-learning Resource Allocation In Wireless Networks (2017)0.00
• Offline Reinforcement Learning For Wireless Network Optimization With Mixture Datasets (2023)9.59
• Cooperative Multi-agent Reinforcement Learning For Low-level Wireless Communication (2018)0.00
• A Reinforcement Learning Approach For The Multichannel Rendezvous Problem (2019)7.16
• Reinforcement Learning For Datacenter Congestion Control (2021)0.00
• Deep Reinforcement Learning For Distributed And Uncoordinated Cognitive Radios Resource Allocation (2022)0.00
• Dynamic Channel Access Via Meta-reinforcement Learning (2021)5.84