A depth-first search routing algorithm for star graphs and its performance evaluation

DOI10.1016/0895-7177(94)90039-6zbMath0810.68107OpenAlexW2085448620MaRDI QIDQ1328866

Pradip K. Srimani, Sumit Sur

Publication date: 8 August 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(94)90039-6

zbMATH Keywords

fault-tolerant routing algorithmstar graph interconnection network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Parallel concepts in graph theory
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• Dynamically Restructurable Fault-Tolerant Processor Network Architectures
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Performance Analysis of Distributed Routing Strategies Free of Ping-Pong-Type Looping
• On Group Graphs and Their Fault Tolerance
• A group-theoretic model for symmetric interconnection networks
• Adaptive fault-tolerant routing in hypercube multicomputers

This page was built for publication: A depth-first search routing algorithm for star graphs and its performance evaluation