System recovery after intentional attacks

Many complex networks in the real-world context are found to be scale-free networks. Its structure is found to be generally robust because of its high error tolerance. This means that in most cases, the structure and connectivity of the network is not compromised even when many nodes fail. However,...

Full description

Saved in:
Bibliographic Details
Main Author: Ummi Hani Sahlan
Other Authors: XIAO Gaoxi
Format: Final Year Project
Language:English
Published: Nanyang Technological University 2020
Subjects:
Online Access:https://hdl.handle.net/10356/139853
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-139853
record_format dspace
spelling sg-ntu-dr.10356-1398532023-07-07T18:31:30Z System recovery after intentional attacks Ummi Hani Sahlan XIAO Gaoxi School of Electrical and Electronic Engineering EGXXiao@ntu.edu.sg Engineering::Electrical and electronic engineering Many complex networks in the real-world context are found to be scale-free networks. Its structure is found to be generally robust because of its high error tolerance. This means that in most cases, the structure and connectivity of the network is not compromised even when many nodes fail. However, scale free networks are found to be extremely vulnerable to coordinated attacks. When the attack deliberately disrupts the highly connected nodes in the network, the structure of the network breaks drastically and become fragmented. This paper presents the study of intentional attacks on systems and its recovery. Systems, as with many other networks, has scale-free properties. Intentional attacks refer to a deliberate attack on the system’s hubs instead of a random node. This includes the initial degree attack and the recalculated degree attack. Since the system is highly dependent on such hubs, its failure would result in a single system broken into many smaller fragments of the system. To recover from such attacks, the remaining nodes of the systems must establish new links in hopes to reconnect the fragmented network. This study proposes several recovery techniques and algorithms the system can deploy in the event of intentional attacks. Each recovery technique randomly selects different type of nodes such as global nodes, neighbours, and even two-hop neighbours of the attacked hub. Hence, this study examines which two type of nodes, when connected, would be the most effective solution for the recovery. The performance of these recovery techniques is assessed by comparing the largest cluster size of the resulting network. Bachelor of Engineering (Electrical and Electronic Engineering) 2020-05-22T05:21:40Z 2020-05-22T05:21:40Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/139853 en A3283-191 application/pdf Nanyang Technological University
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Engineering::Electrical and electronic engineering
spellingShingle Engineering::Electrical and electronic engineering
Ummi Hani Sahlan
System recovery after intentional attacks
description Many complex networks in the real-world context are found to be scale-free networks. Its structure is found to be generally robust because of its high error tolerance. This means that in most cases, the structure and connectivity of the network is not compromised even when many nodes fail. However, scale free networks are found to be extremely vulnerable to coordinated attacks. When the attack deliberately disrupts the highly connected nodes in the network, the structure of the network breaks drastically and become fragmented. This paper presents the study of intentional attacks on systems and its recovery. Systems, as with many other networks, has scale-free properties. Intentional attacks refer to a deliberate attack on the system’s hubs instead of a random node. This includes the initial degree attack and the recalculated degree attack. Since the system is highly dependent on such hubs, its failure would result in a single system broken into many smaller fragments of the system. To recover from such attacks, the remaining nodes of the systems must establish new links in hopes to reconnect the fragmented network. This study proposes several recovery techniques and algorithms the system can deploy in the event of intentional attacks. Each recovery technique randomly selects different type of nodes such as global nodes, neighbours, and even two-hop neighbours of the attacked hub. Hence, this study examines which two type of nodes, when connected, would be the most effective solution for the recovery. The performance of these recovery techniques is assessed by comparing the largest cluster size of the resulting network.
author2 XIAO Gaoxi
author_facet XIAO Gaoxi
Ummi Hani Sahlan
format Final Year Project
author Ummi Hani Sahlan
author_sort Ummi Hani Sahlan
title System recovery after intentional attacks
title_short System recovery after intentional attacks
title_full System recovery after intentional attacks
title_fullStr System recovery after intentional attacks
title_full_unstemmed System recovery after intentional attacks
title_sort system recovery after intentional attacks
publisher Nanyang Technological University
publishDate 2020
url https://hdl.handle.net/10356/139853
_version_ 1772826836545306624