AbstractWe introduce the concept of fault diameter of interconnection networks. The motivation is to estimate the degradation of performance under maximally fault conditions. We derive fault diameter of specific classes of commonly used interconnection networks and various types of product graphs
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
Data center networks (DCNs) are inherently failure-prone owing to the existence of many links, switc...
An important problem in fault diagnosis is how to locate faulty components by analysing performance ...
AbstractWe introduce the concept of fault diameter of interconnection networks. The motivation is to...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
The diameter of a network in the presence of faulty nodes is an important indicator of its resilienc...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
Abstract. An important issue in computer communication networks is fault-tolerant routing. A popular...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
For routing problems in interconnection networks it is important to find the shortest containers bet...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
Many graphs such as hypercubes, star graphs, pancake graphs, grid, torus etc are known to be good in...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
Data center networks (DCNs) are inherently failure-prone owing to the existence of many links, switc...
An important problem in fault diagnosis is how to locate faulty components by analysing performance ...
AbstractWe introduce the concept of fault diameter of interconnection networks. The motivation is to...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
The diameter of a network in the presence of faulty nodes is an important indicator of its resilienc...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
Abstract. An important issue in computer communication networks is fault-tolerant routing. A popular...
As links and nodes of interconnection networks are exposed to failures, one of the most important fe...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
For routing problems in interconnection networks it is important to find the shortest containers bet...
We obtain the conditional fault-diameter of the square torus interconnection network under the condi...
Many graphs such as hypercubes, star graphs, pancake graphs, grid, torus etc are known to be good in...
We derive the fault-diameter of the star graph using a combinatorial method, thereby resting the pre...
AbstractLet G be a k-connected graph and Dc(G) denote the maximum diameter of G after deleting any o...
Data center networks (DCNs) are inherently failure-prone owing to the existence of many links, switc...
An important problem in fault diagnosis is how to locate faulty components by analysing performance ...
DOI
Add to ORKG