loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st IEEE Symposium on Reliable Distributed Systems (SRDS'02)
Fault-Local Stabilization: The Shortest Path Tree
Osaka University, Suita, Japan
October 13-October 16
ISBN: 0-7695-1659-9
ASCII Text
x 
 
J Beauquier, T Hérault, "Fault-Local Stabilization: The Shortest Path Tree," Reliable Distributed Systems, IEEE Symposium on, pp. 62, 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/RELDIS.2002.1180174,
author = {J Beauquier and T Hérault},
title = {Fault-Local Stabilization: The Shortest Path Tree},
journal ={Reliable Distributed Systems, IEEE Symposium on},
volume = {0},
year = {2002},
issn = {1060-9857},
pages = {62},
doi = {http://doi.ieeecomputersociety.org/10.1109/RELDIS.2002.1180174},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Reliable Distributed Systems, IEEE Symposium on
TI - Fault-Local Stabilization: The Shortest Path Tree
SN - 1060-9857
SP
EP
A1 - J Beauquier,
A1 - T Hérault,
PY - 2002
KW - null
VL - 0
JA - Reliable Distributed Systems, IEEE Symposium on
ER -
 
J Beauquier, Université Paris XI
T Hérault, Université Paris XI
We present a fault-local solution to the shortest path tree problem in a rooted network. We consider the case where a transient fault corrupts f nodes (f is unknown, but inferior to half the size of the network) after the tree has been constructed. Our solution allows to recover in less than O(f) time units. If an upper bound k on the number of corrupted nodes is known, the memory space needed depends only on k.
Citation:
J Beauquier, T Hérault, "Fault-Local Stabilization: The Shortest Path Tree," srds, pp.62, 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.