A new look at fault-tolerant network routing

DOI10.1016/0890-5401(87)90031-9zbMath0638.68010OpenAlexW2048447277MaRDI QIDQ1099603

H. Raymond Strong, Danny Dolev, Joseph Y. Halpern, Barbara B. Simons

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(87)90031-9

zbMATH Keywords

communication networkfault-tolerant routingsnetwork communication protocol

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items (14)

On fault-tolerant fixed routing in hypercubes ⋮ Fault tolerant routing in the star and pancake interconnection networks ⋮ Efficient fault-tolerant routings in networks ⋮ Large fault-tolerant interconnection networks ⋮ Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs ⋮ Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs ⋮ Uniform multi-hop all-to-all optical routings in rings. ⋮ Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length ⋮ Optimal fault-tolerant routings for connected graphs ⋮ Analysis of minimal path routing schemes in the presence of faults ⋮ Efficient fault-tolerant fixed routings on \((k+1)\)-connected digraphs ⋮ A generalization of hypercubes: Complemented graphs ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Graph theoretical issues in computer networks

Cites Work

• Unnamed Item
• Unnamed Item
• Authenticated Algorithms for Byzantine Agreement
• A Scheme for Fast Parallel Communication
• Diameter bounds for altered graphs

This page was built for publication: A new look at fault-tolerant network routing