Stable routing under the Spanning Tree Protocol

DOI10.1016/J.ORL.2010.05.001MaRDI QIDQ613335zbMATHOpenAlexFDO

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

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)

Recommendations

• Stabilization of general loop-free routing
• Stable routing and unique-max coloring on trees
• Stability of networks in stretchable graphs
• Publication:4668739
• Stability in routing: Networks and protocols

Cites work

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

Cited in

(11)

• scientific article; zbMATH DE number 2104199 (Why is no real title available?)
• Rerouting Flows when Links Fail
• Stabilization of general loop-free routing
• Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
• Study on cloud security based on trust spanning tree protocol
• scientific article; zbMATH DE number 7378671 (Why is no real title available?)
• HURP/HURBA: zero-configuration hierarchical up/Down routing and bridging architecture for ethernet backbones and campus networks
• Stable routing and unique-max coloring on trees
• Stability of networks in stretchable graphs
• Load balancing in metro ethernet networks by selecting the best spanning tree
• Achieve faster spanning tree convergence

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)