Cost-aware defense for parallel server systems against reliability and security failures

DOI10.1016/J.AUTOMATICA.2023.111467arXiv2301.11530OpenAlexW4389637462MaRDI QIDQ6152586FDOQ6152586

Authors: Qian Xie, Jiayi Wang, Li Jin 

Publication date: 13 February 2024

Published in: Automatica (Search for Journal in Brave)

Abstract: Parallel traffic service systems such as transportation, manufacturing, and computer systems typically involve feedback control (e.g., dynamic routing) to ensure stability and to improve throughput. Such control relies on connected cyber components for computation and communication. These components are susceptible to random malfunctions and malicious attacks, which motivates the design of strategic defense that are both traffic-stabilizing and cost-efficient under reliability/security failures. In this paper, we consider a parallel queuing system with dynamic routing subject to such failures. For the reliability setting, we consider an infinite-horizon Markov decision process where the system operator strategically activates the protection mechanism upon each job arrival based on the traffic state. We use Hamilton-Jacobi-Bellman equation to show that the optimal protection strategy is a deterministic threshold policy. For the security setting, we extend the model to an infinite-horizon stochastic game where the attacker strategically manipulates routing assignment. We show that a Markov perfect equilibrium of this game always exists and that both players follow a threshold strategy at each equilibrium. For both settings, we also consider the stability of the traffic queues in the face of failures. Finally, we develop approximate dynamic programming algorithms to compute the optimal/equilibrium policies and present numerical examples for validation and illustration.

Full work available at URL: https://arxiv.org/abs/2301.11530

zbMATH Keywords

HJB equationLyapunov functionMarkov decision processesstochastic gamesqueuing systemscyber-physical security

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15) Computer security (68M25)

Cites Work

• Stochastic Games
• Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes
• A survey of Markov decision models for control of networks of queues
• Game theory meets network security and privacy
• On N-person stochastic games by denumerable state space
• Reinforcement learning. An introduction
• Dynamic programming and optimal control. Vol. 2
• A simple dynamic routing problem
• Input-to-State Stabilizing Control Under Denial-of-Service
• Stability of queueing networks and scheduling policies
• Join the shortest queue: Stability and exact asymptotics
• The shortest queue problem
• Stability and convergence of moments for multiclass queueing networks via fluid limit models
• Optimal control of two interacting service stations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stability of Fluid Queueing Systems With Parallel Servers and Stochastic Capacities
• Routing in queueing networks under imperfect information: stochastic dominance and thresholds
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• A queueing analysis for the denial of service (DoS) attacks in computer networks
• Optimal control of arrivals to queues with delayed queue length information
• Two Parallel Queues with Dynamic Routing
• Stability-constrained Markov decision processes using MPC

This page was built for publication: Cost-aware defense for parallel server systems against reliability and security failures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152586)