Virtual network embedding through topology-aware node ranking

Abstract

a c m s i g c o m m ABSTRACTVirtualizing and sharing networked resources have become a growing trend that reshapes the computing and networking architectures. Embedding multiple virtual networks (VNs) on a shared substrate is a challenging problem on cloud computing platforms and large-scale sliceable network testbeds.In this paper we apply the Markov Random Walk (RW) model to rank a network node based on its resource and topological attributes. This novel topology-aware node ranking measure reflects the relative importance of the node. Using node ranking we devise two VN embedding algorithms. The first algorithm maps virtual nodes to substrate nodes according to their ranks, then embeds the virtual links between the mapped nodes by finding shortest paths with unsplittable paths and solving the multi-commodity flow problem with splittable paths. The second algorithm is a backtracking VN embedding algorithm based on breadth-first search, which embeds the virtual nodes and links during the same stage using node ranks. Extensive simulation experiments show that the topology-aware node rank is a better resource measure and the proposed RW-based algorithms increase the long-term average revenue and acceptance ratio compared to the existing embedding algorithms.

On the Optimal Approach of Survivable Virtual Network Embedding in Virtualized SDN

“…However, the existing related works do not sufficiently take into consideration of network topology, although some of the existing work [19], [20] refer to the attributes of network topology and justly use capacity and bandwidth to assess the importance of node or link. For taking full advantage of the topological properties and improving the acceptance rate and increasing revenue, we, based on the network topology, further make use of the impact of the links and nodes with other adjacent to estimate the importance of the node/link and apply multipath to reduce the network bandwidth fragmentation and optimize the utilization of network bandwidth in this paper.…”

Traffic Management for Cloud Federation

“…In contrast, other works try to reduce computational complexity by performing those tasks in distinct phases [28,29].…”

Multi-objective placement of virtual network function chains in 5G

“…In addition to the resource utilization cost (i.e., the amount of resources that would be allocated for a VNF or a chain) [11], the cost of CPU/memory/link unit, i.e., κ c (p)/κ c (p)/κ c (p), by itself may vary from a location to another one [10]. For example, the cost of resource unit could vary according to the virtualization environment, cell site rent or the electricity consumption of the site.…”