Abstract
Network Virtualization is claimed to be a key component of the Future Internet by enabling the coexistence of heterogeneous (virtual) networks on the same physical infrastructure, providing the dynamic creation and support of different networks with different paradigms and mechanisms in the same physical network. A major challenge in the dynamic provision of virtual networks resides on the efficient embedding of virtual resources into physical ones. Since this problem is known to be \(\mathcal{NP}\)-hard, previous research focused on designing heuristic-based algorithms; most of them do not consider a simultaneous optimization of the node and the link mapping, leading to non-optimal solutions. This paper proposes an integer linear programming formulation to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping. A link − node formulation is used and the multi-commodity flow constrain is applied. In addition, a heuristic algorithm for virtual network embedding is also proposed and compared against the optimal formulation. The performance of the integer linear programming formulation and of the heuristic is evaluated by means of simulation. Simulation experiments show significant improvements of the virtual network acceptance ratio, in average additional 10% of the virtual network requests are accepted when using the integer linear programming formulation, which corresponds, in average, to more 7 virtual networks accommodated on the physical network.
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
Preview
Unable to display preview. Download preview PDF.
References
Peterson, L., Anderson, T., Culler, D., Roscoe, T.: A blueprint for introducing disruptive technology into the internet. SIGCOMM Comput. Commun. Rev. 33, 59–64 (2003), http://doi.acm.org/10.1145/774763.774772 , doi:http://doi.acm.org/10.1145/774763.774772
Anderson, T., Peterson, L., Shenker, S., Turner, J.: Overcoming the Internet Impasse through Virtualization. Computer 38, 34–41 (2005), http://portal.acm.org/citation.cfm?id=1058219.1058273 , doi:10.1109/MC.2005.136
Feamster, N., Gao, L., Rexford, J.: How to lease the internet in your spare time. SIGCOMM Comput. Commun. Rev. 37(1), 61–64 (2007), http://doi.acm.org/10.1145/1198255.1198265
Zhu, Y., Zhang-Shen, R., Rangarajan, S., Rexford, J.: Cabernet: connectivity architecture for better network services. In: Proceedings of the 2008 ACM CoNEXT Conference, CoNEXT 2008, ACM ID: 1544076, pp. 64:1–64:6. ACM, New York (2008), doi:10.1145/1544012.1544076
Touch, J., Wang, Y.S., Eggert, L., Finn, G.: A virtual internet architecture. ISI Technical Report ISI-TR-2003-570 (2003)
Carapinha, J., Jimnez, J.: Network virtualization: a view from the bottom. In: Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures, pp. 73–80. ACM, Barcelona (2009), http://portal.acm.org/citation.cfm?id=1592648.1592660 , doi:10.1145/1592648.1592660
Melo, M., Sargento, S., Carapinha, J.: Network Virtualisation from an Operator Perspective. In: Proc Conf. sobre Redes de Computadores - CRC (2009)
Chowdhury, N.M.K., Boutaba, R.: Network virtualization: State of the art and research challenges. IEEE Communications Magazine 47(7), 20–26 (2009), http://www.mosharaf.com/wp-content/uploads/nv-overview-commag09.pdf
Zhu, Y., Ammar, M.: Algorithms for assigning substrate network resources to virtual network components. In: Proceedings of 25th IEEE International Conference on Computer Communications, INFOCOM 2006, pp. 1–12 (2006)
Lischka, J., Karl, H.: A virtual network mapping algorithm based on subgraph isomorphism detection. In: VISA 2009: Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures, pp. 81–88. ACM, New York (2009), doi: http://doi.acm.org/10.1145/1592648.1592662
Lu, J., Turner, J.: Efficient mapping of virtual networks onto a shared substrate. Tech. rep., Washington University in St. Louis (2006)
Yu, M., Yi, Y., Rexford, J., Chiang, M.: Rethinking virtual network embedding: Substrate support for path splitting and migration. ACM SIGCOMM Computer Communication Review 38(2), 17–29 (2008)
Chowdhury, N., Rahman, M., Boutaba, R.: Virtual network embedding with coordinated node and link mapping. In: INFOCOM 2009, pp. 783–791. IEEE (2009), doi:10.1109/INFCOM.2009.5061987
Farooq Butt, N., Chowdhury, M., Boutaba, R.: Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding. In: Crovella, M., Feeney, L.M., Rubenstein, D., Raghavan, S.V. (eds.) NETWORKING 2010. LNCS, vol. 6091, pp. 27–39. Springer, Heidelberg (2010)
Nogueira, J., Melo, M., Carapinha, J., Sargento, S.: Virtual network mapping into heterogeneous substrate networks. In: IEEE Symposium on Computers and Communications, ISCC 2011 (2011), http://www.av.it.pt/mmelo/nogueira2011mapping.pdf
Andersen, D.G.: Theoretical approaches to node assignment (2002) (unpublished manuscript)
Houidi, I., Louati, W., Zeghlache, D.: A distributed virtual network mapping algorithm. In: IEEE International Conference on Communications, ICC 2008, pp. 5634–5640 (2008), doi:10.1109/ICC.2008.1056
Wolsey, L.: Integer programming. IIE Transactions 32, 273–285 (2000)
Even, S., Itai, A., Shamir, A.: On the complexity of time table and multi-commodity flow problems. In: 16th Annual Symposium on Foundations of Computer Science, pp. 184–193 (1975)
Pióro, M., Medhi, D., Service), S.O.: Routing, flow, and capacity design in communication and computer networks. Citeseer (2004)
Waxman, B.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988), doi:10.1109/49.12889
IBM ILOG Optimization Products, http://www-01.ibm.com/software/websphere/products/optimization
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Melo, M. et al. (2012). Virtual Network Mapping – An Optimization Problem. In: Pentikousis, K., Aguiar, R., Sargento, S., Agüero, R. (eds) Mobile Networks and Management. MONAMI 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 97. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30422-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-30422-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30421-7
Online ISBN: 978-3-642-30422-4
eBook Packages: Computer ScienceComputer Science (R0)