A Markov Reward Model Based Greedy Heuristic for the Virtual Network Embedding Problem

An ever increasing utility and use of virtualization in various emerging scenarios, e.g.: Cloud Computing, Software Defined Networks, Data Streaming Processing, asks the Infrastructure Providers (InPs) to optimize the allocation of the virtual network requests (VNRs) into a substrate network. In this paper we present a two-stage virtual network embedding (VNE) algorithm, which map first virtual nodes to substrate nodes based on a suitable ranking algorithm and then map link along the shortest paths among the nodes. The key ingredient of our approach is a novel node ranking algorithm, MCRR (Markov Chains with Rewards Ranking), based on Markov Reward Processes, which associates a metric which accounts for and well captures the amount of local resources available in a vicinity of a given node. We have extensively evaluated our algorithm through simulation. Our experiments indicate that our algorithm outperforms previous approaches in terms of lower VNE rejection rate, higher revenues and better resources utilization.

[1]  Robert Ricci,et al.  A solver for the network testbed mapping problem , 2003, CCRV.

[2]  R. Gallager.  Stochastic Processes , 2014 .

[3]  Jonathan S. Turner,et al.  Efficient Mapping of Virtual Networks onto a Shared Substrate , 2006 .

[4]  Minlan Yu,et al.  Rethinking virtual network embedding: substrate support for path splitting and migration , 2008, CCRV.

[5]  Yonggang Wen,et al.  Toward profit-seeking virtual network embedding algorithm via global resource capacity , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[6]  Jie Wu,et al.  An Opportunistic Resource Sharing and Topology-Aware mapping framework for virtual networks , 2012, 2012 Proceedings IEEE INFOCOM.

[7]  Holger Karl,et al.  A virtual network mapping algorithm based on subgraph isomorphism detection , 2009, VISA '09.

[8]  Muhammad Siraj Rathore,et al.  An Approach towards Resource Efficient Virtual Network Embedding , 2010, 2010 2nd International Conference on Evolving Internet.

[9]  Amit Kumar,et al.  Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.

[10]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[11]  Raouf Boutaba,et al.  Topology-Awareness and Reoptimization Mechanism for Virtual Network Embedding , 2010, Networking.

[12]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[13]  Raouf Boutaba,et al.  Virtual Network Embedding with Coordinated Node and Link Mapping , 2009, IEEE INFOCOM 2009.

[14]  Lixin Gao,et al.  How to lease the internet in your spare time , 2007, CCRV.

[15]  J. J. Garcia-Luna-Aceves,et al.  Finding multi-constrained feasible paths by using depth-first search , 2007, Wirel. Networks.

[16]  Xiang Cheng,et al.  Virtual network embedding through topology-aware node ranking , 2011, CCRV.

[17]  Mostafa H. Ammar,et al.  Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[18]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[19]  Yong Zhu,et al.  Algorithms for Assigning Substrate Network Resources to Virtual Network Components , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[20]  Xavier Hesselbach,et al.  Virtual Network Embedding: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[21]  David G. Andersen,et al.  Theoretical Approaches to Node Assignment , 2002 .