Bounded Latency Spanning Tree Reconfiguration

TitleBounded Latency Spanning Tree Reconfiguration
Publication TypeJournal Article
Year of Publication2015
AuthorsFornasa, M., Stecca M., Maresca M., & Baglietto P.
Published inComputer Networks
Volume76
Page(s)259-274
Other Numbers3743
Abstract

One of the main obstacles to the adoption of Ethernet technology incarrier-grade metropolitan and wide-area networks is the largerecovery latency, in case of failure, due to spanning treereconfiguration. In this paper we present a technique called BoundedLatency Spanning Tree Reconfiguration (BLSTR), which guarantees worstcase recovery latency in the case of single faults by adopting atime-bounded bridge port reconfiguration mechanism and by eliminatingthe bandwidth-consuming station discovery phase that followsreconfiguration. BLSTR does not replace the Rapid and MultipleSpanning Tree reconfiguration protocols, which remain in control ofnetwork reconfiguration, whereas it operates in parallel with them.

Acknowledgment

This work was partially funded by the Computer Platform Research Center (CIPI), a joint effort of the University Padua and the University of Genoa, through a research fellowship.

Bibliographic Notes

Computer Networks, Vol. 76, pp. 259-274

Abbreviated Authors

M. Fornasa, M. Stecca, M. Maresca, and P. Baglietto

ICSI Research Group

Research Initiatives

ICSI Publication Type

Article in journal or magazine