Stochastic Throughput Optimization for Two-hop Systems with Finite Relay Buffers
Bo Zhou, Ying Cui, Meixia Tao

TL;DR
This paper develops a threshold-based optimal control policy for a two-hop relay system with finite buffers, maximizing throughput by solving a complex stochastic optimization problem through structural analysis and simplified algorithms.
Contribution
It introduces a novel threshold-based policy for finite-buffer two-hop relays, simplifying the stochastic control problem and deriving a closed-form solution for symmetric cases.
Findings
Optimal policy has a threshold structure.
Reduced complexity static optimization approach.
Closed-form threshold for symmetric systems.
Abstract
Optimal queueing control of multi-hop networks remains a challenging problem even in the simplest scenarios. In this paper, we consider a two-hop half-duplex relaying system with random channel connectivity. The relay is equipped with a finite buffer. We focus on stochastic link selection and transmission rate control to maximize the average system throughput subject to a half-duplex constraint. We formulate this stochastic optimization problem as an infinite horizon average cost Markov decision process (MDP), which is well-known to be a difficult problem. By using sample-path analysis and exploiting the specific problem structure, we first obtain an \emph{equivalent Bellman equation} with reduced state and action spaces. By using \emph{relative value iteration algorithm}, we analyze the properties of the value function of the MDP. Then, we show that the optimal policy has a…
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.
