arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.11530eess.SYcs.GTcs.SYmath.OC
收藏

面向并行服务器系统可靠性与安全故障的成本感知防御

Cost-aware Defense for Parallel Server Systems against Reliability and Security Failures

Qian Xie, Jiayi Wang, Li Jin

AI总结:

针对并行服务器系统的随机故障与恶意攻击,本文用 Markov 决策过程和随机博弈刻画成本感知动态路由防御,证明阈值型最优与均衡策略并验证队列稳定性。

摘要:

交通、制造和计算领域的并行服务器系统严重依赖利用联网信息组件进行计算与通信的动态路由。然而,这些组件仍易受随机故障和恶意攻击影响,因此需要既能稳定流量又具成本效率的容错动态路由。本文考虑一个受可靠性与稳定性故障影响、采用动态路由的并行服务器系统。在可靠性情形下,我们考虑无限时域 Markov 决策过程,系统运营商根据流量状态观测,在每个作业到达时策略性地启动保护机制。基于 HJB 方程的动态规划递归,我们证明存在最优确定性阈值保护策略。在安全情形下,我们将模型扩展为无限时域随机博弈,其中攻击者策略性地操纵路由分配。我们证明,在每个 Markov 完美均衡中,双方均遵循阈值策略。对于两种故障情形,我们还分析了受控流量队列的稳定性。最后,我们开发近似动态规划算法以计算最优/均衡策略,并辅以数值示例和实验进行验证与说明。

英文摘要:

Parallel server systems in transportation, manufacturing, and computing heavily rely on dynamic routing using connected cyber components for computation and communication. Yet, these components remain vulnerable to random malfunctions and malicious attacks, motivating the need for fault-tolerant dynamic routing that are both traffic-stabilizing and cost-efficient. In this paper, we consider a parallel server system with dynamic routing subject to reliability and stability failures. For the reliability setting, we consider an infinite-horizon Markov decision process where the system operator strategically activates protection mechanism upon each job arrival based on traffic state observations. We prove an optimal deterministic threshold protecting policy exists based on dynamic programming recursion of the HJB equation. For the security setting, we extend the model to an infinite-horizon stochastic game where the attacker strategically manipulates routing assignment. We show that both players follow a threshold strategy at every Markov perfect equilibrium. For both failure settings, we also analyze the stability of the traffic queues under control. Finally, we develop approximate dynamic programming algorithms to compute the optimal/equilibrium policies, supplemented with numerical examples and experiments for validation and illustration.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑