Strong Reliability of Star Graphs Interconnection Networks

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

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

For interconnection network losing processors, it is considerable to calculate the number of vertices in the maximal component in the surviving network. Moreover, the component connectivity is a significant indicator for reliability of a network in the presence of failing processors. In this article, we first prove that when a set M of at most 3n-7 processors is deleted from an n-star graph, the surviving graph has a large component of size greater or equal to n-|M|-3. We then prove that when a set M of at most 4n-9 processors is deleted from an n-star graph, the surviving graph has a large component of size greater or equal to n!-|M|-5. Finally, we also calculate the r-component connectivity of the n-star graph for 2 ≤q r ≤q 5.

原文English
頁(從 - 到)1241-1254
頁數14
期刊IEEE Transactions on Reliability
71
發行號3
DOIs
出版狀態Published - 2022 9月 1

All Science Journal Classification (ASJC) codes

  • 安全、風險、可靠性和品質
  • 電氣與電子工程

指紋

深入研究「Strong Reliability of Star Graphs Interconnection Networks」主題。共同形成了獨特的指紋。

引用此