Loading...
research article
Stable routing under the Spanning Tree Protocol
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.
Type
research article
Web of Science ID
WOS:000282458100014
Authors
Publication date
2010
Publisher
Published in
Volume
38
Issue
5
Start page
399
End page
404
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
September 2, 2010
Use this identifier to reference this record