Abstract
Perceived to be one of the cornerstones of the emerging next generation (5G) networks, Network slicing enables the accommodation of multiple logical networks with diverse performance requirements on a common substrate platform. Of particular interest among different facets of network slicing is the problem of designing an individual network slice tailored specifically to match the requirements of the big-bandwidth next generation network services. In this work, we present an exact formulation for the network slice design problem under traffic uncertainty. As the considered mathematical formulation is known to pose a high degree of computational difficulty to state-of-the-art commercial mixed integer programming solvers owing to the inclusion of robust constraints, we propose a meta-heuristic based on ant colony optimisation algorithms for the robust network slice design problem. Experimental evaluation conducted on realistic network topologies from SNDlib reveals that the proposed meta-heuristic can indeed be an efficient alternative to the commercial mixed integer programming solvers.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
As large coefficients are known to pose some problems at various stages of the solution process in CPLEX, the capacities and demands were scaled down by a factor of 1 Gbps, and the costs by EUR 1000.
References
Afolabi, I., Taleb, T., Samdanis, K., Ksentini, A., Flinck, H.: Network slicing and softwarization: a survey on principles, enabling technologies, and solutions. IEEE Commun. Surv. Tutor. 20(3), 2429–2453 (2018). Thirdquarter
Barcelo, M., Llorca, J., Tulino, A.M., Raman, N.: The cloud service distribution problem in distributed cloud networks. In: 2015 IEEE International Conference on Communications (ICC), pp. 344–350, June 2015
Baumgartner, A., Bauschert, T., D’Andreagiovanni, F., Reddy, V.S.: Towards robust network slice design under correlated demand uncertainties. In: ICC 2018–2018 IEEE International Conference on Communications, pp. 1–7, May 2018
Bauschert, T., Reddy, V.S.: Genetic algorithms for the network slice design problem under uncertainty. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, pp. 360–361. ACM, New York (2019)
Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35–53 (2004)
Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65–98 (2017)
Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 34(2), 1161–1172 (2004)
Blum, C.: Ant colony optimization: introduction and recent trends. Phys. Life Rev. 2(4), 353–373 (2005)
Bsing, C., D’Andreagiovanni, F.: New results about multi-band uncertainty in robust optimization. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 63–74. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30850-5_7
Coniglio, S., Koster, A., Tieves, M.: Data uncertainty in virtual network embedding: robust optimization and protection levels. J. Netw. Syst. Manage. 24(3), 681–710 (2016). https://doi.org/10.1007/s10922-016-9376-x
D’Andreagiovanni, F., Krolikowski, J., Pulaj, J.: A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods. Appl. Soft Comput. 26, 497–507 (2015)
D’Andreagiovanni, F., Mett, F., Nardin, A., Pulaj, J.: Integrating LP-guided variable fixing with MIP heuristics in the robust design of hybrid wired-wireless FTTx access networks. Appl. Soft Comput. 61, 1074–1087 (2017)
Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29–41 (1996)
Dorigo, M., Blum, C.: Ant colony optimization theory: a survey. Theoret. Comput. Sci. 344(2), 243–278 (2005)
Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295–320 (2017)
Esposito, F., Matta, I., Ishakian, V.: Slice embedding solutions for distributed service architectures. ACM Comput. Surv. 46(1), 6:1–6:29 (2013)
ETSI White Paper: Network functions virtualisation: an introduction, benefits, enablers, challenges and call for action. Technical report, October 2012
Fischer, A., Botero, J.F., Beck, M.T., de Meer, H., Hesselbach, X.: Virtual network embedding: a survey. IEEE Commun. Surv. Tutor. 15(4), 1888–1906 (2013, Fourth)
Foukas, X., Patounas, G., Elmokashfi, A., Marina, M.K.: Network slicing in 5G: survey and challenges. IEEE Commun. Mag. 55(5), 94–100 (2017)
Gouveia, L., Leitner, M., Ruthmair, M.: Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102, 22–38 (2019)
Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. Comput. 11(4), 358–369 (1999)
Mijumbi, R., Serrat, J., Gorricho, J., Bouten, N., De Turck, F., Boutaba, R.: Network function virtualization: state-of-the-art and research challenges. IEEE Commun. Surv. Tutor. 18(1), 236–262 (2016). Firstquarter
NGMN Alliance: 5G White Paper. Technical report, February 2015
Ordonez-Lucena, J., Ameigeiras, P., Lopez, D., Ramos-Munoz, J.J., Lorca, J., Folgueira, J.: Network slicing for 5G with SDN/NFV: concepts, architectures, and challenges. IEEE Commun. Mag. 55(5), 80–87 (2017)
Orlowski, S., Wessäly, R., Pióro, M., Tomaszewski, A.: SNDlib 1.0—survivable network design library. Networks 55(3), 276–286 (2010)
Soenen, T., Banerjee, R., Tavernier, W., Colle, D., Pickavet, M.: Demystifying network slicing: from theory to practice. In: 2017 IFIP/IEEE Symposium on Integrated Network and Service Management (IM), pp. 1115–1120, May 2017
Stützle, T., Hoos, H.H.: \(\cal{MAX}-\cal{MIN}\) ant system. Fut. Gener. Comput. Syst. 16(8), 889–914 (2000)
\(\text{CPLEX}\ \text{ User's }\ \text{ Manual }\): IBM ILOG CPLEX Optimization Studio (2017)
Vassilaras, S., et al.: The algorithmic aspects of network slicing. IEEE Commun. Mag. 55(8), 112–119 (2017)
Yen, J.Y.: An algorithm for finding shortest routes from all source nodes to a given destination in general networks. Q. Appl. Math. 27(4), 526–530 (1970)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Bauschert, T., Reddy, V.S. (2020). A Fast, Scalable Meta-Heuristic for Network Slicing Under Traffic Uncertainty. In: Castillo, P.A., Jiménez Laredo, J.L., Fernández de Vega, F. (eds) Applications of Evolutionary Computation. EvoApplications 2020. Lecture Notes in Computer Science(), vol 12104. Springer, Cham. https://doi.org/10.1007/978-3-030-43722-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-43722-0_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-43721-3
Online ISBN: 978-3-030-43722-0
eBook Packages: Computer ScienceComputer Science (R0)