148258
20180913055738.0
CONF
Local restoration for trees and arborescences
2009
Springer Berlin / Heidelberg
2009
Conference Papers
Lecture Notes in Computer Science
5464/2009
Protocols belonging to the Spanning Tree Protocol (STP) route traffic demands on tree topologies that are evaluated through shortest path procedures. In this paper we deal with the problem of assigning costs to the arcs of a network in order to guarantee that SPT protocols efficiently re-route traffic demands in failure situations: namely, without redirecting traffic demands that are not affected by the failure. We say that a communication network has the local tree-restoration property if there exists a set of costs for its arcs such that the above property holds. We show that an undirected network has the local tree-restoration property if and only if it is 2-connected. In particular, we provide a quite simple procedure for assigning costs to the arcs of a 2-connected network so that the property holds. For the directed case, we show that deciding whether a network has the local tree-restoration property is NP-hard, even in some “simple” cases.
Iovanna, Paola
Oriolo, Gianpaolo
Nicosia, Gaia
243827
Sanità, Laura
190471
Sperduto, Ezio
International Workshop on Traffic Management and Traffic Engineering for the Future Internet
Porto, Portugal
December 11-12, 2008
130-140
Traffic Management and Traffic Engineering for the Future Internet
252111
DISOPT
U11879
oai:infoscience.tind.io:148258
conf
SB
EPFL-CONF-148258
OTHER
REVIEWED
PUBLISHED
CONF