The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Optimal Allocation of Interconnecting Links in Cyber-Physical Systems: Interdependence, Cascading Failures, and Robustness
Open accessAbstract
We consider a cyber-physical system consisting of two interacting networks, i.e., a cyber network overlaying a physical network. It is envisioned that these systems are more vulnerable to attacks since node failures in one network may result in (due to the interdependence) failures in the other network, causing a cascade of failures that would potentially lead to the collapse of the entire infrastructure. The robustness of interdependent systems against this sort of catastrophic failure hinges heavily on the allocation of the (interconnecting) links that connect nodes in one network to nodes in the other network. In this paper, we characterize the optimum inter-link allocation strategy against random attacks in the case where the topology of each individual network is unknown. In particular, we analyze the “regular” allocation strategy that allots exactly the same number of bidirectional internetwork links to all nodes in the system. We show, both analytically and experimentally, that this strategy yields better performance (from a network resilience perspective) compared to all possible strategies, including strategies using random allocation, unidirectional interlinks, etc.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.048701 · Cited by 788
Cited by
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Design Techniques and Applications of Cyberphysical Systems: A Survey
Khaitan, S. K., & McCalley, J. D. (2015) · IEEE Systems Journal · doi:10.1109/jsyst.2014.2322503 · Cited by 784
Contact-based social contagion in multiplex networks
Cozzo, E., Baños, R. A., Meloni, S., & Moreno, Y. (2013) · Physical Review E · doi:10.1103/physreve.88.050801 · Cited by 271
Metadata
- Authors
- Yagan, O., Qian, D., Zhang, J., & Cochran, D.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2012-09
- Volume
- 23
- Issue
- 9
- Pages
- 1708-1720
- ISSN
- 1045-9219 (ISSN-L)
- 1558-2183
- 2161-9883
- OpenAlex
- W2083420849
- Cited by
- 198
- References
- 2
- FWCI
- 12.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.