Abstract
Sequential diagnosis is a more practical approach to fault diagnosis of multicomputer networks, when the diagnosability of one-step diagnosis is bounded by the minimum vertex degree in its interconnection graph. The BC graphs (bijective connection graphs) are a class of newly introduced interconnection topologies, which include hypercubes, twisted cubes, Möbius cubes and crossed cubes, etc. This paper describes a generalized sequential diagnosis algorithm for BC graphs under PMC model. It is shown that BC graphs of n dimensions are Ω(N log log N/log N)-diagnosable, where N = 2n is the total number of nodes of a BC graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
