請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/31960完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 林永松 | |
| dc.contributor.author | Yi-Luen Lin | en |
| dc.contributor.author | 林義倫 | zh_TW |
| dc.date.accessioned | 2021-06-13T03:25:59Z | - |
| dc.date.available | 2007-07-31 | |
| dc.date.copyright | 2006-07-31 | |
| dc.date.issued | 2006 | |
| dc.date.submitted | 2006-07-29 | |
| dc.identifier.citation | [1] http://www.cert.org/stats/cert_stats.html
[2] Simon Hansman, Ray Hunt, “A Taxonomy of Network and Computer Attacks,” Computers and Security, Elsevier, U.K., Vol 24, No 1, 2005, pp31-43. [3] Michael Faloutsos, Petros Faloutsos , and Christos Faloutsos , “On Power-Law Relationships of the Internet Topology,” Computer Communications Review 29, pp. 251-263, 1999. [4] Westmark V. R, “A Definition for Information System Survivability,” in Proceedings of the 37th Hawaii Internal Conference on System Sciences (HICSS'04), Track 9, 2004. [5] Ellison, R. J., R. C. Linger, T. Longstaff, N. R. Mead, “A Case Study in Survivable Network System Analysis,” SEI, Sep 1998. [6] U.S. Department of Commerce, National Telecommunications and Information Administration, Institute for Telecommunications Services, Federal Standard 1037C. [7] Nicol, DM; Sanders, WH; Trivedi, KS, “Model-Based Evaluation: from Dependability to Security”, Dependable and Secure Computing, IEEE Transactions on Volume 1, Issue 1, Jan 2004. [8] J. C. Knight and K. J. Sullivan, “On the definition of survivability,” Technical Report CS-TR-33-00, University of Virginia, Department of Computer Science, 2000. [9] D. Y. Chen, S. Garg, and K. S. Trivedi, “Network Survivability Performance Evaluation: A Quantitative Approach with Applications in Wireless Ad-hoc Networks,” MSWiM’02, page 61-68, September 28, 2002. [10] Molisz, W., “Survivability Function - a Measure of Disaster-Based Routing Performance,” Selected Areas in Communications, IEEE Journal on Volume 22, Issue 9, Nov. 2004 pp. 1876 – 1883. [11] J.C. Knight, K. Sullivan, M.C. Elder, and C. Wang, “Survivability Architectures: Issues and Approaches,” in Proceedings of the DARPA Information Survivability Conference and Exposition, pages 157–171, Los Alamitos, California, January 2000. IEEE Computer Society Press. [12] Erdos, P. & Renyi A., “On the evolution of random graphs,” Publ. Math. Inst. Sci. 5, pp. 17-60, 1960. [13] Albert-Laszlo Barabasi and E. Bonabeau, “Scale-Free Networks,” Scientific American 288, 60-69 (2003). [14] Duncan J. Watts and Steven H. Strogatz, “Collective Dynamics of ‘Small-World’ Networks,” Nature 393, pp. 440-442, 1998. [15] Reka Albert, Hawoong Jeong, and Albert-Laszlo Barabasi, “Diamater of the World Wide Web,” Nature 401, pp. 130-131, 1999. [16] Reka Albert, Hawoong Jeong, and Albert-Laszlo Barabasi, “Error and Attack Tolerance of Complex Networks,” Nature 406, pp. 378-381, 2000. [17] M. L. Fisher, “The Lagrangean Relaxation Method for Solving Integer Programming Problems,” Management Science, Volume 27, Number 1, pp. 1-18, January 1981. [18] M. L. Fisher, “An Application Oriented Guide to Lagrangean Relaxation,” Interfaces, Volume 15, Number 2, pp. 10-21, April 1985. [19] A. M. Geoffrion, “Lagrangean Relaxation and its Use in Integer Programming,” Mathematical Programming Study, Volume 2, pp. 82-114, 1974. [20] M.S. Bazaraa, H.D. Sherali, and C.M. Shetty, “Lagrangian Duality and Saddle Point Optimality Conditions,” Nonlinear Programming: Theory and Algorithms, 2nd Edition, pp. 199-242, John Wiley & Sons, Inc, Singapore, 1993. [21] M. Held, et al., “Validation of subgradient optimization,” Math. Programming, vol. 6, pp. 62-88, 1974. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/31960 | - |
| dc.description.abstract | 隨著近年來網路科技的蓬勃發展，網際網路已成為21世紀最重要的傳播媒體，伴隨而來，資訊安全的議題也越形重要。我們發現，在網路攻防下，攻防雙方都會依據對方的策略而改變自己的對策，就如矛與盾一般地相互抗衡。
在本篇論文中，我們以防守方的角度來思考，在有限的防禦資源限制下，提出一個有效的防禦資源配置策略，來最大化攻擊者的攻擊成本，以提高核心節點的防護能力。分析此問題，為一非線性混合整數規劃的數學最佳化問題，由於問題本身高度的複雜性與困難度，所以我們以格拉蘭日鬆弛法為基礎的演算法來處理此問題，並針對與真實網路環境相似之無尺度網路，進行其存活度分析與探討。 | zh_TW |
| dc.description.abstract | With the rapid growth of network technologies, the Internet may well become the single most important medium of the 21st century. Therefore, the issue of information security has drawn increasing attention. In network attack and defense, attackers and defenders constantly change their respective strategies. The situation is like the balance between a lance and a targe.
In this thesis, we view the problem of security from the defender’s perspective. Given that defense resources are limited, we propose an effective defense resource allocation strategy that maximizes the attackers’ costs, and improves the protection of the core node. The problem is analyzed as a mixed nonlinear integer programming optimization problem. The solution approach is based on the Lagrangean relaxation method, which effectively solves this complicated problem. Furthermore, we evaluate the survivability of real network environment-like scale-free networks. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-13T03:25:59Z (GMT). No. of bitstreams: 1 ntu-95-R93725041-1.pdf: 1144863 bytes, checksum: eccd1d07f23f545920ad9ea0f386033f (MD5) Previous issue date: 2006 | en |
| dc.description.tableofcontents | 謝 詞.......................................................................................................................I
論文摘要....................................................................................................................III THESIS ABSTRACT.................................................................................................V Contents....................................................................................................................VII List of Figures............................................................................................................IX List of Tables..............................................................................................................XI Chapter 1 Introduction................................................................................................1 1.1 Background......................................................................................................1 1.2 Motivation........................................................................................................3 1.3 Literature Survey.............................................................................................4 1.3.1 Survivability..........................................................................................4 1.3.2 Scale-Free Networks.............................................................................7 1.4 Proposed Approach..........................................................................................9 Chapter 2 Problem Formulation..............................................................................11 2.1 Protection Strategy for Defenders (PSD) Model...........................................11 2.1.1 Problem Description and Assumptions...............................................11 2.1.2 Notations.............................................................................................15 2.1.3 Problem Formulation..........................................................................16 2.1.4 Problem Reformulation.......................................................................17 2.2 Probabilistic Protection Strategy for Defenders (PPSD) Model....................18 2.2.1 Problem Description and Assumptions...............................................18 2.2.2 Notations.............................................................................................21 2.2.3 Problem Formulation..........................................................................22 2.2.4 Problem Reformulation.......................................................................23 Chapter 3 Solution Approach...................................................................................25 3.1 Lagrangean Relaxation Method.....................................................................25 3.2 PSD Model.....................................................................................................28 3.2.1 Solution Approach..............................................................................28 3.2.2 Lagrangean Relaxation.......................................................................28 3.2.3 The Dual Problem and the Subgradient Method.................................31 3.2.4 Getting Primal Feasible Solution........................................................32 3.3 PPSD Model...................................................................................................34 3.3.1 Solution Approach..............................................................................34 3.3.2 Lagrangean Relaxation.......................................................................34 3.3.3 The Dual Problem and the Subgradient Method.................................37 3.3.4 Getting Primal Feasible Solution........................................................38 Chapter 4 Computational Experiments...................................................................41 4.1 Computational Experiments on the PSD Model............................................41 4.1.1 Experiment Environments..................................................................41 4.1.2 Experiment Results.............................................................................42 4.2 Computational Experiments on the PPSD Model..........................................46 4.2.1 Experiment Environments..................................................................46 4.2.2 Experiment Results.............................................................................48 Chapter 5 Conclusion................................................................................................63 5-1 Summary........................................................................................................63 5-2 Future Work...................................................................................................64 References...................................................................................................................66 List of Figures Figure 1-1 Trend of Incidents......................................................................................1 Figure 1-2 Attack Tree Example.................................................................................5 Figure 1-3 Random Network Example......................................................................7 Figure 1-4 Scale-Free Network Example...................................................................9 Figure 2-1 Network Attack and Defense Behavior.................................................12 Figure 3-1 Illustration of the Lagrangean Relaxation Method.............................27 Figure 3-2 Procedures of the Lagrangean Relaxation Method..............................28 Figure 4-1 Experiment Results for Grid Networks.................................................43 Figure 4-2 Survivability of Scale-Free Networks....................................................43 Figure 4-3 Experiment Results for Different Network Topologies........................44 Figure 4-4 Average Number of Nodes Must be Compromised Distribution........44 Figure 4-5 Experiment Results for the PPSD Model Scenario 1 in Grid Networks (λ1=0.1, λ2=0.2)............................................................................................................48 Figure 4-6 Survivability of the PPSD Model Scenario 1 in Random Networks (λ1=0.1, λ2=0.2)............................................................................................................48 Figure 4-7 Experiment Results for the PPSD Model Scenario 1 in Different Network Topologies (λ1=0.1, λ2=0.2).........................................................................49 Figure 4-8 Experiment Results for the PPSD Model Scenario 1 in Different Network Topologies (λ1=0.1, λ2=0.4).........................................................................50 Figure 4-9 Experiment Results for the PPSD Model Scenario 1 in Different Network Topologies (λ1=0.2, λ2=0.4).........................................................................50 Figure 4-10 Experiment Results for the PPSD Model Scenario 1 in Different Network Topologies (λ1=0.2, λ2=0.8).........................................................................51 Figure 4-11 Experiment Results for the PPSD Model Scenario 2 in Scale-Free Networks.....................................................................................................................52 Figure 4-12 Survivability of the PPSD Model Scenario 2 in Random Networks.52 Figure 4-13 Experiment Results for the PPSD Model Scenario 2 in Different Network Topologies....................................................................................................52 Figure 5-1 Choke Point Example..............................................................................65 List of Tables Table 2-1 Problem Description of the PSD Model..................................................13 Table 2-2 Problem Assumptions of the PSD Model................................................14 Table 2-3 Problem Description of the PPSD Model................................................19 Table 2-4 Problem Assumptions of the PPSD Model..............................................20 Table 3-1 Heuristic for the PSD Model....................................................................33 Table 3-2 Heuristic for the PPSD Model..................................................................39 Table 4-1 Experimental Parameter Settings for the PSD Model...........................42 Table 4-2 Experiment Results for the PSD Model..................................................45 Table 4-3 Experimental Parameter Settings for the PPSD Model........................47 Table 4-4 Experiment Results for the PPSD Model Scenario 1 (λ1=0.1, λ2=0.2)...53 Table 4-5 Experiment Results for the PPSD Model Scenario 1 (λ1=0.1, λ2=0.3)...54 Table 4-6 Experiment Results for the PPSD Model Scenario 1 (λ1=0.1, λ2=0.4)...55 Table 4-7 Experiment Results for the PPSD Model Scenario 1 (λ1=0.2, λ2=0.4)..56 Table 4-8 Experiment Results for the PPSD Model Scenario 1 (λ1=0.2, λ2=0.6)..57 Table 4-9 Experiment Results for the PPSD Model Scenario 1 (λ1=0.2, λ2=0.8)..58 Table 4-10 Experiment Results for the PPSD Model Scenario 1 (λ1=0.3, λ2=0.5)59 Table 4-11 Experiment Results for the PPSD Model Scenario 1 (λ1=0.3, λ2=0.7)60 Table 4-12 Experiment Results for the PPSD Model Scenario 1 (λ1=0.3, λ2=0.9)61 Table 4-13 Experiment Results for the PPSD Model Scenario 2...........................62 | |
| dc.language.iso | en | |
| dc.subject | 無尺度網路 | zh_TW |
| dc.subject | 防禦資源配置策略 | zh_TW |
| dc.subject | 資訊安全 | zh_TW |
| dc.subject | 網路攻防 | zh_TW |
| dc.subject | 存活度 | zh_TW |
| dc.subject | 拉格蘭日鬆弛法 | zh_TW |
| dc.subject | 最佳化 | zh_TW |
| dc.subject | Optimization | en |
| dc.subject | Scale-Free Networks | en |
| dc.subject | Network Attack and Defense | en |
| dc.subject | Information Security | en |
| dc.subject | Defense Resource Allocation Strategy | en |
| dc.subject | Survivability | en |
| dc.subject | Lagrangean Relaxation Method | en |
| dc.title | 考慮單一核心節點攻擊下
網路近似最佳化防護策略 | zh_TW |
| dc.title | Near Optimal Protection Strategies
against Targeted Attacks on the Core Node of a Network | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 94-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 孫雅麗,林盈達,趙啟超,呂俊賢 | |
| dc.subject.keyword | 防禦資源配置策略,資訊安全,網路攻防,存活度,拉格蘭日鬆弛法,最佳化,無尺度網路, | zh_TW |
| dc.subject.keyword | Defense Resource Allocation Strategy,Information Security,Lagrangean Relaxation Method,Network Attack and Defense,Optimization,Scale-Free Networks,Survivability, | en |
| dc.relation.page | 69 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2006-07-29 | |
| dc.contributor.author-college | 管理學院 | zh_TW |
| dc.contributor.author-dept | 資訊管理學研究所 | zh_TW |
| 顯示於系所單位： | 資訊管理學系 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-95-1.pdf 未授權公開取用 | 1.12 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。