Vajanapoom, Korn
(2008)
Risk-based Survivable Network Design.
Doctoral Dissertation, University of Pittsburgh.
(Unpublished)
Abstract
Communication networks are part of the critical infrastructure upon which society and the economy depends; therefore it is crucial for communication networks to survive failures and physical attacks to provide critical services. Survivability techniques are deployed to ensure the functionality of communication networks in the face of failures. The basic approach for designing survivable networks is that given a survivability technique (e.g., link protection, or path protection) the network is designed to survive a set of predefined failures (e.g., all single-link failures) with minimum cost. However, a hidden assumption in this design approach is that the sufficient monetary funds are available to protect all predefined failures, which might not be the case in practice as network operators may have a limited budget for improving network survivability. To overcome this limitation, this dissertation proposed a new approach for designing survivable networks, namely; risk-based survivable network design, which integrates risk analysis techniques into an incremental network design procedure with budget constraints. In the risk-based design approach, the basic design problem considered is that given a working network and a fixed budget, how best to allocate the budget for deploying a survivability technique in different parts of the network based on the risk. The term risk measures two related quantities: the likelihood of failure or attack, and the amount of damage caused by the failure or attack. Various designs with different risk-based design objectives are considered, for example, minimizing the expected damage, minimizing the maximum damage, and minimizing a measure of the variability of damage that could occur in the network. In this dissertation, a design methodology for the proposed risk-based survivable network design approach is presented. The design problems are formulated as Integer Programming (InP) models; and in order to scale the solution of models, some greedy heuristic solution algorithms are developed. Numerical results and analysis illustrating different risk-based designs are presented.
Share
| Citation/Export: |
|
| Social Networking: |
|
Details
| Item Type: |
University of Pittsburgh ETD
|
| Status: |
Unpublished |
| Creators/Authors: |
|
| ETD Committee: |
|
| Date: |
25 September 2008 |
| Date Type: |
Completion |
| Defense Date: |
17 July 2008 |
| Approval Date: |
25 September 2008 |
| Submission Date: |
26 August 2008 |
| Access Restriction: |
5 year -- Restrict access to University of Pittsburgh for a period of 5 years. |
| Institution: |
University of Pittsburgh |
| Schools and Programs: |
School of Information Sciences > Information Science |
| Degree: |
PhD - Doctor of Philosophy |
| Thesis Type: |
Doctoral Dissertation |
| Refereed: |
Yes |
| Uncontrolled Keywords: |
Fault tolerance; Incremental network design; Network survivability; Risk analysis; Cost-benefit analysis; Risk-based survivable network design |
| Other ID: |
http://etd.library.pitt.edu/ETD/available/etd-08262008-170129/, etd-08262008-170129 |
| Date Deposited: |
10 Nov 2011 20:01 |
| Last Modified: |
15 Nov 2016 13:49 |
| URI: |
http://d-scholarship.pitt.edu/id/eprint/9263 |
Metrics
Monthly Views for the past 3 years
Plum Analytics
Actions (login required)
 |
View Item |
![[feed]](/images/feed-icon-32x32.png){kind=icon}