Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Stable routing under the Spanning Tree Protocol
 
research article

Stable routing under the Spanning Tree Protocol

Grandoni, Fabrizio
•
Nicosia, Gaia
•
Oriolo, Gianpaolo
Show more
2010
Operations Research Letters

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.

  • Details
  • Metrics
Type
research article
DOI
10.1016/j.orl.2010.05.001
Web of Science ID

WOS:000282458100014

Author(s)
Grandoni, Fabrizio
Nicosia, Gaia
Oriolo, Gianpaolo
Sanità, Laura  
Date Issued

2010

Publisher

Elsevier

Published in
Operations Research Letters
Volume

38

Issue

5

Start page

399

End page

404

Subjects

Stable routing

•

Spanning Tree Protocol

•

Randomized algorithms

•

Shortest Paths Tree

•

Failing Edge

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
DISOPT  
Available on Infoscience
September 2, 2010
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/52614
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés