Abstract
An automatic cloudification scheme for Software-Defined Networks (SDN) is presented. An existing network consisting of communicating network elements and network functions should be served by several cloud suppliers. The costs of cloudifying each element and each function at each cloud and the costs of transferring a unit of information between and inside clouds are given. The scheme selects in which cloud to locate each element and function in a way that minimizes the total cost of cloudifying and communication. As well, an online distributed protocol of seamless transformation of the existing network communication to the clouds is presented.
Research supported by Neptune - The Israeli Network Consortium, and partially supported by Rita Altura trust chair in Computer Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Delaët, 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 (2015). https://doi.org/10.1109/NCA.2015.24
Delaët, S., Dolev, S., Khankin, D., Tzur-David, S.: Make&activate-before-break for seamless SDN route updates. Comput. Netw. 147, 81–97 (2018). https://doi.org/10.1016/j.comnet.2018.10.005
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. https://doi.org/10.1109/NCA.2017.8171386
Dinitz, Y., Dolev, S., Khankin, D.: Make&activate-before-break: policy preserving seamless routes replacement in SDN. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 34–37. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01325-7_6
Dolev, S., Khankin, D.: Monitorability bounds via expander, sparsifier and random walks. In: El Abbadi, A., Garbinato, B. (eds.) NETYS 2017. LNCS, vol. 10299, pp. 307–321. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-59647-1_23
Goldschmidt, O., Hochbaum, D.S.: Polynomial algorithm for the k-cut problem. In: 1998 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1988), pp. 444–451 (1988)
Gurobi Optimization: Gurobi optimizer, 2019 (2019). http://www.gurobi.com
Kreutz, D., Ramos, F.M., Verissimo, P.E., Rothenberg, C.E., Azodolmolky, S., Uhlig, S.: Software-defined networking: a comprehensive survey. Proc. IEEE 103(1), 14–76 (2015)
ONF: OpenFlow Switch Specification Ver 1.5.1. Open Networking Foundation. https://www.opennetworking.org/software-defined-standards/specifications/
Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: Substrate support for path splitting and migration. SIGCOMM Comput. Commun. Rev. 38(2), 17–29 (2008). https://doi.org/10.1145/1355734.1355737
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Dinitz, Y., Dolev, S., Frenkel, S., Binun, A., Khankin, D. (2019). Network Cloudification. In: Dolev, S., Hendler, D., Lodha, S., Yung, M. (eds) Cyber Security Cryptography and Machine Learning. CSCML 2019. Lecture Notes in Computer Science(), vol 11527. Springer, Cham. https://doi.org/10.1007/978-3-030-20951-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-20951-3_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20950-6
Online ISBN: 978-3-030-20951-3
eBook Packages: Computer ScienceComputer Science (R0)