Bounded latency spanning tree reconfiguration

Autor:	Massimo Maresca, Martino Fornasa, Pierpaolo Baglietto, Michele Stecca
Rok vydání:	2015
Předmět:	Metropolitan area network Ethernet Spanning tree Computer Networks and Communications Computer science business.industry Distributed computing Control reconfiguration Spanning Tree Protocol Wide area network Latency (engineering) business Carrier Ethernet Computer network
Zdroj:	Computer Networks. 76:259-274
ISSN:	1389-1286
Popis:	One of the main obstacles to the adoption of Ethernet technology in carrier-grade metropolitan and wide-area networks is the large recovery latency, in case of failure, due to spanning tree reconfiguration. In this paper we present a technique called Bounded Latency Spanning Tree Reconfiguration (BLSTR), which guarantees worst case recovery latency in the case of single faults by adopting a time-bounded bridge port reconfiguration mechanism and by eliminating the bandwidth-consuming station discovery phase that follows reconfiguration. BLSTR does not replace the Rapid and Multiple Spanning Tree reconfiguration protocols, which remain in control of network reconfiguration, whereas it operates in parallel with them.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::120d6bf6b4d2c6de66e154c4c12bf14f https://doi.org/10.1016/j.comnet.2014.11.004 Zobrazit plný text záznamu Full Text from ScienceDirect