Fault Tolerance of Bubble-sort Networks on Components

Litao Guo,

Abstract


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.


Citation Format:
Litao Guo, "Fault Tolerance of Bubble-sort Networks on Components," Journal of Internet Technology, vol. 22, no. 3 , pp. 637-643, May. 2021.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.




Published by Executive Committee, Taiwan Academic Network, Ministry of Education, Taipei, Taiwan, R.O.C
JIT Editorial Office, Office of Library and Information Services, National Dong Hwa University
No. 1, Sec. 2, Da Hsueh Rd., Shoufeng, Hualien 974301, Taiwan, R.O.C.
Tel: +886-3-931-7314　　E-mail: jit.editorial@gmail.com