Abstract
A major staple of layer 2 has long been the combination of flood-and-learn Ethernet switches with some variant of the Spanning Tree Protocol. However, STP has significant shortcomings - chiefly, that it throws away network capacity by removing links, and that it can be relatively slow to reconverge after topology changes. In recent years, attempts to rectify these shortcomings have been made by either making L2 look more like L3 (notably TRILL and SPB, which both incorporate L3-like routing) or by replacing L2 switches with "L3 switching" hardware and extending IP all the way to the host. In this paper, we examine an alternate point in the L2 design space, which is simple (in that it is a single data plane mechanism with no separate control plane), converges quickly, delivers packets during convergence, utilizes all available links, and can be extended to support both equal-cost multipath and efficient multicast.
Author supplied keywords
Cite
CITATION STYLE
McCauley, J., Zhao, M., Jackson, E. J., Raghavan, B., Ratnasamy, S., & Shenker, S. (2016). The deforestation of L2. In SIGCOMM 2016 - Proceedings of the 2016 ACM Conference on Special Interest Group on Data Communication (pp. 497–510). Association for Computing Machinery. https://doi.org/10.1145/2934872.2934877
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.