Publication 2011 Issue No. 1 - January-February Abstract - A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Beat Gfeller Articles by Nicola Santoro Articles by Peter Widmayer
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree
January-February 2011 (vol. 8 no. 1)
pp. 1-12
 ASCII Text x Beat Gfeller, Nicola Santoro, Peter Widmayer, "A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree," IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 1, pp. 1-12, January-February, 2011.
 BibTex x @article{ 10.1109/TDSC.2009.17,author = {Beat Gfeller and Nicola Santoro and Peter Widmayer},title = {A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree},journal ={IEEE Transactions on Dependable and Secure Computing},volume = {8},number = {1},issn = {1545-5971},year = {2011},pages = {1-12},doi = {http://doi.ieeecomputersociety.org/10.1109/TDSC.2009.17},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Dependable and Secure ComputingTI - A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning TreeIS - 1SN - 1545-5971SP1EP12EPD - 1-12A1 - Beat Gfeller, A1 - Nicola Santoro, A1 - Peter Widmayer, PY - 2011KW - Fault-tolerant routingKW - swap edgesKW - minimum-diameter spanning treeKW - distributed algorithms.VL - 8JA - IEEE Transactions on Dependable and Secure ComputingER -
Beat Gfeller, ETH Zurich, Zurich
Nicola Santoro, Carleton University, Ottawa
Peter Widmayer, ETH Zurich, Zurich

[1] B. Gfeller, N. Santoro, and P. Widmayer, "A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree," Proc. 21st Int'l Symp. Distributed Computing (DISC), pp. 268-282, 2007.
[2] M. Bui, F. Butelle, and C. Lavault, "A Distributed Algorithm for Constructing a Minimum Diameter Spanning Tree," J. Parallel and Distributed Computing, vol. 64, pp. 571-577, 2004.
[3] H. Ito, K. Iwama, Y. Okabe, and T. Yoshihiro, "Single Backup Table Schemes for Shortest-Path Routing," Theoretical Computer Science, vol. 333, no. 3, pp. 347-353, 2005.
[4] E. Nardelli, G. Proietti, and P. Widmayer, "Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures," J. Graph Algorithms and Applications, vol. 5, no. 5, pp. 39-57, 2001.
[5] E. Nardelli, G. Proietti, and P. Widmayer, "Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast," Algorithmica, vol. 35, no. 1, pp. 56-74, 2003.
[6] A.D. Salvo and G. Proietti, "Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor," Theoretical Computer Science, vol. 383, no. 1, pp. 23-33, 2007.
[7] P. Flocchini, A. Mesa Enriques, L. Pagli, G. Prencipe, and N. Santoro, "Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively," IEICE Trans. Information and Systems, vol. E89-D, no. 2, pp. 700-708, 2006.
[8] P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, and P. Widmayer, "Computing All the Best Swap Edges Distributively," J. Parallel and Distributed Computing, vol. 68, no. 7, pp. 976-983, 2008.
[9] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays $\cdot$ Trees $\cdot$ Hypercubes. Morgan Kaufmann Publishers, Inc., 1992.
[10] N. Santoro, Design and Analysis of Distributed Algorithms, Wiley, 2007.
[11] N. Santoro and R. Khatib, "Labelling and Implicit Routing in Networks," The Computer Journal, vol. 28, no. 1, pp. 5-8, 1985.
[12] M. Thorup and U. Zwick, "Compact Routing Schemes," Proc. 13th Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '01), pp. 1-10, 2001.

Index Terms:
Fault-tolerant routing, swap edges, minimum-diameter spanning tree, distributed algorithms.
Citation:
Beat Gfeller, Nicola Santoro, Peter Widmayer, "A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree," IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 1, pp. 1-12, Jan.-Feb. 2011, doi:10.1109/TDSC.2009.17