[
    {
        "id": "osp-13722",
        "type": "article-journal",
        "title": "Conditional Fault-Diameter of Torus Networks",
        "author": [
            {
                "family": "Touzene",
                "given": "Abderezak"
            },
            {
                "family": "Day",
                "given": "Khaled"
            }
        ],
        "URL": "https://omanscience.com/ar/articles/conditional-fault-diameter-of-torus-networks",
        "language": "en",
        "issued": {
            "date-parts": [
                [
                    2005
                ]
            ]
        },
        "container-title": "Sultan Qaboos University Journal for Science",
        "volume": "10",
        "page": "51",
        "DOI": "10.24200/squjs.vol10iss0pp51-62",
        "publisher": "Sultan Qaboos University",
        "ISSN": "2308-3921",
        "abstract": "We obtain the conditional fault-diameter of the square torus interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). We show that under this condition, the square torus, whose connectivity is 4, can tolerate up to 5 faulty nodes without becoming disconnected. The conditional node connectivity is, therefore, 6. We also show that the conditional fault-diameter of the square torus is equal to the fault-free diameter plus two. With this result the torus joins a group of interconnection networks (including the hypercube and the star-graph) whose conditional fault-diameter has been shown to be only two units over the fault-free diameter. Two fault-tolerant routing algorithms are discussed based on the proposed vertex disjoint paths construction."
    }
]