skip to main content
10.1145/2934872.2934877acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
research-article
Public Access

The Deforestation of L2

Published:22 August 2016Publication History

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.

References

  1. 1.Al-Fares, M., Loukissas, A., and Vahdat, A. A Scalable, Commodity Data Center Network Architecture. In Proc. of SIGCOMM (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., and Vahdat, A. Hedera: Dynamic Flow Scheduling for Data Center Networks. In Proc. of NSDI (2010). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Benson, T., Akella, A., and Maltz, D. Network Traffic Characteristics of Data Centers in the Wild. In Proc. of ACM Internet Measurement Conference (IMC) (2012). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.P4 Behavioral Model. https://github.com/p4lang/behavioral-model.Google ScholarGoogle Scholar
  5. 5.Bosshart, P., Gibb, G., Kim, H.-S., Varghese, G., McKeown, N., Izzard, M., Mujica, F., and Horowitz, M. Forwarding Metamorphosis: Fast Programmable Match-Action Processing in Hardware for SDN. In Proc. of SIGCOMM (2013). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Christensen, M., Kimball, K., and Solensky, F. Considerations for Internet Group Management Protocol (IGMP) and Multicast Listener Discovery (MLD) Snooping Switches. RFC 4541 (Informational), 2006.Google ScholarGoogle Scholar
  7. 7.Datasheet, Texas Instruments. DP83867IR/CR Robust, High Immunity 10/100/1000 Ethernet Physical Layer Transceiver. http://www.ti.com/lit/ds/symlink/dp83867ir.pdf, 2015.Google ScholarGoogle Scholar
  8. 8.Di Caro, G. A., and Dorigo, M. Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks. In Proc. of the IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS) (1998).Google ScholarGoogle Scholar
  9. 9.Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., and Sengupta, S. VL2: A Scalable and Flexible Data Center Network. In Proc. of SIGCOMM (2009). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.He, K., Khalid, J., Gember-Jacobson, A., Das, S., Prakash, C., Akella, A., Li, L. E., and Thottan, M. Measuring Control Plane Latency in SDN-enabled Switches. In Proc. of the ACM SIGCOMM Symposium on Software Defined Networking Research (SOSR) (2015). Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.IEEE Standards Association. 802.1ag-2007 - IEEE Standard for Local and Metropolitan Area Networks Virtual Bridged Local Area Networks Amendment 5: Connectivity Fault Management. http://standards.ieee.org/findstds/standard/802.1ag-2007.html.Google ScholarGoogle Scholar
  12. 12.IEEE Standards Association. 802.1aq-2012 - IEEE Standard for Local and metropolitan area networks–Media Access Control (MAC) Bridges and Virtual Bridged Local Area Networks–Amendment 20: Shortest Path Bridging. https://standards.ieee.org/findstds/standard/802.1aq-2012.html.Google ScholarGoogle Scholar
  13. 13.IEEE Standards Association. 802.1D-2004 - IEEE Standard for Local and metropolitan area networks: Media Access Control (MAC) Bridges. http://standards.ieee.org/findstds/standard/802.1D-2004.html.Google ScholarGoogle Scholar
  14. 14.IEEE Standards Association. 802.1Q-2014 - IEEE Standard for Local and metropolitan area networks–Bridges and Bridged Networks. http://standards.ieee.org/findstds/standard/802.1Q-2014.html.Google ScholarGoogle Scholar
  15. 15.IEEE Standards Association. 802.1s-2002 - IEEE Standards for Local and Metropolitan Area Networks - Amendment to 802.1Q Virtual Bridged Local Area Networks: Multiple Spanning Trees. http://standards.ieee.org/findstds/standard/802.1s-2002.html.Google ScholarGoogle Scholar
  16. 16.IEEE Standards Association. 802.2-1989 - IEEE Standard for Information Technology - Telecommunications and Information Exchange Between Systems - Local and Metropolitan Area Networks - Specific Requirements - Part 2: Logical Link Control. http://standards.ieee.org/findstds/standard/802.2-1989.html.Google ScholarGoogle Scholar
  17. 17.Johnson, D. B. Routing in Ad Hoc Networks of Mobile Hosts. In Proc. of Workshop on Mobile Computing Systems and Applications (WMCSA) (1994). Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.Jose, L., Yan, L., Varghese, G., and McKeown, N. Compiling Packet Programs to Reconfigurable Switches. In Proc. of NSDI (2015). Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. 19.Katz, D., and Ward, D. Bidirectional Forwarding Detection (BFD). RFC 5880 (Proposed Standard), 2010.Google ScholarGoogle Scholar
  20. 20.Kempf, M. Bridge Circuit for Interconnecting Networks, 1986. US Patent 4,597,078.Google ScholarGoogle Scholar
  21. 21.Lakshminarayanan, K., Caesar, M., Rangan, M., Anderson, T., Shenker, S., and Stoica, I. Achieving Convergence-free Routing Using Failure-carrying Packets. In Proc. of SIGCOMM (2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.Liu, J., Panda, A., Singla, A., Godfrey, B., Schapira, M., and Shenker, S. Ensuring Connectivity via Data Plane Mechanisms. In Proc. of NSDI (2013). Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23.Liu, V., Halperin, D., Krishnamurthy, A., and Anderson, T. F10: A Fault-Tolerant Engineered Network. In Proc. of NSDI (2013). Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24.Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., and Diot, C. Characterization of Failures in an IP Backbone. In Proc. of INFOCOM (2004).Google ScholarGoogle ScholarCross RefCross Ref
  25. 25.McCauley, J., Sheng, A., Jackson, E. J., Raghavan, B., Ratnasamy, S., and Shenker, S. Taking an AXE to L2 Spanning Trees. In Proc. of HotNets (2015). Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 26.McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., and Turner, J. OpenFlow: Enabling Innovation in Campus Networks. CCR 38, 2 (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27.Mininet. http://mininet.org/.Google ScholarGoogle Scholar
  28. 28.ns-3. http://www.nsnam.org/.Google ScholarGoogle Scholar
  29. 29.Perlman, R. An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN. In Proc. of SIGCOMM (1985). Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. 30.Perlman, R., Eastlake, D., Dutt, D., Gai, S., and Ghanwani, A. Routing Bridges (RBridges): Base Protocol Specification. RFC 6325 (Proposed Standard), 2011.Google ScholarGoogle Scholar
  31. 31.Singh, A., Ong, J., Agarwal, A., Anderson, G., Armistead, A., Bannon, R., Boving, S., Desai, G., Felderman, B., Germano, P., et al. Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network. In Proc. of SIGCOMM (2015). Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. 32.Waitzman, D., Partridge, C., and Deering, S. Distance Vector Multicast Routing Protocol. RFC 1075 (Experimental), 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The Deforestation of L2

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGCOMM '16: Proceedings of the 2016 ACM SIGCOMM Conference
        August 2016
        645 pages
        ISBN:9781450341936
        DOI:10.1145/2934872

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 August 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        SIGCOMM '16 Paper Acceptance Rate39of231submissions,17%Overall Acceptance Rate554of3,547submissions,16%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader