On the probability of facing random breakdowns: a measure of networks’ vulnerability

DOI10.1080/00207160.2015.1045296zbMath1342.05006OpenAlexW2080602161MaRDI QIDQ5739597

Hamidreza Sotoodeh, Farshad Safaei

Publication date: 19 July 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2015.1045296

zbMATH Keywords

performance evaluationfault toleranceinterconnection networksnetwork theorynetwork vulnerabilityant colonyP2P networks

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Robustness on topology reconfiguration of complex networks: an entropic approach

Uses Software

• NodeXL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effective measurement of network vulnerability under random and intentional attacks
• Efficiency of scale-free networks: Error and attack tolerance
• A new performance measure for characterizing fault rings in interconnection networks
• Resilience and reliability analysis of P2P network systems
• Ant colony optimization theory: a survey
• A NODE-BASED MULTISCALE VULNERABILITY OF COMPLEX NETWORKS
• Multiscale vulnerability of complex networks
• On reliability of graphs with node failures
• The Structure and Function of Complex Networks
• ( ψ , p , q ) -vulnerabilities: A unified approach to network robustness

This page was built for publication: On the probability of facing random breakdowns: a measure of networks’ vulnerability