Abstract
As a generalization of the star graph, the -star graph is one of the most important interconnection networks for parallel and distributed computing system. In this paper, we investigate the fault-tolerant routing problem of -star graphs under the conditional fault assumption (CFA), where all the neighbours of any fault-free node cannot be faulty simultaneously. We show that, under the CFA, the-star graph can tolerate up to faulty nodes, and there is a fault-free path of length at most the diameter of the -star graph plus 6 between any two fault-free nodes.
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.
