Networks · Fault tolerance

Software Defined Ethernet NetworkingImproved Spanning Tree convergence and fault recovery.

Bounded Latency Spanning Tree Reconfiguration (BLSTR) addresses single-fault recovery through time-bounded bridge port reconfiguration, eliminating the station discovery phase.

Illustration of networked computer systems

Bounded Latency Spanning Tree Reconfiguration

The project delivered Bounded Latency Spanning Tree Reconfiguration (BLSTR), a technique for rapidly reconfiguring Ethernet networks based on IEEE 802.1Q. For single faults, the technique guarantees worst-case recovery latency through time-bounded bridge port reconfiguration.

BLSTR eliminates the bandwidth-consuming station discovery phase that follows invalidation of bridge forwarding tables during reconfiguration.

Bibliographic reference

Fornasa, M., M. Stecca, M. Maresca and P. Baglietto, Bounded Latency Spanning Tree Reconfiguration, Computer Networks, Elsevier Publisher, Vol. 76, N. 1, 2015, Pages: 259–274.

Back to projects

Explore more

UNaLab

A project funded by the EU Horizon 2020 programme to develop nature-based solutions, bringing cities, research and industry together to address climate and water challenges.