Abstract
Nowadays, resource allocation for virtual networks (VNs) is brought as an imperative problem. For the characteristics of virtual networks, multiple virtual networks with different topo can co-exist on a shared infrastructure. A difficult point of problem is how to use the resource effectively and to satisfy the requirement of virtual network request. This problem is NP-hard. In this paper, we introduce a heuristic algorithm to solve this problem. To simulate a virtual network mapping problem in real world, we using two input data: an infrastructure network which is modeled by a connected graph and a set of virtual network request graphs with each graph contains their constraints, time and duration. The main purposes are to maximize the revenue and to minimize the cost when allocate the virtual networks to a substrate network. The experimental results are reported to show the efficiency of propose algorithm comparing to the Enhanced Greedy Node Mapping (EGNM) algorithm.
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
Raihan Rahman, M., Aib, I., Boutaba, R.: Survivable Virtual Network Embedding. In: 9th International IFIP TC 6 Networking Conference Networking 2010, pp. 40–52 (2010)
Tran, H.V., Ngo, S.H.: An enhanced greedy node mapping algorithm for resource allocation in network virtualization, Journal of Science and Technology, 72–77 (2012)
Tran, H.V., Ngo, S.H.: Improved Heuristics for Online Node and Link Mapping Problem in Network Virtualization. In: The 13th International Conference on Computational Science and Applications (ICCSA 2013), pp. 154–165 (June 2013)
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), pp. 17–29 (2008)
Razzaq, A., Hidell, M., Sjodin, P.: Virtual Network Embedding: A Hybrid Vertex Mapping Solution for Dynamic Resource Allocation. Journal of Electrical and Computer Engineering, 1–17 (2012)
Lischka, J., Karl, H.: A virtual network mapping algorithm based on subgraph isomorphism detection. In: The 1st ACM Workshop on Virtualized, Infrastructure Systems and Architectures, VISA 2009, pp. 81–88 (2009)
Chowdhury, N., Rahman, M.R., Boutaba, R.: Virtual network embedding with coordinated node and link mapping. In: IEEE INFOCOM 2009, pp. 783–791 (April 2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Binh, H.T.T., Vinh, B.H., Nhat, N.H., Linh, L.H. (2014). Heuristic Algorithm for Virtual Network Mapping Problem. In: Leung, V., Chen, M., Wan, J., Zhang, Y. (eds) Testbeds and Research Infrastructure: Development of Networks and Communities. TridentCom 2014. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 137. Springer, Cham. https://doi.org/10.1007/978-3-319-13326-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-13326-3_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13325-6
Online ISBN: 978-3-319-13326-3
eBook Packages: Computer ScienceComputer Science (R0)