000148258 001__ 148258
000148258 005__ 20180913055738.0
000148258 037__ $$aCONF
000148258 245__ $$aLocal restoration for trees and arborescences
000148258 269__ $$a2009
000148258 260__ $$bSpringer Berlin / Heidelberg$$c2009
000148258 336__ $$aConference Papers
000148258 490__ $$aLecture Notes in Computer Science$$v5464/2009
000148258 520__ $$aProtocols 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.
000148258 700__ $$aIovanna, Paola
000148258 700__ $$aOriolo, Gianpaolo
000148258 700__ $$aNicosia, Gaia
000148258 700__ $$0243827$$g190471$$aSanità, Laura
000148258 700__ $$aSperduto, Ezio
000148258 7112_ $$dDecember 11-12, 2008$$cPorto, Portugal$$aInternational Workshop on Traffic Management and Traffic Engineering for the Future Internet
000148258 773__ $$tTraffic Management and Traffic Engineering for the Future Internet$$q130-140
000148258 909C0 $$xU11879$$0252111$$pDISOPT
000148258 909CO $$pconf$$pSB$$ooai:infoscience.tind.io:148258
000148258 937__ $$aEPFL-CONF-148258
000148258 973__ $$rREVIEWED$$sPUBLISHED$$aOTHER
000148258 980__ $$aCONF