Name
Abstract | ||
|---|---|---|
Rapid Spanning Tree Protocol (RSTP) is a layer 2 protocol that blocks redundant links to avoid loops. Due to its well-known limitations, diverse solutions have been proposed to replace it, but scarcely adopted, such as Transparent Interconnection of Lots of Links (TRILL) and Shortest Path Bridging (SPB). To overcome the constraints of RSTP, while keeping its advantages, we propose to combine the fast and proven reconfiguration mechanisms of RSTP with the shortest path capabilities and load balancing of ARP-Path bridging in the same device. The combined bridges are self-configuring and allow full miscibility of combined bridges in legacy RSTP networks. This enables a smooth migration path from standard 802.1D bridges to ARP-Path shortest path bridges. This paper presents a preliminary proposal: full validation, simulation, implementation and evaluation are ongoing. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/LCN44214.2019.8990689 | 2019 IEEE 44th Conference on Local Computer Networks (LCN) |
Keywords | Field | DocType |
Spanning Tree,Shortest Path Bridges,ARP-Path,Ethernet,Routing bridges | Shortest path problem,Computer science,Load balancing (computing),Bridging (networking),Computer network,Ethernet,Spanning tree,Interconnection,Control reconfiguration,Distributed computing,Spanning Tree Protocol | Conference |
ISSN | ISBN | Citations |
0742-1303 | 978-1-7281-1029-5 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diego Lopez-Pajares | 1 | 0 | 2.03 |
| Guillermo Ibáñez | 2 | 25 | 7.16 |
| José M. Arco | 3 | 7 | 2.89 |
| Boby N. Constantin | 4 | 0 | 0.34 |
| Elisa Rojas | 5 | 20 | 9.66 |