scientific article; zbMATH DE number 1760005

MaRDI QIDQ4536928zbMATH OpenFDO

Authors Panagiotis Psycharis, Sotiris E. Nikoletseas, Grammati Pantziou, P. G. Spirakis

Publication date 6 November 2002

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• On the fault tolerance of the butterfly
• On the Fault Tolerance of Some Popular Bounded-Degree Networks
• Efficient fault-tolerant routings in networks
• Fault-Tolerant Circuit-Switching Networks
• Sparse networks tolerating random faults.

Cited in

(8)

• A collision model for randomized routing in fat-tree networks
• On the fault tolerance of the butterfly
• Probabilistic analysis on fault tolerance of E-3DMesh networks based on partitioning strategies
• Fault tolerance and storage reduction in binary search trees
• On the Fault Tolerance of Some Popular Bounded-Degree Networks
• scientific article; zbMATH DE number 1760004 (Why is no real title available?)
• scientific article; zbMATH DE number 913359 (Why is no real title available?)
• Efficient verification of network fault tolerance via counterexample-guided refinement

This page was built for publication:

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