Small cluster in cyber physical systems: network topology, interdependence and cascading failures

Huang, Zhen, Wang, Cheng, Nayak, Amiya and Stojmenovic, Ivan 2015, Small cluster in cyber physical systems: network topology, interdependence and cascading failures, IEEE transactions on parallel and distributed systems, vol. 26, no. 8, pp. 2340-2351, doi: 10.1109/TPDS.2014.2342740.

Attached Files
Name Description MIMEType Size Downloads

Title Small cluster in cyber physical systems: network topology, interdependence and cascading failures
Author(s) Huang, Zhen
Wang, Cheng
Nayak, Amiya
Stojmenovic, Ivan
Journal name IEEE transactions on parallel and distributed systems
Volume number 26
Issue number 8
Start page 2340
End page 2351
Total pages 12
Publisher IEEE
Place of publication Piscataway, N.J.
Publication date 2015-08-01
ISSN 1045-9219
Keyword(s) Science & Technology
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Computer Science
Cyber physical systems
Small cluster
Cascading failure
Interdependent networks
Summary In cyber physical system (CPS), computational resources and physical resources are strongly correlated and mutually dependent. Cascading failures occur between coupled networks, cause the system more fragile than single network. Besides widely used metric giant component, we study small cluster (small component) in interdependent networks after cascading failures occur. We first introduce an overview on how small clusters distribute in various single networks. Then we propose a percolation theory based mathematical method to study how small clusters be affected by the interdependence between two coupled networks. We prove that the upper bounds exist for both the fraction and the number of operating small clusters. Without loss of generality, we apply both synthetic network and real network data in simulation to study small clusters under different interdependence models and network topologies. The extensive simulations highlight our findings: except the giant component, considerable proportion of small clusters exists, with the remaining part fragmenting to very tiny pieces or even massive isolated single vertex; no matter how the two networks are tightly coupled, an upper bound exists for the size of small clusters. We also discover that the interdependent small-world networks generally have the highest fractions of operating small clusters. Three attack strategies are compared: Inter Degree Priority Attack, Intra Degree Priority Attack and Random Attack. We observe that the fraction of functioning small clusters keeps stable and is independent from the attack strategies.
Language eng
DOI 10.1109/TPDS.2014.2342740
Field of Research 0805 Distributed Computing
0803 Computer Software
080109 Pattern Recognition and Data Mining
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
ERA Research output type C Journal article
Copyright notice ©2015, IEEE
Persistent URL

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 18 times in TR Web of Science
Scopus Citation Count Cited 22 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 28 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Fri, 11 Mar 2016, 09:46:00 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact