Fault Tolerance of Bubble-sort Networks on Components
摘要
Reliability evaluation of interconnection networks are important to the design and maintenance of multiprocessor systems. The component connectivity is an important measure for the reliability of interconnection networks. The bubble-sort network Bn is a popular underlying topology for distributed systems. The t-component (edge) connectivity κ^t(G)(λ^t(G)) of a graph G=(V,E) is the minimum vertex (edge) number of a set F⊂V such that G−F is not connected and G–F has at least t components. In this paper, we determine the κ^t(Bn) and λ^t(Bn) for small t.
引用本文（GB/T 7714）
L. B. Guo. Fault Tolerance of Bubble-sort Networks on Components[J]. 網際網路技術學刊, 2021.
引文网络
本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。