NETWORK ROBUSTNESS AND RESIDUAL CLOSENESS

AYTAÇ A., BERBERLER Z. N.

RAIRO-OPERATIONS RESEARCH, vol.52, no.3, pp.839-847, 2018 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 52 Issue: 3
  • Publication Date: 2018
  • Doi Number: 10.1051/ro/2016071
  • Journal Name: RAIRO-OPERATIONS RESEARCH
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.839-847
  • Keywords: Graph vulnerability, closeness, network design and communication, stability, communication network, VULNERABILITY, EFFICIENCY
  • Dokuz Eylül University Affiliated: Yes

Abstract

A central issue in the analysis of complex networks is the assessment of their robustness and vulnerability. A variety of measures have been proposed in the literature to quantify the robustness of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. In this paper, we study the vulnerability of interconnection networks to the failure of individual nodes, using a graph-theoretic concept of residual closeness as a measure of network robustness which provides a much fuller characterization of the network.