On fault tolerant routings in general networks (Q1089309)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4004073
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On fault tolerant routings in general networks |
scientific article; zbMATH DE number 4004073 |
Statements
On fault tolerant routings in general networks (English)
0 references
1987
0 references
We construct fault-tolerant routings for several families of graphs, including all graphs of maximal degree less than \(cn^{1/3}\) for some \(c>0\). With these routings, the diameter of the surviving graph is bounded by a constant (e.g. 4 or 6), so long as the number of faults is less than the connectivity of the graph. This result partially confirms a conjecture of \textit{D. Dolev, J. Halpern, B. Simons} and \textit{R. Strong} [A new look at fault tolerant network routing, in: Proc. 16th ACM Symp. Theory of Computing, 526-535 (1984)].
0 references
fault-tolerant routings
0 references
diameter of the surviving graph
0 references
connectivity
0 references
0.8888831734657288
0 references
0.888404369354248
0 references
0.8876849412918091
0 references
0.8829732537269592
0 references
0.8768846988677979
0 references
