|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Twenty-Fifth International Symposium on Fault-Tolerant Computing
Optimal Resiliency Against Mobile Faults
Pasadena, California
June 27-June 30
ISBN: 0-8186-7079-7
| ASCII Text | x | ||
| H. Buhrman, J.A. Garay, J.-H. Hoepman, "Optimal Resiliency Against Mobile Faults," Fault-Tolerant Computing, International Symposium on, pp. 0083, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995. | |||
| BibTex | x | ||
| @article{ 10.1109/FTCS.1995.466995, author = {H. Buhrman and J.A. Garay and J.-H. Hoepman}, title = {Optimal Resiliency Against Mobile Faults}, journal ={Fault-Tolerant Computing, International Symposium on}, volume = {0}, year = {1995}, isbn = {0-8186-7079-7}, pages = {0083}, doi = {http://doi.ieeecomputersociety.org/10.1109/FTCS.1995.466995}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Fault-Tolerant Computing, International Symposium on TI - Optimal Resiliency Against Mobile Faults SN - 0-8186-7079-7 SP EP A1 - H. Buhrman, A1 - J.A. Garay, A1 - J.-H. Hoepman, PY - 1995 KW - fault tolerant computing; reliability; computer network reliability; protocols; optimal resiliency; mobile faults; malicious agents; mobile fault models; roaming pace; classical testbed problem; fault tolerant distributed computing; Byzantine agreement; protocol; running time VL - 0 JA - Fault-Tolerant Computing, International Symposium on ER - | |||
Abstract: We consider a model where malicious agents can corrupt hosts and move around in a network of processors. We consider a family of mobile fault models MF(t/n-1,/spl rho/). In MF(t/n-1,/spl rho/) there are a total of n processors, the maximum number of mobile faults is t, and their roaming pace is /spl rho/ (for example, /spl rho/=3 means that it takes an agent at least 3 rounds to "hop" to the next host). We study in these models the classical testbed problem for fault tolerant distributed computing: Byzantine agreement. It has been shown that if /spl rho/=1, then agreement cannot be reached in the presence of even one fault, unless one of the processors remains uncorrupted for a certain amount of time. Subject to this proviso, we present a protocol for MF(/sup 1///sub 3/,1), which is optimal. The running time of the protocol is O(n) rounds, also optimal for these models.
Index Terms:
fault tolerant computing; reliability; computer network reliability; protocols; optimal resiliency; mobile faults; malicious agents; mobile fault models; roaming pace; classical testbed problem; fault tolerant distributed computing; Byzantine agreement; protocol; running time
Citation:
H. Buhrman, J.A. Garay, J.-H. Hoepman, "Optimal Resiliency Against Mobile Faults," ftcs, pp.0083, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995
Usage of this product signifies your acceptance of the Terms of Use.