On the total_k-diameter of connection networks

DOI10.1016/S0304-3975(98)00348-XMaRDI QIDQ1583253zbMATH OpenOpenAlexFDO

Authors Tamar Eilam, Shlomo Moran, Shmuel Zaks, Yefim Dinitz

Publication date 26 October 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(98)00348-x

zbMATH Keywords

communication networkconnection networkedge-disjoint pathsflow in networkstotal-diametertotal-distance

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fault-tolerant routings in a -connected network
• Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs
• Optimal fault-tolerant routings with small routing tables for k-connected graphs
• scientific article; zbMATH DE number 1696543
• Fault-tolerant diameter for three family interconnection networks

Cites work

• 2-diameter of de Bruijn graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Hop-Congestion Trade-Offs for High-Speed Networks
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 139788 (Why is no real title available?)
• Message complexity versus space complexity in fault tolerant broadcast protocols
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs

Cited in

(2)

• Exact communication costs for consensus and leader in a tree
• ON THE SIZE OF LINKS IN K_{n, n}, K_{n, n, 1}, AND K_n

This page was built for publication: On the total\(_k\)-diameter of connection networks

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