Near Optimal Network Planning and Defense Resource Allocation Strategies for Minimizing Quality-of-Service (QoS) Violations under Attacks
Date Issued
2008
Date
2008
Author(s)
Hsieh, Tzu-Chen
Abstract
With the convenience of Internet, the problem of information security has caught more and more attentions. Events of witting or unwitting cybercrimes emerge in an endless stream in past years. Among them, to compromise particular servers and then degrade their process capability is one of the most popular cybercrimes in order to further affect the Quality-of-Service (QoS) of the network. For taking precautions against such attacks, we should develop effective defense strategies such as defense resources allocation. Besides, the network planning has to be considered in the realm of information security.n the thesis, we propose a min-max mathematical programming problem to model the mutual behavior between a network administrator and an attacker. In the inner problem, called the ARRAS problem, the attacker would like to maximize the total penalty the administrator has to pay for due to QoS violations by deciding which node to attack and allocating the limited attack budget effectively. In the outer problem, called the NPDRAS problem, the network administrator hopes to minimize the total penalty by planning a well network and allocating defense resources intelligently under a limited budget. For obtaining near optimal solutions, we use the Lagrangean relaxation-based algorithm to solve the ARRAS problem and exploit the solutions of ARRAS problem and the proposed budget adjustment procedure to solve the NPDRAS problem.
Subjects
Information Security
Quality-of-Service
Mathematical Programming
Resource Allocation
Lagrangean Relaxation
Optimization
SDGs
File(s)![Thumbnail Image]()
Loading...
Name
ntu-97-R95725009-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):1ccbf38acd16c32cb4dfb43f32ff8610