A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Xen and the art of virtualization
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
Network virtualization: state of the art and research challenges
IEEE Communications Magazine
An Approach towards Resource Efficient Virtual Network Embedding
INTERNET '10 Proceedings of the 2010 2nd International Conference on Evolving Internet
Hi-index | 0.00 |
Network virtualization is a promising solution that can prevent network ossification by allowing multiple heterogeneous virtual networks (VNs) to cohabit on a shared substrate network. It provides flexibility and promotes diversity. A key issue that needs to be addressed in network virtualization is allocation of substrate resources for the VNs with respect to their resource requirements and the topologies of the substrate and virtual networks, namely the VN mapping (VNM) problem. Efficient VNM algorithms aim to maximize the number of coexisting VNs, and increase the utilization and revenue obtained from the substrate resources. In this paper, we present an online VNM algorithm (OVNM) that maximizes the number of coexisting VNs leading to good utilization and revenue of the substrate. Using the OVNM algorithm, we estimate the VN mapping and evaluate the associated substrate resources to map the VN within a proper region on the substrate by using the FVN_Sort (first virtual node sorting) function. This improves the probability of a VN mapping success. Furthermore, by mapping the virtual nodes and links in a coordinated fashion, the resource consumption while mapping is minimized. We evaluate the performance of our approach by using simulation, and show that the algorithm has an acceptable run time and leads to a better blocking probability performance, which means more coexisting VNs.