Optimal Resource Allocation Strategies Under Collaborative Defense and Collaborative Attack in Multiple Rounds
Date Issued
2014
Date
2014
Author(s)
Chi, Jen-Hua
Abstract
Many corporations and organizations conduct daily business through Internet. With the accumulating population using network, the problems of information security become a critical issue. Nowadays, the problems of network security have been extended from personal to organizational. Furthermore, the attack events bring more threat to business than before. Therefore, it is a significant problems to detect attack preference, prevent attack events and even deter the attackers in advance with limited resources for the corporations. The not only have to deploy the network with defense resources but also allocate resources to the attack event. Furthermore, the defender have to decide whether to repair the compromised nodes or not.
Currently, the most common type of attack is collaborative attack but most of the defender still defend lonely. Therefore, we propose hierarchical collaborative，defense model to increase the defense effect and strengthen the network survivability. However, how to evaluate network survivability efficiently is an important issue. In our research, the Average Degree of Disconnectivity is adopted to measure the network survivability. We further combine the concept of Average DOD with probability. This method is used to evaluate the damage degree of the network. The larger the Average DOD value is, the higher the damage degree of the network. In our scenario, we take two groups of players into account, both of them choose a leader to lead the defense actions or attack actions. In the beginning, the defender does not know where the vulnerabilities are in the network until they encounter attack events. After they face the attack events, the defender begin to repair the network nodes in the next round.
We develop a multi-round network attack-defense scenario and establish a mathematical model to optimize resource allocation and then predict the defender’s network survivability through the Average DOD value. In each round, the players could allocate the resources on the nodes after they update the information about the opponent. Furthermore, they could reallocate the defense resources and repair the compromised nodes. To solve the problem, the method base on subgradient and the exhaustive search would be adopted to find the optimal resources allocation strategies for both groups of players.
Subjects
資訊安全
網路存活度
資源配置
協同攻擊
協同防禦
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-103-R01725022-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):6c6735b5c8c922f49276b72ba6fcaaf8