Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Approach towards Resource Efficient Virtual Network Embedding
INTERNET '10 Proceedings of the 2010 2nd International Conference on Evolving Internet
Virtual network embedding through topology-aware node ranking
ACM SIGCOMM Computer Communication Review
A Network Virtualization Framework for IP Infrastructure Provisioning
CLOUDCOM '11 Proceedings of the 2011 IEEE Third International Conference on Cloud Computing Technology and Science
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Resource allocation in the network operator's cloud: A virtualization approach
ISCC '12 Proceedings of the 2012 IEEE Symposium on Computers and Communications (ISCC)
| Hi-index | 0.00 |
Network virtualization has received considerable attention recently because a Cloud Provider (CP) that is responsible for deploying a substrate network in the cloud infrastructure uses network virtualization to support multiple Virtual Network (VN) requests over the shared substrate network. However, mapping multiple VN requests with constraints on virtual nodes and virtual links into a shared substrate network presents a significant challenge, and is considered an NP-hard problem. In this paper, we propose a heuristic mapping algorithm that handles online VN requests. The node mapping algorithm selects a substrate node for mapping that satisfies both a virtual node's resource requirement and its amount of requested bandwidth. The link mapping algorithm either maps a virtual link to the shortest substrate path that satisfies the requested bandwidth of the virtual link or uses the cut-shortest path approach to map a virtual link to multiple substrate paths that satisfy the requested bandwidth of the virtual link. The path migration algorithm migrates virtual links to different substrate paths to maximize the number of accepted VN requests in a substrate network. Simulation results show that the proposed heuristic mapping algorithm uses resources more efficiently, produces more revenue, and has better performance than existing mapping approaches.