Stable routing under the Spanning Tree Protocol

DOI10.1016/J.ORL.2010.05.001zbMATH Open1202.90063OpenAlexW2063945970MaRDI QIDQ613335FDOQ613335

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)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• Rerouting Flows when Links Fail
• Stabilization of general loop-free routing
• Title not available (Why is that?)

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

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