Robustness of star graph network under link failure

DOI10.1016/J.INS.2007.09.013MaRDI QIDQ2466079zbMATH OpenOpenAlexFDO

Authors Ebrahim Saberinia, Xialong Wu, Shahram Latifi

Publication date 11 January 2008

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

distributed systemsinterconnection networkslink failurepermutationreliabilitystar graph

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Improving bounds on link failure tolerance of the star graph
• A study of fault tolerance in star graph
• Link failure tolerance in the arrangement graphs
• Subnetwork Preclusion of (n,k)-Star Networks
• Fault-tolerance of (n, k)-star networks

Cites work

• A comparative study of job allocation and migration in the pancake network
• A fault-tolerant broadcast scheme in the star graph under the single-port, half-duplex communication model
• A group-theoretic model for symmetric interconnection networks
• A study of fault tolerance in star graph
• Edge-bipancyclicity of star graphs under edge-fault tolerant
• Embedding an arbitrary binary tree into the star graph
• How robust is the n-cube?
• Hyper Hamiltonian laceability on edge fault star graph
• On the fault-diameter of the star graph

Cited in

(23)

• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• Network robustness and random processes
• g-good-neighbor conditional diagnosability of star graph networks under PMC model and MM^* model
• The largest component of faulty star graphs
• A new performance measure for characterizing fault rings in interconnection networks
• Researches for more reliable arrangement graphs in multiprocessor computer system
• Subnetwork preclusion for bubble-sort networks
• Conditional fault tolerance in a class of Cayley graphs
• Diagnosability of star graphs with missing edges
• Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
• Measuring the impact of MVC attack in large complex networks
• The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks
• Link failure tolerance in the arrangement graphs
• The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
• Subnetwork Preclusion of (n,k)-Star Networks
• Robustness of reliability bounds for ( n, k )-star networks
• Fault tolerance in bubble-sort graph networks
• The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
• Substar reliability analysis in star networks
• 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

This page was built for publication: Robustness of star graph network under link failure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2466079)