Stable routing under the Spanning Tree Protocol

DOI10.1016/j.orl.2010.05.001zbMath1202.90063OpenAlexW2063945970MaRDI QIDQ613335

Gaia Nicosia, Fabrizio Grandoni, Laura Sanità, Gianpaolo Oriolo

Publication date: 20 December 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2010.05.001

zbMATH Keywords

randomized algorithmsspanning tree protocolstable routing

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (2)

Unnamed Item ⋮ Rerouting Flows when Links Fail

Cites Work

• Computing all the best swap edges distributively
• Swapping a failing edge of a single source shortest paths tree is good and fast
• Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
• Reserving Resilient Capacity in a Network

This page was built for publication: Stable routing under the Spanning Tree Protocol