Grandoni, Fabrizio and Nicosia, Gaia and Oriolo, Gianpaolo and Sanità, Laura (2010) Stable routing under the Spanning Tree Protocol. Operations Research Letters, 38 (5). pp. 399-404. ISSN 0167-6377
Full text not available from this repository.Abstract
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)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.
| Item Type: | Scientific journal article, Newspaper article or Magazine article |
|---|---|
| Uncontrolled Keywords: | Stable routing; Spanning Tree Protocol; Randomized algorithms |
| Subjects: | Computer sciences |
| Department/unit: | Dipartimento tecnologie innovative > Istituto Dalle Molle di studi sull’intelligenza artificiale USI-SUPSI |
| Depositing User: | Fabrizio Grandoni |
| Date Deposited: | 14 Mar 2014 08:39 |
| Last Modified: | 23 May 2016 14:34 |
| URI: | http://repository.supsi.ch/id/eprint/4489 |
Actions (login required)
 |
View Item |