Grandoni, Fabrizio
Nicosia, Gaia
Oriolo, Gianpaolo
SanitÃ , Laura
Stable routing under the Spanning Tree Protocol
Operations Research Letters
0167-6377
10.1016/j.orl.2010.05.001
38
5
399-404
The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we design efficient algorithms to compute polynomial-size integer weights so as to enforce the following stability property: if q=O(1) edges fail, traffic demands that are not affected by the failures are not redirected. Stability is a goal pursued by network operators in order to minimize transmission delays due to the restoration process.
Stable routing;
Spanning Tree Protocol;
Randomized algorithms;
Shortest Paths Tree;
Failing Edge;
Elsevier
2010