Applications of Graph Connectivity to Network Security

Ying Liu, Wade Trappe, Andrey Garnaev

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

The performance and resilience of communication networks is intimately tied to their underlying topological structure. Networks whose topological graphs do not exhibit sufficient interconnection are brittle and can be easily broken by network attacks that break links or remove nodes from the network. In this chapter, we explore the notion of network connectivity as quantified by the Fiedler value. We illustrate how it can be used by an adversary to determine locations where to attack a communication network and, conversely, how it can be used by network defense protocols to strengthen the network, thereby providing resilience to network attacks.

Original languageEnglish (US)
Title of host publicationCooperative and Graph Signal Processing
Subtitle of host publicationPrinciples and Applications
PublisherElsevier
Pages445-467
Number of pages23
ISBN (Electronic)9780128136782
ISBN (Print)9780128136775
DOIs
StatePublished - Jun 20 2018

All Science Journal Classification (ASJC) codes

  • Medicine (miscellaneous)

Keywords

  • Connectivity
  • Fiedler value
  • Game theory
  • Resilience

Cite this