Reduction of the State Space for the Travelling Salesman Problem (TSP) Through Elimination of Unpaved Edges
53-57
28.Cnf-317 Paper View Page
Title
Characterizing the convergence time of RSTP
Authors
Mr. Eduard Bonada, Universitat Pompeu Fabra, Barcelona, Spain Dolors Sala, Universitat Pompeu Fabra, Barcelona, Spain
Abstract
The spanning tree protocol is the component of the Ethernet architecture that establishes the network connectivity. It defines a tree-shaped logical topology on top of the physical topology in order to avoid loops. It was designed to be highly robust but the new provider applications require to improve its capabilities such as performance and response time. The Rapid Spanning Tree Protocol (RSTP) is the current version in use. It provides a quicker convergence time than its predecessor, the Spanning Tree Protocol (STP), but it experiences large recovery times in the event of critical failures (as for example the Root of the tree). This paper presents a study of the RSTP describing the most important behavior effects and providing a performance analysis including cold start and failure conditions. The results show that the convergence time of RSTP in a cold start scenario stays in the order of milliseconds, when the Root fails the recovery time grows to tens of seconds. This justifies the current direction to further evolve this protocol to meet the provider requirements.
2nd Mosharaka International Conference on Communications and Signal Processing (MIC-CSP 2012)
Congress
2012 Global Congress on Communications and Signal Processing (GC-CSP 2012), 6-8 April 2012, Barcelona, Spain
Pages
30-35
Topics
Communication Networks Network Protocols and Standards
ISSN
2227-331X
DOI
BibTeX
@inproceedings{317CSP2012,
title={Characterizing the convergence time of RSTP},
author={Eduard Bonada, and Dolors Sala},
booktitle={2012 Global Congress on Communications and Signal Processing (GC-CSP 2012)},
year={2012},
pages={30-35},
doi={}},
organization={Mosharaka for Research and Studies}
}
