Publication

Stable routing under the Spanning Tree Protocol

Laura Sanità
2010
Journal Articles

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.

Official source

https://infoscience.epfl.ch/entities/publication/b2af4792-a110-4ddd-95c4-3e75eb529586

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Stable routing under the Spanning Tree Protocol

Chat with Graph Search

Modeling and Optimization of Ridesplitting Operations

A hybrid microscopic model for multimodal traffic with empirical observations from aerial footage

Cycling Interaction Rituals in the Conflict against the Car. From the Bike Subculture to the City Scale and Beyond