

A Logical Topology based Network Compositor for Packet Distribution System with Effective Edge Replacement
Abstract
Keywords
References
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. DistributedComputing (DISC), pp. 268-282, 2007.
M. Bui, F. Butelle, and C. Lavault, “A Distributed Algorithm forConstructing a Minimum Diameter Spanning Tree,” J. Parallel and Distributed Computing, vol. 64, pp. 571-577, 2004.
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.
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.
E. Nardelli, G. Proietti, and P. Widmayer, “Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Rerouting: Computing the Optimal Swap Edges Distributively,” IEICE Transactions.
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.
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
Refbacks
- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution 3.0 License.