Computing all the best swap edges distributively

DOI10.1016/j.jpdc.2008.03.002zbMath1243.68055OpenAlexW1700848872MaRDI 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 algorithmsfault-tolerant routingpoint of failure reroutingswap edge

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (5)

Stable routing under the Spanning Tree Protocol ⋮ Faster swap edge computation in minimum diameter spanning trees ⋮ Faster Swap Edge Computation in Minimum Diameter Spanning Trees ⋮ A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners ⋮ Linear time distributed swap edge algorithms

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

This page was built for publication: Computing all the best swap edges distributively