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.
翻译:交通、制造和计算机系统等平行交通系统通常涉及反馈控制(例如动态路由),以确保稳定和改善输送量。这种控制依靠连接的网络部件进行计算和通信。这些部件容易发生随机故障和恶意袭击,促使设计战略防御,在可靠性/安全性故障的情况下,这种系统既能稳定交通,又具有成本效益。在本文中,我们考虑的是具有动态路由的平行排队系统,这种系统可能会发生故障。在可靠性设定方面,我们考虑的是无穷无尽的马可夫决定程序,即系统操作员在每次到达时战略启动基于交通状态的保护机制。我们使用汉密尔顿-雅可比-贝尔曼方程式来显示最佳保护战略是确定性的门槛政策。对于安全环境,我们将模型扩大到攻击者战略性地操纵路线分配的无限偏高的组合游戏。我们发现,这个游戏的完美平衡始终存在,而且两个玩家在每个平衡点上都遵循一个门槛战略。我们用汉密尔顿-贾科比-贝尔曼方方程式来显示最佳保护战略是确定动态/数字序列的稳定性。我们最后的排序。