An Evaluation of Network Survivability under the Effect of Discounted Defense Levels by Accumulated Experiences of Attackers
Date Issued
2007
Date
2007
Author(s)
Chen, Yi-Tzu
DOI
en-US
Abstract
Internet has become worldwide, publicly accessible network of interconnected computer networks since 1980s. Specifically, it becomes the tools that terrorists can use to attack the nations and their economy. Thus, any network operator could improve the network’s survivability by effectively evaluating the attacker behavior.
As a result, this thesis focuses on the resource allocation of network attack and defense with mathematical programming and graph modeling to optimize the problems, and adopts a concept, discount coupon which is applied in TSP, to represent the attacker behavior of taking advantage of accumulated experiences from his previous attack actions of minimizing the total attack cost. In AEA, the attacker somehow gains some free experiences from a compromised node which could further reduce the cost of an attack. The attacker’s objective is to minimize the total attack cost, while the core node is compromised and the network could not survive. Here, by transforming AEA with node splitting into a generalized shortest path problem and applying the algorithm to optimally solve it. In AAEA, the attacker not only gains some free experiences from a compromised node but could spend different levels of extra expenses, probing fee, gaining different levels of valuable experiences, such as diverse user’s rights or a network topology. Therefore, AAEA is proposed to describe such behavior which is also analyzed as a mixed nonlinear integer programming optimization problem. With node splitting technique, AAEA is transformed into a shortest path problem and is optimally solved by generalized shortest path algorithm.
Subjects
網路攻防
存活度
資源分配
旅行推銷員問題
經驗折扣
圖形理論
節點分裂法
一般化最短路徑
最佳化
Internet Security
Network Attack and Defense
Survivability
Resource Allocation
Traveling Salesman problem (TSP)
Discount Coupon
Graph Modeling
Node Splitting
Generalized Shortest Path Problem
Optimization
SDGs
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-96-R94725054-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):0c0ed3492937f02bd91de3dd5bd461c8