Algorithms for determining network robustness

Authors:
Heath J. LeBlanc;Xenofon D. Koutsoukos
Affiliations:
Ohio Northern University, Ada, OH, USA;Vanderbilt University, Nashville, TN, USA
Venue:
Proceedings of the 2nd ACM international conference on High confidence networked systems
Year:
2013

Citing 5
Cited 0

Distributed Algorithms

Distributed Algorithms
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Consensus of multi-agent networks in the presence of adversaries using only local information

Proceedings of the 1st international conference on High Confidence Networked Systems
Randomized gossip algorithms

IEEE Transactions on Information Theory
Distributed function calculation and consensus using linear iterative strategies

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study algorithms for determining the robustness of a network. Network robustness is a novel graph theoretic property that provides a measure of redundancy of directed edges between all pairs of nonempty, disjoint subsets of nodes in a graph. The robustness of a graph has been shown recently to be useful for characterizing the class of network topologies in which resilient distributed algorithms that use purely local strategies are able to succeed in the presence of adversary nodes. Therefore, network robustness is a critical property of resilient networked systems. While methods have been given to construct robust networks, algorithms for determining the robustness of a given network have not been explored. This paper introduces several algorithms for determining the robustness of a network, and includes centralized, decentralized, and distributed algorithms.