Optimization of stochastic switching buffer network via DC programming
This letter deals with the optimization problems of stochastic switching buffer networks, where the switching law is governed by Markov process. The dynamical buffer network is introduced, and its application in modeling the car-sharing network is also presented. To address the nonconvexity for getting a solution as close-to-the-global-optimal as possible of the optimization problem, we adopt a succinct but effective nonconvex optimization method called \emph{ DC (difference of convex functions) programming}. By resorting to the log-log convexity of a class of nonlinear functions called posynomials, the optimization problems can be reduced to DC programming problems. Finally, we verify the effectiveness of our results by simulation experiments.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals
We consider a multi-source relaying system where the sources independently and randomly generate status update packets which are sent to the destination with the aid of a bufferaided relay through unreliable links. We fo…
Stochastic OptimizationA Two-stage Identification Method for Switched Linear Systems
In this work, a new two-stage identification method based on dynamic programming and sparsity inducing is proposed for switched linear systems. Our method achieves sparsity inducing in the identification of switched line…
RACE: A Reinforcement Learning Framework for Improved Adaptive Control of NoC Channel Buffers
Network-on-chip (NoC) architectures rely on buffers to store flits to cope with contention for router resources during packet switching. Recently, reversible multi-function channel (RMC) buffers have been proposed to sim…
reinforcement-learningReinforcement Learning (RL)Protecting Neural Networks with Hierarchical Random Switching: Towards Better Robustness-Accuracy Trade-off for Stochastic Defenses
Despite achieving remarkable success in various domains, recent studies have uncovered the vulnerability of deep neural networks to adversarial perturbations, creating concerns on model generalizability and new threats s…
Adversarial RobustnessLogical Stochastic Optimization
We present a logical framework to represent and reason about stochastic optimization problems based on probability answer set programming. This is established by allowing probability optimization aggregates, e.g., minimu…
Stochastic Optimization