Abstract
As software-defined networking (SDN) is growing increasingly common within the networking industry, the lack of accessible and reliable automated methods for updating network configurations becomes more apparent. Any computer network is a complex distributed system and changes to its configuration may result in policy violations during the transient phase when the individual routers update their forwarding tables. We present an approach for automatic synthesis of update sequences that ensures correct network functionality throughout the entire update phase. Our approach is based on a novel translation of the update synthesis problem into a Petri game and it is implemented on top of the open-source model checker TAPAAL. On a large benchmark of synthetic and real-world network topologies, we document the efficiency of our approach and compare its performance with state-of-the-art tool NetSynth. Our experiments show that for several networks with up to thousands of nodes, we are able to outperform NetSynth’s update schedule generation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Amiri S.A., Dudycz, S., Schmid, S., Wiederrecht, S.: Congestion-free rerouting of flows on DAGs. In: ICALP 2018), volume 107 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 143:1–143:13. Dagstuhl (2018)
Benzekki, K., El Fergougui, A., Elbelrhiti Elalaoui, A.: Software-defined networking (SDN): a survey. Secur. Comm. Netw. 9(18), 5803–5833 (2016)
Brandt, S., Förster, K., Wattenhofer, R.: On consistent migration of flows in SDNs. In: INFOCOM 2016, pp. 1–9. IEEE (2016)
Christesen, N., Glavind, M., Schmid, S., Srba, J.: Latte: improving the latency of transiently consistent network update schedules. In: IFIP PERFORMANCE 2020, vol. 48, no. 3 of Performance Evaluation Review, pp. 14–26. ACM (2020)
Cimatti, A., et al.: NuSMV 2: an opensource tool for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 359–364. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45657-0_29
David, A., Jacobsen, L., Jacobsen, M., Jørgensen, K.Y., Møller, M.H., Srba, J.: TAPAAL 2.0: integrated development environment for timed-arc petri nets. In: Flanagan, C., König, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 492–497. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28756-5_36
Didriksen, M., et al.: Artefact for: Automatic Synthesis of Transiently Correct Network Updates via Petri Games (2021). https://doi.org/10.5281/zenodo.4497000
Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.-R.: Model checking data flows in concurrent network updates. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 515–533. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31784-3_30
Finkbeiner, B., Gieseking, M., Hecking-Harbusch, J., Olderog, E.-R.: AdamMC: a model checker for petri nets with transits against flow-LTL. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 64–76. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-53291-8_5
Foerster, K., Schmid, S., Vissicchio, S.: Survey of consistent software-defined network updates. IEEE Commun. Surv. Tutorials 21(2), 1435–1461 (2019)
Hopps, C., et al.: Analysis of an equal-cost multi-path algorithm. Technical report, RFC 2992, November 2000
Jensen, J.F., Nielsen, T., Oestergaard, L.K., Srba, J.: TAPAAL and reachability analysis of P/T nets. Trans. Petri Nets Other Mod. Concurrency (ToPNoC) 9930, 307–318 (2016)
Jensen, P.G., Larsen, K.G., Srba, J.: Real-time strategy synthesis for timed-arc petri net games via discretization. In: Bošnački, D., Wijs, A. (eds.) SPIN 2016. LNCS, vol. 9641, pp. 129–146. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-32582-8_9
Jensen, P.G., Larsen, K.G., Srba, J.: Ptrie: data structure for compressing and storing sets via prefix sharing. In: ICTAC 2017, vol. 10580 of LNCS, pp. 248–265. Springer (2017)
Jensen, P.G., Larsen, K.G., Srba, J.: Discrete and continuous strategies for timed-arc Petri net games. Int. J. Softw. Tools Technol. Transf. 20(5), 529–546 (2017). https://doi.org/10.1007/s10009-017-0473-2
Knight, S., Nguyen, H.X., Falkner, N., Bowden, R., Roughan, M.: The internet topology Zoo. IEEE J. Select. Areas Comm. 29(9), 1765–1775 (2011)
Liu, H.H., Wu, X., Zhang, M., Yuan, L., Wattenhofer, R., Maltz, D.: Zupdate: updating data center networks with zero loss. SIGCOMM Comput. Commun. Rev. 43(4), 411–422 (2013)
Ludwig, A., Dudycz, S., Rost, M., Schmid, S.: Transiently secure network updates. In: ACM SIGMETRICS, pp. 273–284. ACM (2016)
Ludwig, A., Marcinkowski, J., Schmid, S.: Scheduling loop-free network updates: it’s good to relax! In: PODC 2015, pp. 13–22. ACM (2015)
Mahajan, R., Wattenhofer, R.: On consistent updates in software defined networks. HotNets-XII, New York, NY, USA. ACM (2013)
McClurg, J., Hojjat, H., Černy, P., Foster, N.: Efficient synthesis of network updates. ACM Sigplan Not. 50(6), 196–207 (2015)
Moy, J.: RFC2328: OSPF version 2 (1998). https://tools.ietf.org/html/rfc2328
Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)
Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., Walker, D.: Abstractions for network update. In: ACM SIGCOMM 2012, pp. 323–334. ACM (2012)
Vissicchio, S., Cittadini, L.: FLIP the (flow) table: fast lightweight policy-preserving SDN updates. In: INFOCOM 2016, pp. 1–9. IEEE (2016)
Acknowledgements
We thank to Anders Mariegaard for his help with setting up NetSynth. This work received a support from the DFF project QASNET.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Didriksen, M. et al. (2021). Automatic Synthesis of Transiently Correct Network Updates via Petri Games. In: Buchs, D., Carmona, J. (eds) Application and Theory of Petri Nets and Concurrency. PETRI NETS 2021. Lecture Notes in Computer Science(), vol 12734. Springer, Cham. https://doi.org/10.1007/978-3-030-76983-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-76983-3_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-76982-6
Online ISBN: 978-3-030-76983-3
eBook Packages: Computer ScienceComputer Science (R0)