Abstract
We consider the problem of replacing several dependent routes in a Software-Defined Network (SDN). Delaet et al. focused on the replacement of a single pair of routes and proposed a verification idea for launching a new sub-route. Dinitz et al. suggested a dependence graph model for solving the problem with several routes pairs, and described the sub-route launching verification in the form of a high level network protocol. In both works, each sub-route is seamlessly updated using the Make&Activate-Before-Break (MABB) approach, eliminating flow stopping and delays in transmission. According to the MABB approach, a new sub-route is first fully prepared by possibly adding additional traffic in the sake of readiness signaling and seamless route change; after that the new sub-route is activated by redirecting the flow through it and the corresponding part of the current route is dismantled. In this brief announcement, we describe our extension for the case of replacing several dependent routes to also address network policies preservation. Additionally, we describe the existing verification gap of OpenFlow (the standard communication protocol tool for SDN) in signaling the readiness of route changes. We describe a verification protocol of route change readiness by means of OpenFlow, called Route Readiness Verifier (RRV). We show that RRV closes the verification gap in OpenFlow for route updates.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Amiri, S.A., Dudycz, S., Schmid, S., Wiederrecht, S.: Congestion-Free Rerouting of Flows on DAGs. [cs, math], November 2016. arXiv: 1611.09296
Delaet, S., Dolev, S., Khankin, D., Tzur-David, S., Godinger, T.: Seamless SDN route updates. In: 2015 IEEE 14th International Symposium on Network Computing and Applications, pp. 120–125, September 2015. https://doi.org/10.1109/NCA.2015.24
Dinitz, Y., Dolev, S., Khankin, D.: Dependence graph and master switch for seamless dependent routes replacement in SDN (extended abstract). In: 2017 IEEE 16th International Symposium on Network Computing and Applications (NCA), pp. 1–7, October 2017. https://doi.org/10.1109/NCA.2017.8171386
Foerster, K.T., Schmid, S., Vissicchio, S.: A Survey of Consistent Network Updates (2016)
Kreutz, D., et al.: Software-defined networking: a comprehensive survey. Proc. IEEE 103(1), 14–76 (2015)
Kuzniar, M., Canini, M., Kostic, D.: OFTEN testing OpenFlow networks. In: 2012 European Workshop on Software Defined Networking, pp. 54–60, October 2012. https://doi.org/10.1109/EWSDN.2012.21
Mizrahi, T., Moses, Y.: Time4: Time for SDN. IEEE Trans. Netw. Serv. Manag. 13(3), 433–446 (2016). https://doi.org/10.1109/TNSM.2016.2599640
Mizrahi, T., Moses, Y.: Time-based updates in software defined networks. In: Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, HotSDN 2013, pp. 163–164. ACM, New York, NY, USA (2013). https://doi.org/10.1145/2491185.2491214
ONF: OpenFlow Switch Specification Ver 1.5.1. Open Networking Foundation (2015). https://www.opennetworking.org/software-defined-standards/specifications/
Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., Walker, D.: Abstractions for network update. SIGCOMM Comput. Commun. Rev. 42(4), 323–334 (2012). https://doi.org/10.1145/2377677.2377748
Talayco, D.: [openflow-discuss] Question about barrier messages, March 2010. https://mailman.stanford.edu/pipermail/openflow-discuss/2010-March/000820.html
Zhang, P., Li, H., Hu, C., Hu, L., Xiong, L., Wang, R., Zhang, Y.: Mind the gap: monitoring the control-data plane consistency in software defined networks. In: Proceedings of the 12th International on Conference on Emerging Networking EXperiments and Technologies, CoNEXT 2016, pp. 19–33. ACM, New York, NY, USA (2016). https://doi.org/10.1145/2999572.2999605
Acknowledgments
This research was (partially) funded by the Office of the Israel Innovation Authority of the Israel Ministry of Economy under Neptune - the Israeli Consortium for Network Programming, generic research project, and by the Lynne and William Frankel Center for Computer Science.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Dinitz, Y., Dolev, S., Khankin, D. (2018). Make&Activate-Before-Break: Policy Preserving Seamless Routes Replacement in SDN. In: Lotker, Z., Patt-Shamir, B. (eds) Structural Information and Communication Complexity. SIROCCO 2018. Lecture Notes in Computer Science(), vol 11085. Springer, Cham. https://doi.org/10.1007/978-3-030-01325-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-01325-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01324-0
Online ISBN: 978-3-030-01325-7
eBook Packages: Computer ScienceComputer Science (R0)