Determining the diagnosability of (1,2)-matching composition networks and its applications

Chia Wei Lee, Sun-Yuan Hsieh

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

The classic problem of determining the diagnosability of a given network has been studied extensively. Under the PMC model, this paper addresses the problem of determining the diagnosability of a class of networks called (1,2)-Matching Composition Networks, each of which is constructed by connecting two graphs via one or two perfect matchings. By applying our results to multiprocessor systems, we can determine the diagnosability of hypercubes, twisted cubes, locally twisted cubes, generalized twisted cubes, recursive circulants G(2n,4) for odd n, folded hypercubes, augmented cubes, crossed cubes, Mbius cubes, and hyper-Petersen networks, all of which belong to the class of (1,2)-matching composition networks.

Original languageEnglish
Article number5730206
Pages (from-to)353-362
Number of pages10
JournalIEEE Transactions on Dependable and Secure Computing
Volume8
Issue number3
DOIs
Publication statusPublished - 2011 Mar 25

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Determining the diagnosability of (1,2)-matching composition networks and its applications'. Together they form a unique fingerprint.

  • Cite this