Performance evaluation of fault-tolerant routing algorithms: an optimization problem

DOI10.1080/02331939408843955MaRDI QIDQ3835609zbMATH OpenOpenAlexFDO

Authors

Publication date 11 September 1995

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331939408843955

zbMATH Keywords

performance evaluationfuzzy set of solutionsoptimal behaviour of \(N\) processorsshortest paths fault-tolerant distributed algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical algorithms for specific classes of architectures (65Y10)

Recommendations

• Efficient fault-tolerant routings in networks
• A Performance Model of Fault-Tolerant Routing Algorithm in Interconnect Networks
• Algorithms for Fault‐Tolerant Routing in Circuit‐Switched Networks
• An optimal fault-tolerant routing algorithm for double-loop networks
• Optimal fault-tolerant routings for connected graphs
• On fault tolerant routings in general networks
• A fault-tolerant routing scheme in dynamic networks

Cites work

• scientific article; zbMATH DE number 3854137 (Why is no real title available?)
• A correctness proof of a topology information maintenance protocol for a distributed computer network
• Distributed computation on graphs
• Distributed network protocols
• Fuzzy sets

Cited in

(3)

• Performance quality of re-routing networks: influence of equipment failure
• scientific article; zbMATH DE number 1795201 (Why is no real title available?)
• A MDP approach to fault-tolerant routing

This page was built for publication: Performance evaluation of fault-tolerant routing algorithms: an optimization problem

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