skip to main content
10.1145/2934872.2959083acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
short-paper
Free Access

Towards Transiently Secure Updates in Asynchronous SDNs

Published:22 August 2016Publication History

ABSTRACT

Software-Defined Networks (SDNs) promise to overcome the often complex and error-prone operation of tradi- tional computer networks, by enabling programmabil- ity, automation and verifiability. Yet, SDNs also in- troduce new challenges, for example due to the asyn- chronous communication channel between the logically centralized control platform and the switches in the data plane. In particular, the asynchronous commu- nication of network update commands (e.g., OpenFlow FlowMod messages) may lead to transient inconsisten- cies, such as loops or bypassed waypoints (e.g., fire- walls). One approach to ensure transient consistency even in asynchronous environments is to employ smart scheduling algorithms: algorithms which update subsets of switches in each communication round only, where each subset in itself guarantees consistency. In this demo, we show how to change routing policies in a transiently consistent manner. We demonstrate two al- gorithms, namely, Wayup [5] and Peacock [4], which partition the network updates sent from SDN controller towards OpenFlow software switches into multiple rounds as per respective algorithms. Later, the barrier mes- sages are utilized to ensure reliable network updates.

References

  1. S. Dudycz, A. Ludwig, and S. Schmid. Can$'$t touch this: Consistent network updates for multiple policies. In IEEE/IFIP DSN, 2016.Google ScholarGoogle Scholar
  2. M. Kuzniar, P. Peresini, and D. Kostic. What you need to know about sdn flow tables. In PAM, 2015.Google ScholarGoogle ScholarCross RefCross Ref
  3. A. Ludwig, S. Dudycz, M. Rost, and S. Schmid. Transiently secure network updates. In ACM SIGMETRICS, 2016. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Ludwig, J. Marcinkowski, and S. Schmid. Scheduling loop-free network updates: It$'$s good to relax! In ACM PODC, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Ludwig, M. Rost, D. Foucard, and S. Schmid. Good network updates for bad packets. In ACM HotNets, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Towards Transiently Secure Updates in Asynchronous SDNs

      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

        Author Tags

        Qualifiers

        • short-paper

        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