메뉴 건너뛰기




Volumn 66, Issue 6, 2002, Pages 4-

Cascade-based attacks on complex networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; DEGREE DISTRIBUTIONS; FINANCIAL MARKETS; HOMOGENEITY;

EID: 41349094978     PISSN: 1063651X     EISSN: None     Source Type: Journal    
DOI: 10.1103/PhysRevE.66.065102     Document Type: Article
Times cited : (1642)

References (36)
  • 10
    • 85036165960 scopus 로고    scopus 로고
    • D. J. Watts, Small Worlds: The Dynamics of Networks Between Order and Randomness (Princeton University Press, Princeton, 1999)
    • D. J. Watts, Small Worlds: The Dynamics of Networks Between Order and Randomness (Princeton University Press, Princeton, 1999).
  • 11
    • 85036325371 scopus 로고    scopus 로고
    • A. P. S. de Moura, Y.-C. Lai, A. E. Motter, and P. Dasgupta (unpublished)
    • A. P. S. de Moura, Y.-C. Lai, A. E. Motter, and P. Dasgupta (unpublished).
  • 14
    • 85036217501 scopus 로고    scopus 로고
    • B. A. Carreras, D. E. Newman, I. Dolrou, and A. B. Poole, in Proceedings of Hawaii International Conference on System Sciences, Maui, Hawaii, 2000 (unpublished)
    • B. A. Carreras, D. E. Newman, I. Dolrou, and A. B. Poole, in Proceedings of Hawaii International Conference on System Sciences, Maui, Hawaii, 2000 (unpublished).
  • 24
    • 85036286632 scopus 로고    scopus 로고
    • A different model and mechanism for overload breakdown in growing networks has been considered by Holme and Kim in Ref. 23. These authors focus on overloads caused by the growth of the network. Their model assigns the same capacity to every node in the network. In their analysis, when a node is overloaded, the links to that node are removed, but the node itself is not removed and can be reconnected in the future. Their conclusion is that, to avoid overloads, the capacity must grow with the size of the network. Our model is different from the model in Ref. 23 as we assume the capacity to be node dependent and the failed nodes to be permanently removed from the network. More importantly, we address the issues of intentional attack and random breakdown, and we study how the network collapses under overload failures induced by them. We assume that the time scale for these events is much smaller than the time scale in which the network grows
    • A different model and mechanism for overload breakdown in growing networks has been considered by Holme and Kim in Ref. 23. These authors focus on overloads caused by the growth of the network. Their model assigns the same capacity to every node in the network. In their analysis, when a node is overloaded, the links to that node are removed, but the node itself is not removed and can be reconnected in the future. Their conclusion is that, to avoid overloads, the capacity must grow with the size of the network. Our model is different from the model in Ref. 23 as we assume the capacity to be node dependent and the failed nodes to be permanently removed from the network. More importantly, we address the issues of intentional attack and random breakdown, and we study how the network collapses under overload failures induced by them. We assume that the time scale for these events is much smaller than the time scale in which the network grows.
  • 28
    • 85036275414 scopus 로고    scopus 로고
    • A.E. Motter, T. Nishikawa, and Y.-C. Lai, Phys. Rev. E (to be published)
    • A.E. Motter, T. Nishikawa, and Y.-C. Lai, Phys. Rev. E (to be published).
  • 30
    • 85036419963 scopus 로고    scopus 로고
    • http://moat.nlanr.net/AS/Data/ASconnlist.20000102.946809601
    • http://moat.nlanr.net/AS/Data/ASconnlist.20000102.946809601
  • 31
    • 85036291650 scopus 로고    scopus 로고
    • ftp://ftp.santafe.edu/pub/duncan/power_unweighted
    • ftp://ftp.santafe.edu/pub/duncan/power_unweighted
  • 33


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.