Substar reliability analysis in star networks

DOI10.1016/j.ins.2007.11.015zbMath1146.68348MaRDI QIDQ924668

Xiaolong Wu, Shahram Latifi

Publication date: 19 May 2008

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.11.015

zbMATH Keywords

partitioning; reliability; star graph; probability fault model; disjoint substar; substar reliability

Mathematics Subject Classification ID

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Edge fault tolerance of super edge connectivity for three families of interconnection networks, Conditional diagnosability and strong diagnosability of split-star networks under the PMC model, Estimating the subsystem reliability of bubblesort networks, Independent spanning trees on even networks, Super \(\lambda_3\)-optimality of regular graphs, Conditional connectivity of star graph networks under embedding restriction, Super \(p\)-restricted edge connectivity of line graphs, Combinatorial analysis of the subsystem reliability of the split-star network, Distance formula and shortest paths for the \((n,k)\)-star graphs, The triangular pyramid: Routing and topological properties, Improving bounds on link failure tolerance of the star graph, Properties of a hierarchical network based on the star graph, On the reliability of alternating group graph-based networks, The reliability analysis of \(k\)-ary \(n\)-cube networks, Researches for more reliable arrangement graphs in multiprocessor computer system, Reliability analysis of subsystem in dual cubes, Subnetwork reliability analysis in \(k\)-ary \(n\)-cubes, Subnetwork reliability analysis of bubble-sort graph networks, Reliability evaluation of subsystem based on exchanged hypercube

Cites Work

• Unnamed Item
• Embedding longest fault-free paths onto star graphs with more vertex faults
• A grid embedding into the star graph for image analysis solutions
• Hyper Hamiltonian laceability on edge fault star graph
• Diagnosability of star graphs under the comparison diagnosis model
• A study of fault tolerance in star graph
• On the fault-diameter of the star graph
• Topological properties of star graphs
• Robustness of star graph network under link failure
• Embedding an arbitrary binary tree into the star graph
• A combinatorial analysis of subcube reliability in hypercubes
• A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
• Hamiltonian-laceability of star graphs
• Distributed Computing - IWDC 2004
• Longest fault-free paths in star graphs with vertex faults