Stable routing under the Spanning Tree Protocol

Authors:
Fabrizio Grandoni;Gaia Nicosia;Gianpaolo Oriolo;Laura Sanití
Affiliations:
Dipartimento di Informatica, Sistemi e Produzione, Universití di Roma Tor Vergata, Via del Politecnico 1, 00133 Roma, Italy;Dipartimento di Informatica e Automazione, Universití degli Studi Roma Tre, Via della Vasca Navale 79, I 00146 Roma, Italy;Dipartimento di Ingegneria dell'Impresa, Universití di Roma Tor Vergata, via del Politecnico 1, 00133 Roma, Italy;Institute of Mathematics, ícole Polytechnique Fédérale de Lausanne, 1015 Lausanne, Switzerland
Venue:
Operations Research Letters
Year:
2010

Citing 7
Cited 0

Ethernet: distributed packet switching for local computer networks

Communications of the ACM
Reserving Resilient Capacity in a Network

SIAM Journal on Discrete Mathematics
Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS

Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor

Theoretical Computer Science
IGP link weight assignment for operational Tier-1 backbones

IEEE/ACM Transactions on Networking (TON)
Computing all the best swap edges distributively

Journal of Parallel and Distributed Computing
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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) 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.