Optimal fault-tolerant routings with small routing tables for k-connected graphs

DOI10.1016/J.JDA.2004.04.009MaRDI QIDQ876733zbMATH OpenOpenAlexFDO

Authors Koichi Wada, Wei Chen

Publication date 26 April 2007

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2004.04.009

zbMATH Keywords

distributed computingdiameterfault tolerancerouting tablefixed routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1696543
• On fault tolerant routings in general networks
• Optimal fault-tolerant routings for connected graphs
• Fault-tolerant routings in a \(\kappa\)-connected network
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• scientific article; zbMATH DE number 1107744 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A new look at fault-tolerant network routing
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• Efficient fault-tolerant routings in networks
• Fault-tolerant routings in a \(\kappa\)-connected network
• New results in graph routing
• On fault tolerant routings in general networks
• Optimal fault-tolerant routings for connected graphs

Cited in

(8)

• Sufficient conditions for protection routing in IP networks
• Fault-Tolerant Compact Routing Schemes for General Graphs
• Acyclic k-connected subgraphs for distributed alternate routing in communications networks
• Fault-tolerant routings in a \(\kappa\)-connected network
• scientific article; zbMATH DE number 1696543 (Why is no real title available?)
• scientific article; zbMATH DE number 1420910 (Why is no real title available?)
• Optimal fault-tolerant routings for connected graphs
• On the total\(_k\)-diameter of connection networks

This page was built for publication: Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs

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