000150722 001__ 150722
000150722 005__ 20190604054643.0
000150722 0247_ $$2doi$$a10.1016/j.orl.2010.05.001
000150722 022__ $$a0167-6377
000150722 02470 $$2ISI$$a000282458100014
000150722 037__ $$aARTICLE
000150722 245__ $$aStable routing under the Spanning Tree Protocol
000150722 260__ $$bElsevier$$c2010
000150722 269__ $$a2010
000150722 336__ $$aJournal Articles
000150722 520__ $$aThe 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.
000150722 6531_ $$aStable routing
000150722 6531_ $$aSpanning Tree Protocol
000150722 6531_ $$aRandomized algorithms
000150722 6531_ $$aShortest Paths Tree
000150722 6531_ $$aFailing Edge
000150722 700__ $$aGrandoni, Fabrizio
000150722 700__ $$aNicosia, Gaia
000150722 700__ $$aOriolo, Gianpaolo
000150722 700__ $$g190471$$aSanità, Laura$$0243827
000150722 773__ $$j38$$tOperations Research Letters$$k5$$q399-404
000150722 909C0 $$xU11879$$0252111$$pDISOPT
000150722 909CO $$pSB$$particle$$ooai:infoscience.tind.io:150722
000150722 917Z8 $$x190471
000150722 917Z8 $$x148230
000150722 937__ $$aEPFL-ARTICLE-150722
000150722 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000150722 980__ $$aARTICLE