A Graph Theoretic Algorithm for Virtual Network Embedding
Cloud computing has emerged as an upcoming platform to provide all types of services to the users. Virtualization is a core activity in Cloud that supports multiple services and virtualization at various levels is supported in Cloud. Network virtualization is an important aspect that gives the network illusion to the users that they can access without bothering about the actual physical network. Virtual network embedding is the problem of mapping the virtual nodes and virtual links of the virtual network to actual physical nodes and links with optimization of certain characteristic parameters. The work, in this paper, addresses the virtual network embedding problem to optimize some characteristic parameters such as running time and residual physical network using graph theory approach. The proposed model has been simulated, for its performance study, and result reveals the efficacy of the proposed method.