Virtual Network Mapping Problem Research Articles

Research on Intelligent Mapping Algorithm of Secure Virtual Network under Cloud Computing

In order to improve the mapping efficiency of network intelligent mapping algorithm, this paper proposes a secure virtual network intelligent mapping algorithm under cloud computing. Firstly, the network virtualization technology is analyzed, and a network virtualization example diagram is proposed. Then the energy consumption model and network load model of virtual network mapping problem are constructed to analyze the mapping reliability. Finally, the virtual network mapping strategy is optimized by cloud computing technology to realize the research on intelligent mapping algorithm of secure virtual network under cloud computing. Experimental results show that the percentage of nodes used by the proposed algorithm is much lower than that of other mapping algorithms compared, and the energy consumption is about 8100RMB/h at 60,000 unit time point, which is much lower than that of other methods, indicating that the proposed algorithm has high mapping efficiency.

Survivable Virtual Network Mapping With Fiber Tree Establishment in Filterless Optical Networks

Filterless Optical Networks (FONs) (i.e., optical networks where switching nodes are solely based on passive splitters and combiners) enjoy features that are highly appreciated by network operators, such as their low cost and their energy efficiency, posing them as an alternative solution to filtered Wavelength-Switched Optical Networks (WSON) based on active switching nodes. Due to FONs’ specific design criteria (the network topology must be divided into link-disjoint filterless fiber trees to avoid laser loops), traditional network problems, such as survivable virtual network mapping, shall be revisited and tackled adopting novel solutions with respect to state-of-the-art filtered WSONs. In this paper, we investigate the problem of survivable virtual network mapping (SVNM) in FONs with the aim of evaluating the cost of survivability when adopting FON technology. We first model the problem as an Integer Linear Program to establish fiber trees and provide survivable mapping of virtual networks, while minimizing cost of additional network equipment and spectrum with respect to WSON. We then propose multiple heuristic and meta-heuristic approaches to tackle large problem instances. In our numerical evaluations, we consider three scenarios: FON, WSON, and FON with pre-established fiber trees. Results show that in FON, where SVNM is jointly optimized with fiber tree establishment, the investment in additional network equipment can be largely minimized, and even avoided in some cases. In contrast, in FON with pre-established trees, amount of additional network equipment needed to guarantee survivability is significant (up to 60% with respect to WSON).

Research on Energy Consumption Optimization Technology of Heterogeneous Network in Computer Communication Industry

In the environment of heterogeneous network nodes, the virtual network mapping problem of energy consumption optimization is not to minimize the number of working nodes and links. In order to study the energy consumption analysis of multi-mode terminals in wireless heterogeneous networks, by investigating the working mechanism of the terminal, using the energy-aware virtual network mapping heuristic algorithm to describe the communication state of the terminal, the energy consumption analysis equation of the terminal is obtained. The analysis results show that terminal energy consumption increases with the increase of call arrival intensity and call duration; the ratio of terminal energy consumption to voice services and the probability of discovering heterogeneous networks are in an approximately linear relationship; the heterogeneous network modules enter low energy consumption the waiting state does not save terminal energy consumption.

RETRACTED: A Global Optimal Mapping Method of Network based on Discrete Optimization Firefly Algorithm

In order to solve the current network rigidity and optimize the resource requirements of multiple virtual networks for synchronous mapping, improve the success rate of virtual network mapping requests, the long-term revenue and overhead ratio of the substrate network, node resource utilization rate and link resource utilization rate. A global optimal mapping method based on discrete optimization firefly algorithm is presented. Analyze the problem of virtual network mapping, map virtual nodes to physical nodes, and map virtual links to physical paths. According to the resource constraints of the virtual network and the substrate network, a multi-objective optimization model of the virtual network mapping is constructed, and the discrete fireflies optimization algorithm is used to obtain the global optimal solution of the virtual network mapping model to achieve the optimal allocation of global resources. The experimental results show that the discrete optimization firefly algorithm has a good performance in solving the virtual network mapping problem, and can effectively improve the virtual network request acceptance rate, node resource utilization rate, link resource utilization rate, and long-term revenue and cost ratio of the substrate network, ensuring Optimization of virtual network resources.

Virtual network mapping in elastic optical networks with sliceable transponders

Emerging inter-datacenter applications involving data transferred, processed, and analyzed at multiple datacenters, such as virtual machine migrations, real-time data backup, remote desktop, and virtual datacenters, can be modeled as virtual network requests that share computing and spectrum resources of a common substrate physical inter-datacenter network. Recent advances make elastic optical networks an ideal candidate for meeting the dynamic and heterogeneous connection demands between datacenters. In this paper, we address the static (offline) version of the virtual network mapping problem in elastic optical networks equipped with sliceable bandwidth variable transponders. The objective is to minimize the total transponder cost in the network. An Integer Linear Programming formulation is presented, lower bounds are derived, and six heuristics are proposed and compared. Simulation results are presented to show the effectiveness of the proposed approaches.

Novel resource allocation mechanism for SDN-based data center networks

With the development of virtualization technologies, Service Providers (SP) can offer services to customers by renting various kinds of hardware resources from Data Centers (DC) instead of purchasing hardware equipment frequently, which not only increases the flexibility, but also decreases the cost. For the multi-tenant DC environment, each SP can be regarded as a DC tenant. Then, the request of each tenant could be abstracted as a Virtual Data Center (VDC) which is implemented by mapping the required virtual nodes and links onto physical servers and optical paths. Such process is also referred to as the VDC mapping, during which the corresponding resources will be allocated. It is aware that the VDC mapping problem is essentially different from the virtual network mapping problem, and the former one is much more complex than the latter one. Therefore, the solution of VDC mapping still faces many challenges. In this work, we focus on addressing the VDC mapping problem with a flexible and efficient resource allocation. Firstly, the concepts of Software Defined Networking (SDN) and Network Function Virtualization (NFV) are both introduced to construct a logically centralized and physically distributed resource allocation framework which decouples the server resource control and the network resource control. In this way, the whole resource allocation process can be managed in a more flexible and targeted way towards achieving high resource utilization. Secondly, a location-aware VDC partition process is introduced before VDC mapping based on the label propagation algorithm, which clusters the virtual nodes of a VDC request according to the communication frequency between any two virtual nodes. Generally, the higher the communication frequency, the more cost will be spent on network resource consumption, such that the virtual nodes clustered in the same group will be mapped onto the same DC to avoid excessive backbone network consumption. Lastly, a cost and security aware VDC mapping mechanism is proposed to address the corresponding resource allocation problem, which aims at minimizing the overall cost with both the basic resource constraints, mapping constraints, the wavelength continuity constraint and the security constraint taken into consideration. The experiment indicates that the proposed mechanism can decrease the overall VDC mapping cost by about 10%–25%, and increases the VDC acceptance rate and the total revenue by up to 34% and 71% respectively compared to the state-of-the-art benchmarks.

A Virtual Network Resource Allocation Model Based on Dynamic Resource Pricing

The key to network virtualization technology is virtual network mapping, which has been proven to be an NP-hard problem. At present, the methods to solve the problem of virtual network mapping still have the following defects. Most of the existing literature is limited to static virtual network (VN) mapping and static linear resource pricing, which rely on peak allocation and don't meet the user dynamic resource requirements. Therefore, this paper proposes a virtual network resource allocation model based on dynamic resource pricing named GSO-RBFDM. Firstly, group search optimization (GSO) is used to optimize the node mapping scheme during the network mapping process to reduce the cost of network mapping. Secondly, a dynamic nonlinear resource pricing model is established, and genetic algorithm (GA) is used to more accurately search a low-cost network mapping path instead of the traditional Dijkstra algorithm. Finally, virtual network dynamic modeling is performed according to the user dynamic resource requirements, and radial basis function (RBF) is used to predict resource requirements to realize the dynamic resource allocation to users. Simulation results show that, compared with traditional virtual network mapping algorithms, GSO-RBFDM can not only realize dynamic resource allocation, but also show good performance in terms of acceptance rate, network cost, link pressure and average network revenue.

Dynamic resource allocation algorithm of virtual networks in edge computing networks

The deployment and allocation of network resources are important in the application of edge computing. As an important resource allocation technology in edge computing, network virtualization faces the challenge of the virtual network mapping problem. Most existing studies are limited to static resource allocation, ignoring the time-varying properties of user resource demands, which results in wasted resources. Since user resource demands vary over time, resource allocation with predictive mechanism is a promising solution. However, there are few studies on the application of predictive algorithm as radial basis function network (RBF) algorithms in virtual network dynamic resource allocation. In addition, due to the excessive use of hidden RBF units, this method suffers from expensive inner product calculations and long training times. In this paper, we propose a dynamic network resource demand predicting algorithm based on the group search optimizer (GSO) and incremental design of the RBF (GSO-INC-RBFDM). In the network mapping, the GSO is first used to optimize the node solution. Then, the incremental design is utilized to eliminate the maximum error value and reduce the inner product calculation and training time by adding the RBF unit one by one. Finally, we apply the improved RBF to predict the user demand and reallocate resources based on the predicted results. Simulation results shows that the GSO-INC-RBFDM demonstrates good performance in terms of the acceptance rate, network cost, link pressure and average revenue compared with traditional algorithms.

Application of Improved Multi-Objective Bacterial Foraging Algorithm in Virtual Network Mapping Algorithm

For the virtual network mapping problem, consideration of many aspects will be more comprehensive. In this paper, the multi-objective bacterial foraging optimization algorithm is improved to solve this problem. First, because the virtual network mapping problem is a discrete problem, the operator of the algorithm is redefined as discrete; secondly, the resource congestion factor and 2-opt algorithm are introduced in the chemotaxis operation of the algorithm, and the cross-factor is introduced in the copy operation, so that the found solution is better. At the same time, the node resource load balance degree and the minimum cost are used as the fitness function, so that the found solution solves the problem more. The experimental results show that the algorithm is used to solve the virtual network mapping problem. The algorithm has good validity and stability in both large-scale virtual network requests and standard cases.

Drawing the Cloud Map: Virtual Network Provisioning in Distributed Cloud Computing Data Centers

Efficient virtualization methodologies constitute the core of cloud computing data center implementation. Clients are attracted to the cloud model by its ability to scale the resources dynamically and the flexibility in payment options that it offers. However, performance hiccups may push them to go back to the buy-and-maintain model. Virtualization plays a key role in the synchronous management of the thousands of servers along with clients' data living on them. To achieve seamless virtualization, cloud providers require a system that performs the function of virtual network provisioning. This includes receiving the cloud client requests and allocating their computational and network resources in a way that guarantees the quality-of-service conditions for clients while maximizing the data center resource utilization and providers' revenue. We introduce a comprehensive system to solve the problem of virtual network mapping for a set of connection requests sent by cloud clients. Connections are collected in time intervals called windows. Consequently, node and link provisioning is performed. Different window size selection schemes are introduced and evaluated. Three schemes to prioritize connections are used, and their effect is assessed. Moreover, a technique dealing with connections spanning over more than a window is introduced. The proposed algorithm is compared with previous work well known in the literature. Simulation results show that the dynamic window size algorithm achieves cloud service providers' objectives in terms of generated revenue, served-connection ratio, resource utilization, and computational overhead. In addition, experimental results show that handling spanning connections independently improves the performance of the system.

A heuristic survivable virtual network mapping algorithm

Network virtualization is a promising solution to attack Internet ossification. Virtual network mapping (or embedding) problem is the core of it and is proved to be NP-hard. In this paper, virtual network mapping problem with survivability is formulated and solved with a heuristic algorithm. Firstly, network link resources are divided into primary flow resources and secondary flow resources. The former are used under normal network operation, whereas the latter are used as backup resources once the networks fail. Secondly, we introduce a novel metric named global resource capacity (GRC) which is recently proposed for measuring node mapping capacity to improve network load balance. At last, a heuristic survivable virtual network embedding algorithm (GRC-SVNE) is proposed. In node mapping phase, we calculate the mapping capacity of all nodes and then some nodes are selected as candidate nodes for virtual network embedding and the goal is to improve mapping successful ratio. After that, link mapping is performed with Dijkstra algorithm. Simulation results show that GRC-SVNE outperforms the traditional greedy algorithm (GREEDY), randomized algorithm (R-ViNE) as well as deterministic algorithm (D-ViNE) and demonstrates desirable results in terms of acceptance ratio, network load balance and network revenue.

A Multidomain Survivable Virtual Network Mapping Algorithm

Although the existing networks are more often deployed in the multidomain environment, most of existing researches focus on single-domain networks and there are no appropriate solutions for the multidomain virtual network mapping problem. In fact, most studies assume that the underlying network can operate without any interruption. However, physical networks cannot ensure the normal provision of network services for external reasons and traditional single-domain networks have difficulties to meet user needs, especially for the high security requirements of the network transmission. In order to solve the above problems, this paper proposes a survivable virtual network mapping algorithm (IntD-GRC-SVNE) that implements multidomain mapping in network virtualization. IntD-GRC-SVNE maps the virtual communication networks onto different domain networks and provides backup resources for virtual links which improve the survivability of the special networks. Simulation results show that IntD-GRC-SVNE can not only improve the survivability of multidomain communications network but also render the network load more balanced and greatly improve the network acceptance rate due to employment of GRC (global resource capacity).

Survivable Virtual Topology Design in Multi-domain Optical Networks

We consider the problem of survivable virtual network mapping in a multi-domain optical network with the objective of minimizing total network link cost for a given virtual traffic demand. The survivability constraint guarantees the connectivity of virtual nodes after any single optical link failure. We propose a hierarchical software-defined networking-based control plane to exchange information between domains, and we propose heuristic approaches for mapping virtual links onto multi-domain optical links using partition and contraction mechanisms on the virtual topology. We provide an integer linear programming formulation to compare with our heuristic approaches. Numerical results show that our heuristic approach is effective in reducing total network cost and increasing the successful mapping rate.

A memetic algorithm for the virtual network mapping problem

The Internet has ossified. It has lost its capability to adapt as requirements change. A promising technique to solve this problem is the introduction of network virtualization. Instead of directly using a single physical network, working just well enough for a limited range of applications, multiple virtual networks are embedded on demand into the physical network, each of them perfectly adapted to a specific application class. The challenge lies in mapping the different virtual networks with all the resources they require into the available physical network, which is the core of the virtual network mapping problem. In this work, we introduce a memetic algorithm that significantly outperforms the previously best algorithms for this problem. We also offer an analysis of the influence of different problem representations and in particular the implementation of a uniform crossover for the grouping genetic algorithm that may also be interesting outside of the virtual network mapping domain. Furthermore, we study the influence of different hybridization techniques and the behaviour of the developed algorithm in an online setting.

Survivable Impairment-Constrained Virtual Optical Network Mapping in Flexible-Grid Optical Networks

In this paper, we study the problem of survivable impairment-constrained virtual optical network mapping in flexible-grid optical networks (SIC-VONM). The objective is to minimize the total cost of working and backup resources, including transponders, regenerators, and shared infrastructure, for a given set of virtual optical networks, which can survive single link failures. We first provide the problem definition of SIC-VONM, and then formulate the problem as an integer linear program (ILP). We also develop a novel heuristic algorithm, together with a baseline algorithm and a lower bound for comparison. Numerical results show that our proposed heuristic achieves results that are very close to those of the ILP for small-scale problems and that our proposed heuristic can solve large-scale problems very well.

Survivable provisioning for multicast service oriented virtual network requests in cloud-based data centers

Network virtualization technology plays an important role in cloud-based data centers that serve as an effective method for provisioning a flexible and highly adaptable shared substrate network to satisfy the demands of various applications. Although there has been some work on efficient mapping of unicast service oriented virtual networks there has been very limited work on addressing the problem of efficient mapping of multicast oriented virtual networks. Furthermore, how to guarantee survivability of multicast service oriented virtual network request has not been studied.In this work, we investigate the survivable multicast service oriented virtual network mapping (SMVNM) problem and propose an efficient algorithm for solving this problem. We first formulate the SMVNM problem with the objective of minimizing mapping cost by using mixed integer linear programming. We then design an efficient algorithm to solve this problem since it is NP-hard. We validate and evaluate our framework and algorithms by conducting extensive simulations on different realistic networks under various scenarios, and by comparing with existing approaches. The simulation results show that our approach outperforms existing solutions.

Research and Development of Virtual Network Mapping Problem

随着互联网的快速发展,现有的互联网架构已经难以满足互联网新型应用的发展,在一定程度上呈现出僵化现象.网络虚拟化被认为是解决网络僵化问题的重要途径,其中的虚拟网络映射问题研究如何将具有虚拟节点和虚拟链路约束的虚拟网络映射到基础设施网络中.首先给出了虚拟网络映射问题的形式化定义,分析了虚拟网络映射问题面临的挑战性和求解目标;其次,对各种虚拟网络映射问题的求解方法加以分类,在分类的基础上,介绍了各种典型的求解方法并进行了对比;最后总结了各种虚拟网络映射问题求解方法,并指出了未来的研究趋势.;With the rapid development of Internet, it has been difficult for existing network architecture to meet the development of new applications, and ossification has grown to some extent. Network virtualization is considered to be the main means of solving the ossification problem. In network virtualization, virtual network mapping problem researches how to map virtual networks with nodes and links’ constraints to substrate network, which is surveyed in this paper. First, a formal definition of virtual network mapping problem is proposed, which is used to describe the problem in abstraction level. Meanwhile, challenges and solving goals of the problem are also investigated. Second classification of solving methods for this problem is analyzed, and, on the basis of the classification, many typical solving methods are introduced and compared. Finally, future research trends of the solving methods for this problem are reviewed.

Hierarchical virtual network mapping algorithm for large-scale network virtualisation

Virtual network(VN) mapping deals with the allocation of network resources from the shared physical substrate to individual VNs is one of the key challenges for the application of realising network virtualisation. Whereas a variety of state-of-the-art algorithms have attempted to address this issue from different aspects, the challenge still remains for mapping VNs across multiple network domains which only maintain partial information of the overall substrate network. A novel hierarchical algorithm to address this issue by formulating such VN mapping problem as a hierarchical linear programme model has been presented. Through the use of the primal decomposition and subgradient optimisation technique, in conjunction with the proposed hierarchical algorithm, the substrate network resource can be appropriately allocated to the VN instances with enhanced scalability, because of the parallelism in individual domains. In addition, the algorithm could find the best trade-off between the number of optimisation iterations (computation time) and cost by selecting an appropriate number of iterations. The proposed method has been assessed through a collection of numerical simulation experiments for a range of network scenarios and the result shows that nearly optimal performance as well as improved VN mapping request acceptance ratio and revenue can be achieved.

Virtual Network Mapping Model and Optimization Algorithms

PDF HTML阅读 XML下载 导出引用 引用提醒 虚拟网络映射模型及其优化算法 DOI: 10.3724/SP.J.1001.2012.04063 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: 国家自然科学基金(61070198, 60903040, 61170288); 国家重点基础研究发展计划(973)(2007CB310901) Virtual Network Mapping Model and Optimization Algorithms Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:网络虚拟化被视为构建新一代互联网体系架构的重要技术,它使得能在一个共享的底层物理网络上同时运行多个网络架构或网络应用,从而能为用户提供多样化的端到端定制服务.虚拟网络映射是实现网络虚拟化的关键环节,其目的是在满足虚拟网络资源需求的前提下,将虚拟网络植入到合适的底层物理节点和链路.虚拟网络映射需要解决资源约束、准入控制、在线请求和拓扑多样性等多方面的问题.根据应用场景、优化目标、映射方式和约束条件的不同,可以得到不同类型的虚拟网络映射优化问题.这些优化问题通常是NP 难的.通过形式化建立了虚拟网络映射模型,归纳了虚拟网络映射的方法和算法.总结了解决虚拟网络映射模型优化问题的几条技术途径,指出了该领域中需要进一步研究的热点问题. Abstract:Network virtualization can serve as the important technology for constructing the next-generation Internet architecture. It has been proposed as a powerful vehicle for running multiple architectures or experiments simultaneously on a shared infrastructure. It allows multiple service providers to offer customized end-to-end services over a common physical infrastructure. Virtual network embedding is a critical step for network virtualization that deals with the efficient mapping of virtual nodes and virtual links onto the substrate network resources. The virtual network-mapping problem is extremely challenging for four main practical reasons: Node and link constraints, admission control, online request, and diverse topologies. Due to different application scenarios, optimization objectives, mapping approaches, and constraints, there are many virtual network-mapping models. Unfortunately, the optimization problems of these models are generally NP-hard. The model of virtual network mapping is presented. The virtual network mapping methods and algorithms are concluded. The technological approaches to solve the optimization problems of the virtual network mapping are summarized. Finally, some open issues are presented to be further studied in the virtual network-mapping field. 参考文献 相似文献 引证文献

Topology awareness algorithm for virtual network mapping

Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).