A Novel Measurement for Network Reliability

Limei Lin, Yanze Huang, Dajin Wang, Sun Yuan Hsieh, Li Xu

研究成果: Article同行評審

摘要

The attackers in a network may have a tendency of targeting on a group of clustered nodes, and they hope to avoid the existence of significant large communication groups in the remaining network, such as botnet attack, DDoS attack, and Local Area Network Denial attack. Current various kinds of connectivity do not well reflect the fault tolerance of a network under these attacks. This observation inspires a new measure for network reliability to resist the block attack by taking into account of the dispersity of the remaining nodes. Let GG be a network, C\subset V(G)C⊂V(G) and G[C]G[C] be a connected subgraph. Then CC is called an hh-faulty-block of GG if G-CG-C is disconnected, and every component of G-CG-C has at least h+1h+1 nodes. The minimum cardinality over all hh-faulty-blocks of GG is called hh-faulty-block connectivity of GG, denoted by {FB}\kappa _h(G)FBκh(G). In this article, we determine {FB}\kappa _h(Q_n)FBκh(Qn) for nn-dimensional hypercube Q_nQn (n\geq 4n≥4), a classic interconnection network. We establish that {FB}\kappa _h(Q_n)=(h+2)n-3h-1FBκh(Qn)=(h+2)n-3h-1 for 0\leq h\leq 10≤h≤1, and {FB}\kappa _h(Q_n)=(h+2)n-4h+1FBκh(Qn)=(h+2)n-4h+1 for 2\leq h\leq n-22≤h≤n-2, respectively. Larger hh-faulty-block connectivity implies that an attacker will have to stage an attack to a bigger block of connected nodes, so that each remaining components will not be too small, which will in turn limit the size of large components. In other words, there will not be great disparity in sizes between any two remaining components, and hence there will less likely be a significantly large remaining communication group. The larger the hh-faulty-block, the more difficult for an attacker to achieve that goal. As a consequence, the resistance of the network against the attacker will increase. Our experiments also show that as hh increases, the hh-faulty-block gets larger, and the size disparity between any two remaining components decreases. In turn, as expected, the size of the largest remaining communication group becomes smaller.

原文English
文章編號9194366
頁(從 - 到)1719-1731
頁數13
期刊IEEE Transactions on Computers
70
發行號10
DOIs
出版狀態Published - 2021 十月 1

All Science Journal Classification (ASJC) codes

  • 軟體
  • 理論電腦科學
  • 硬體和架構
  • 計算機理論與數學

指紋

深入研究「A Novel Measurement for Network Reliability」主題。共同形成了獨特的指紋。

引用此