Redundancy and Defense Resource Allocation Algorithms to Assure Service Continuity against Natural Disasters and Intelligent Attackers

In this paper, we discuss Redundancy Allocation Problem (RAP) in network environments. By efficiently combining redundancy with extra defense mechanisms, we attempt to ensure the continuity of a network service, and enhance its survivability against malicious attackers that utilize accumulated experience. We construct an attack/defense scenario, in which an attacker and a defender compete against each other, and formulate it as a two-phase nonlinear integer programming problem. We adopt a Lagrange an Relaxation-based solution approach to resolve the above problem, and further prove the efficacy of our approach by computer experiments. The result shows LR-Based attack algorithm is better than other strategies we compared. Further, no matter what kind of attack/defense cost function is adopted, the LR-Based allocation algorithm can always provide a much better defense capability than others.