Masters Theses

Abstract

"Node and link failures that usually cause limited damage in a single network, may cascade into large scale disasters in the case of interdependent networks, due to the dependencies that exist between them. Recovery from such failures may require multiple stages or steps for complete restoration of connection or flow between them. When critical services are disrupted, the order in which the broken elements are repaired affects the earliest possible recovery time of vital services. In a flow network, one order of restoration may restore more flow at an earlier stage than another. The paper aims to model an efficient recovery process to restore the maximum possible flow at the earliest stage in the event of large scale failure in an interdependent network. The work attempts to identify this restoration order when faced with a fixed budget of resources at each stage. The optimal solution is formulated and its complexity is discussed. This paper compares the performance of the efficient greedy solution with the optimal solution and another sub optimal greedy algorithm"--Abstract, page iii.

Advisor(s)

Silvestri, Simone

Committee Member(s)

Jiang, Wei
Guo, Zhishan

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Sponsor(s)

United States. Defense Threat Reduction Agency

Publisher

Missouri University of Science and Technology

Publication Date

Summer 2017

Pagination

viii, 24 pages

Note about bibliography

Includes bibliographic references (pages 22-23).

Rights

© 2017 Maria Angelin John Bosco, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Thesis Number

T 11173

Electronic OCLC #

1003050614

Share

 
COinS