Substar Reliability Analysis in Star Networks

Independent spanning trees on even networks

“…The performance of a particular parallel computer is heavily dependent on the graph topology chosen for it. Many graph topologies such as trees, tori, hypercubes, star graphs and even networks have been proposed in the literature [4,6,26,27]. They possess various degrees and diameters.…”

Improving bounds on link failure tolerance of the star graph

“…A treatment of communication aspects for this network is presented in [5,11]. Fault tolerance and reliability of star graphs have also been addressed extensively [7][8][9][10]12,13].…”

The triangular pyramid: Routing and topological properties

“…An interconnection network can be modeled by a graph where a processor is represented by a node, and a communication channel between two processing nodes is represented by an edge between corresponding nodes [1,4,24]. Various topologies for interconnection networks have been proposed in the literature; these include cubic networks (e.g., meshes, tori, k-ary n-cubes, hypercubes, folded cubes, and hypermeshes), hierarchical networks (e.g., pyramids and trees), and recursive networks (e.g., RTCC networks, OTIS or swapped networks, WKrecursive networks, and star graphs) that have been widely studied in the literature for their topological properties [5,[8][9][10][11][12][13]15,18,19,26,27], communication algorithms [3,7,10,11,13,19,21,22,26,29] and popular applications [4,24,14,16,32], embedding capabilities [6,9,23,25,28,29] and reliability and fault-tolerance issues [2,3,7,9,17,20,28,30,…”