Computing all the best swap edges distributively

DOI10.1016/J.JPDC.2008.03.002MaRDI QIDQ436830zbMATH OpenOpenAlexFDO

Authors L. Pagli, P. Flocchini, G. Prencipe, N. Santoro, Peter Widmayer

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

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

Recommendations

• scientific article; zbMATH DE number 2163017
• Principles of Distributed Systems
• Distributed Computing - IWDC 2004
• A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
• Linear time distributed swap edge algorithms

Cites work

• scientific article; zbMATH DE number 4014044 (Why is no real title available?)
• scientific article; zbMATH DE number 878456 (Why is no real title available?)
• Applications of Path Compression on Balanced Trees
• Finding all the best swaps of a minimum diameter spanning tree under transient edge failures
• Single backup table schemes for shortest-path routing
• Sparser: A Paradigm for Running Distributed Algorithms
• Structural Information and Communication Complexity
• Swapping a failing edge of a single source shortest paths tree is good and fast
• The multi-tree approach to reliability in distributed networks

Cited in

(9)

• Faster swap edge computation in minimum diameter spanning trees
• Distributed Computing - IWDC 2004
• Principles of Distributed Systems
• A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
• scientific article; zbMATH DE number 2163017 (Why is no real title available?)
• Faster Swap Edge Computation in Minimum Diameter Spanning Trees
• Linear time distributed swap edge algorithms
• Stable routing under the Spanning Tree Protocol
• A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436830)