Computing all the best swap edges distributively

DOI10.1016/j.jpdc.2008.03.002zbMath1243.68055MaRDI QIDQ436830

Linda Pagli, Paola Flocchini, Nicola Santoro, Peter Widmayer, Giuseppe Prencipe

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.03.002

zbMATH Keywords

distributed algorithms; fault-tolerant routing; point of failure rerouting; swap edge

Mathematics Subject Classification ID

68W10: Parallel algorithms in computer science

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

Related Items

Stable routing under the Spanning Tree Protocol, Linear time distributed swap edge algorithms, Faster swap edge computation in minimum diameter spanning trees, Faster Swap Edge Computation in Minimum Diameter Spanning Trees

Cites Work

• Unnamed Item
• Unnamed Item
• The multi-tree approach to reliability in distributed networks
• Swapping a failing edge of a single source shortest paths tree is good and fast
• Single backup table schemes for shortest-path routing
• Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures
• Applications of Path Compression on Balanced Trees
• Sparser: A Paradigm for Running Distributed Algorithms
• Structural Information and Communication Complexity