The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SD...The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.展开更多
Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Intern...Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.展开更多
Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been w...Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.展开更多
Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in net...Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.展开更多
In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual ne...In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.展开更多
Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuris...Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.展开更多
Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One ...Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.展开更多
The virtual network embedding/mapping problem is a core issue of network virtualization. It is concerned mainly with how to map virtual network requests to the substrate network efficiently. There are two steps in thi...The virtual network embedding/mapping problem is a core issue of network virtualization. It is concerned mainly with how to map virtual network requests to the substrate network efficiently. There are two steps in this problem: node mapping and link mapping. Current studies mainly focus on developing heuristic algorithms, since both steps are computationally intractable. In this paper, we propose a new algorithm based on the proximity principle, which considers the distance factor besides the capacity factor in the node mapping step. Thus, the two steps of the embedding problem can be better integrated and the substrate network resource can be used more efficiently. Simulation results show that the new algorithm greatly enhances the performance of the revenue/cost (R/C) ratio, acceptance ratio, and runtime of the embedding problem.展开更多
The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex vi...The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.展开更多
Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtua...Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtual nodes and virtual edges onto substrate networks. Previous research has presented several heuristic algorithms, which fail to consider that the attributes of the substrate topology and virtual net- works affect the embedding process. In this paper, for the first time, we introduce complex network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering of the attributes of nodes and edges in the topology, our studies are more reasonable than existing work. In addition, with the guidance of topology quantitative evalua- tion, the proposed network embedding approach largely improves the network utilization efficiency and decreases the embedding complexity. We also investigate our algorithms on real network topologies (e.g., AT&T, DFN) and random network topologies. Experimental results demonstrate the usability and capability of the proposed approach.展开更多
As a great challenge of network virtualization, virtual network embedding/mapping is increasingly important. It aims to successfully and efficiently assign the nodes and links of a virtual network (VN) onto a shared...As a great challenge of network virtualization, virtual network embedding/mapping is increasingly important. It aims to successfully and efficiently assign the nodes and links of a virtual network (VN) onto a shared substrate network. The problem has been proved to be NP-hard and some heuristic algorithms have been proposed. However, most of the algorithms use only the local information of a node, such as CPU capacity and bandwidth, to determine how to map a VN, without considering the top- ological attributes which may pose significant impact on the performance of the embedding. In this paper, a new embedding algorithm is proposed based on real-time topological attributes. The concept ofbetweenness centrality in graph theory is borrowed to sort the nodes of VNs, and the nodes of the substrate network are sorted according to the correlation properties between the former selected and unselected nodes. In this way, node mapping and link mapping can be well coupled. A simulator is built to evaluate the performance of the proposed virtual network embedding (VNE) algorithm. The results show that the new algorithm significantly increases the revenue/cost (R/C) ratio and acceptance ratio as well as reduces the runtime.展开更多
Network virtualization is a promising approach for resource management that allows customized Virtual Networks (VNs) to be multiplexed on a shared physical infrastructure. A key function that network virtualization ...Network virtualization is a promising approach for resource management that allows customized Virtual Networks (VNs) to be multiplexed on a shared physical infrastructure. A key function that network virtualization can provide is Virtual Network Embedding (VNE), which maps virtual networks requested by users to a shared substrate network maintained by an Internet service provider. Existing research has worked on this, but has primarily focused on maximizing the revenue of the Internet service provider. In this paper, we consider energy-aware virtual network embedding, which aims at minimizing the energy consumption for embedding virtual networks in a substrate network. In our optimization model, we consider energy consumption of both links and nodes. We propose an efficient heuristic to assign virtual nodes to appropriate substrate nodes based on priority, where existing activated nodes have higher priority for hosting newly arrived virtual nodes. In addition, our proposed algorithm can take advantage of activated links for embedding virtual links so as to minimize total energy consumption. The simulation results show that, for all the cases considered, our algorithm can improve upon previous work by an average of 12.6% on acceptance rate, while the consumed energy can be reduced by 12.34% on average.展开更多
Network virtualization is a promising way to overcome the current ossification of the Intemet. It is essential challenge to find effective, efficient and robust embedding algorithms for recovering virtual network. The...Network virtualization is a promising way to overcome the current ossification of the Intemet. It is essential challenge to find effective, efficient and robust embedding algorithms for recovering virtual network. The virtual network mapping algorithm based on integer programming which was proposed months ago. But it did consider the faults of physical network resources, which is so called survivable virtual network embedding (VNE) problem. Previous strategies for enabling survivability in network virtualization focused on providing protection for the physical network or enhancing the virtual networks by providing backup physical resources in advance, and treated all the physical failures as link failures. In the article, a dynamic recovery method is proposed to solve the survivable virtual network embedding problem based on the integer programming VNE algorithm. The dynamic recovery method doesn't need to backup physical resources and it makes more substrate resources which can be used in the embedding. The dynamic recovery process will be activated only when physical failures occur. Different algorithms are used to recovery node and link failures. Simulations show that the method helps to recover almost all of physical failures by finding the substitute nodes and paths, and its performance is very close to that of pure VNE method without considering physical failures.展开更多
The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(...The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(VNE)is a key part.However,existing VNE algorithms cannot be optimally adopted in the virtualization of ATN due to the complex interference in aircombat field.In this context,a highly reliable VNE algorithm based on the transmission rate for ATN virtualization(TR-ATVNE)is proposed to adapt well to the specific electromagnetic environment of ATN.Our algorithm coordinates node and link mapping.In the node mapping,transmission-rate resource is firstly defined to effectively evaluate the ranking value of substrate nodes under the interference of both environmental noises and enemy attacks.Meanwhile,a feasible splitting rule is proposed for path splitting in the link mapping,considering the interference between wireless links.Simulation results reveal that our algorithm is able to improve the acceptance ratio of virtual network requests while maintaining a high revenue-to-cost ratio under the complex electromagnetic interference.展开更多
Currently, the elastic interconnection has realized the high-rate data transmission among data centers(DCs). Thus, the elastic data center network(EDCN) emerged. In EDCNs, it is essential to achieve the virtual networ...Currently, the elastic interconnection has realized the high-rate data transmission among data centers(DCs). Thus, the elastic data center network(EDCN) emerged. In EDCNs, it is essential to achieve the virtual network(VN) embedding, which includes two main components: VM(virtual machine) mapping and VL(virtual link) mapping. In VM mapping, we allocate appropriate servers to hold VMs. While for VL mapping,an optimal substrate path is determined for each virtual lightpath. For the VN embedding in EDCNs, the power efficiency is a significant concern, and some solutions were proposed through sleeping light-duty servers.However, the increasing communication traffic between VMs leads to a serious energy dissipation problem, since it also consumes a great amount of energy on switches even utilizing the energy-efficient optical transmission technique. In this paper, considering load balancing and power-efficient VN embedding, we formulate the problem and design a novel heuristic for EDCNs, with the objective to achieve the power savings of servers and switches. In our solution, VMs are mapped into a single DC or multiple DCs with the short distance between each other, and the servers in the same cluster or adjacent clusters are preferred to hold VMs. Such that, a large amount of servers and switches will become vacant and can go into sleep mode. Simulation results demonstrate that our method performs well in terms of power savings and load balancing. Compared with benchmarks, the improvement ratio of power efficiency is 5%–13%.展开更多
As a key technology to realize smart services of Internet of Things(IoT), network virtualization technology can support the network diversification and ubiquity, and improve the utilization rate of network resources...As a key technology to realize smart services of Internet of Things(IoT), network virtualization technology can support the network diversification and ubiquity, and improve the utilization rate of network resources. This paper studies the service-ori- ented network virtualization architecture for loT services. Firstly the semantic description method for loT services is proposed, then the resource representation model and resource management model in the environment of network virtualization are presented. Based on the above models, the service-oriented virtual network architecture for loT is established. Finally, a smart campus system is designed and deployed based on the service-oriented virtual network architecture. Moreover, the proposed architecture and models are verified in experiments.展开更多
In recent years,satellite networks have been proposed as an essential part of next-generation mobile communication systems.Software defined networking techniques are introduced in satellite networks to handle the grow...In recent years,satellite networks have been proposed as an essential part of next-generation mobile communication systems.Software defined networking techniques are introduced in satellite networks to handle the growing challenges induced by time-varying topology,intermittent inter-satellite link and dramatically increased satellite constellation size.This survey covers the latest progress of software defined satellite networks,including key techniques,existing solutions,challenges,opportunities,and simulation tools.To the best of our knowledge,this paper is the most comprehensive survey that covers the latest progress of software defined satellite networks.An open GitHub repository is further created where the latest papers on this topic will be tracked and updated periodically.Compared with these existing surveys,this survey contributes from three aspects:(1)an up-to-date SDN-oriented review for the latest progress of key techniques and solutions in software defined satellite networks;(2)an inspiring summary of existing challenges,new research opportunities and publicly available simulation tools for follow-up studies;(3)an effort of building a public repository to track new results.展开更多
Network virtualization is important for elastic optical networks(EONs)because of more flexible service provisioning.To ensure guaranteed quality of service(QoS)for each virtual elastic optical network(VEON),clients us...Network virtualization is important for elastic optical networks(EONs)because of more flexible service provisioning.To ensure guaranteed quality of service(QoS)for each virtual elastic optical network(VEON),clients usually request network resources from a network operator based on their bandwidth requirements predicted from historical traffic demands.However,this may not be efficient as the actual traffic demands of users always fluctuate.To tackle this,we propose a new VEON service provisioning scheme,called SATP,which consists of three stages,i.e.,spectrum assignment(SA),spectrum trading(ST),and spectrum purchasing(SP).Unlike conventional once-for-all VEON service provisioning approaches,the SATP scheme first allocates spectrum resources to VEONs according to their predicted bandwidth requirements with a satisfaction ratio α(0<α≤1).Then,to minimize service degradation on VEONs which are short of assigned spectra for their peak traffic periods,the scheme allows VEONs to trade spectra with each other according to their actual bandwidth requirements.Finally,it allows VEON clients to purchase extra spectrum resources from a network operator if the spectrum resources are still insufficient.To optimize this entire process,we formulate the problem as a mixed integer linear programming(MILP)model and also develop efficient heuristic algorithms for each stage to handle large test scenarios.Simulations are conducted under different test conditions for both static and dynamic traffic demand scenarios.Results show that the proposed SATP scheme is efficient and can achieve significant performance improvement under both static and dynamic scenarios.展开更多
The virtual network embedding/mapping problem is a core issue of the network virtualization. It's mainly concerned with how to map virtual network requests to the substrate network efficiently. Previous researches ma...The virtual network embedding/mapping problem is a core issue of the network virtualization. It's mainly concerned with how to map virtual network requests to the substrate network efficiently. Previous researches mainly focus on developing heuristic algorithms for general topology virtual network request. In this paper, we propose a new algorithm for the hub-and-spoke (HAS) topology virtual request. The characters of the HAS topology are exploited to develop the new algorithm. The simulation results show that the new algorithm greatly enhances the performance of revenue/cost (R/C) ratio while the HAS topology request arrives.展开更多
As the core technology of optical networks virtualization, virtual optical network embedding(VONE) enables multiple virtual network requests to share substrate elastic optical network(EON) resources simultaneously and...As the core technology of optical networks virtualization, virtual optical network embedding(VONE) enables multiple virtual network requests to share substrate elastic optical network(EON) resources simultaneously and hence has been applicated in edge computing scenarios. In this paper, we propose a reinforced virtual optical network embedding(R-VONE) algorithm based on deep reinforcement learning(DRL) to optimize network embedding policies automatically. The network resource attributes are extracted as the environment state for model training, based on which DRL agent can deduce the node embedding probability. Experimental results indicate that R-VONE presents a significant advantage with lower blocking probability and higher resource utilization.展开更多
文摘The virtual network embedding/mapping problem is an important issue in network virtualization in Software-Defined Networking(SDN).It is mainly concerned with mapping virtual network requests,which could be a set of SDN flows,onto a shared substrate network automatically and efficiently.Previous researches mainly focus on developing heuristic algorithms for general topology virtual network.In practice however,the virtual network is usually generated with specific topology for specific purpose.Thus,it is a challenge to optimize the heuristic algorithms with these topology information.In order to deal with this problem,we propose a topology-cognitive algorithm framework,which is composed of a guiding principle for topology algorithm developing and a compound algorithm.The compound algorithm is composed of several subalgorithms,which are optimized for specific topologies.We develop star,tree,and ring topology algorithms as examples,other subalgorithms can be easily achieved following the same framework.The simulation results show that the topology-cognitive algorithm framework is effective in developing new topology algorithms,and the developed compound algorithm greatly enhances the performance of the Revenue/Cost(R/C) ratio and the Runtime than traditional heuristic algorithms for multi-topology virtual network embedding problem.
基金supported by the National Key Research and Development of China under Grant 2018YFC1314903the National Natural Science Foundation of China under Grant 61372124 and Grant 61427801
文摘Network virtualization(NV) is pushed forward by its proponents as a crucial attribute of next generation network, aiming at overcoming the gradual ossification of current networks, particularly to the worldwide Internet. Through virtualization, multiple customized virtual networks(VNs), requested by users, are allowed to coexist on the underlying substrate networks(SNs). In addition, the virtualization scheme contributes to sharing underlying physical resources simultaneously and seamlessly. However, multiple technical issues still stand in the way of NV successful implementation. One key technical issue is virtual network embedding(VNE), known as the resource allocation problem for NV. This paper conducts a survey of embedding algorithms for VNE problem. At first, the NV business model for VNE problem is presented. Then, the latest VNE problem description is presented. Main performance metrics for evaluating embedding algorithms are also involved. Afterwards, existing VNE algorithms are detailed, according to the novel proposed category approach. Next, key future research aspects of embedding algorithms are listed out. Finally, the paper is briefly concluded.
基金The authors would like to thank the reviewers for their detailed reviews and constructive comments,which have helped improve the quality of this paper.This work was supported by National Science Foundation of China under Grants 6187144。
文摘Network virtualization(NV)is a highprofile way to solve the ossification problem of the nowadays Internet,and be able to support the diversified network naturally.In NV,Virtual Network Embedding(VNE)problem has been widely considered as a crucial issue,which is aimed to embed Virtual Networks(VNs)onto the shared substrate networks(SNs)efficiently.Recently,some VNE approaches have developed Node Ranking strategies to drive and enhance the embedding efficiency.Node Ranking Strategy rank/sort the nodes according to the attributes of the node,including both residual local attributes(CPU,Bandwidth,storage,Etc.)and the global topology attributes(Number of neighborhood Nodes,Delay to other nodes,Etc.).This paper presents an overview of Node Ranking Strategies in Virtual Network Embedding,and possible directions of VNE Node Ranking Strategy.
基金supported by the National Basic Research Program of China(973 Program)under Grant 2013CB329005
文摘Network virtualization is known as a promising technology to tackle the ossification of current Internet and will play an important role in the future network area. Virtual network embedding(VNE) is a key issue in network virtualization. VNE is NP-hard and former VNE algorithms are mostly heuristic in the literature.VNE exact algorithms have been developed in recent years. However, the constraints of exact VNE are only node capacity and link bandwidth.Based on these, this paper presents an exact VNE algorithm, ILP-LC, which is based on Integer Linear Programming(ILP), for embedding virtual network request with location constraints. This novel algorithm is aiming at mapping virtual network request(VNR) successfully as many as possible and consuming less substrate resources.The topology of each VNR is randomly generated by Waxman model. Simulation results show that the proposed ILP-LC algorithm outperforms the typical heuristic algorithms in terms of the VNR acceptance ratio, at least 15%.
基金supported by "the Fundamental Research Funds for the Central Universities" of China University of Petroleum(East China)(Grant No.18CX02139A)the Shandong Provincial Natural Science Foundation,China(Grant No.ZR2014FQ018)+3 种基金the National Natural Science Foundation of China(Grant No.61471056)the National Basic Research Program(973)of China(Grant No.2012CB315801)the Research on coordinated management and control technology of network and satellite multi-domain network resources(Grant No.17-H863-01-ZT-001-001-02)the China research project on key technology strategy of infrastructure security for information network development
文摘In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.
基金supported in part by the National Natural Science Foundation of China under Grant No.61471055
文摘Virtual network embedding problem which is NP-hard is a key issue for implementing software-defined network which is brought about by network virtualization. Compared with other studies which focus on designing heuristic algorithms to reduce the hardness of the NP-hard problem we propose a robust VNE algorithm based on component connectivity in large-scale network. We distinguish the different components and embed VN requests onto them respectively. And k-core is applied to identify different VN topologies so that the VN request can be embedded onto its corresponding component. On the other hand, load balancing is also considered in this paper. It could avoid blocked or bottlenecked area of substrate network. Simulation experiments show that compared with other algorithms in large-scale network, acceptance ratio, average revenue and robustness can be obviously improved by our algorithm and average cost can be reduced. It also shows the relationship between the component connectivity including giant component and small components and the performance metrics.
基金supported by the National Basic Research Program of China (973 Program) under Grant 2013CB329104the National Natural Science Foundation of China under Grant 61372124 and 61427801the Key Projects of Natural Science Foundation of Jiangsu University under Grant 11KJA510001
文摘Network virtualization(NV) is widely considered as a key component of the future network and promises to allow multiple virtual networks(VNs) with different protocols to coexist on a shared substrate network(SN). One main challenge in NV is virtual network embedding(VNE). VNE is a NPhard problem. Previous VNE algorithms in the literature are mostly heuristic, while the remaining algorithms are exact. Heuristic algorithms aim to find a feasible embedding of each VN, not optimal or sub-optimal, in polynomial time. Though presenting the optimal or sub-optimal embedding per VN, exact algorithms are too time-consuming in smallscaled networks, not to mention moderately sized networks. To make a trade-off between the heuristic and the exact, this paper presents an effective algorithm, labeled as VNE-RSOT(Restrictive Selection and Optimization Theory), to solve the VNE problem. The VNERSOT can embed virtual nodes and links per VN simultaneously. The restrictive selection contributes to selecting candidate substrate nodes and paths and largely cuts down on the number of integer variables, used in the following optimization theory approach. The VNE-RSOT fights to minimize substrate resource consumption and accommodates more VNs. To highlight the efficiency of VNERSOT, a simulation against typical and stateof-art heuristic algorithms and a pure exact algorithm is made. Numerical results reveal that virtual network request(VNR) acceptance ratio of VNE-RSOT is, at least, 10% higher than the best-behaved heuristic. Other metrics, such as the execution time, are also plotted to emphasize and highlight the efficiency of VNE-RSOT.
基金supported by the National Basic Research Program (973) of China (Nos. 2007CB310701 and 2011CB302900)the National Science and Technology Major Projects (No. 2010ZX03004-002-02)
文摘The virtual network embedding/mapping problem is a core issue of network virtualization. It is concerned mainly with how to map virtual network requests to the substrate network efficiently. There are two steps in this problem: node mapping and link mapping. Current studies mainly focus on developing heuristic algorithms, since both steps are computationally intractable. In this paper, we propose a new algorithm based on the proximity principle, which considers the distance factor besides the capacity factor in the node mapping step. Thus, the two steps of the embedding problem can be better integrated and the substrate network resource can be used more efficiently. Simulation results show that the new algorithm greatly enhances the performance of the revenue/cost (R/C) ratio, acceptance ratio, and runtime of the embedding problem.
基金supported in part by Open Foundation of State Key Laboratory of Information Photonics and Optical Communications (Grant No. IPOC2014B009)Fundamental Research Funds for the Central Universities (Grant Nos. N130817002, N150401002)+1 种基金Foundation of the Education Department of Liaoning Province (Grant No. L2014089)National Natural Science Foundation of China (Grant Nos. 61302070, 61401082, 61471109, 61502075, 91438110)
文摘The pursuit of the higher performance mobile communications forces the emergence of the fifth generation mobile communication(5G). 5G network, integrating wireless and wired domain, can be qualified for the complex virtual network work oriented to the cross-domain requirement. In this paper, we focus on the multi-domain virtual network embedding in a heterogeneous 5G network infrastructure, which facilitates the resource sharing for diverse-function demands from fixed/mobile end users. We proposed the mathematical ILP model for this problem.And based on the layered-substrate-resource auxiliary graph and an effective six-quadrant service-type-judgment method, 5G embedding demands can be classified accurately to match different user access densities. A collection of novel heuristic algorithms of virtual 5G network embedding are proposed. A great deal of numerical simulation results testified that our algorithm performed better in terms of average blocking rate, routing latency and wireless/wired resource utilization, compared with the benchmark.
基金This work has been supported by National Science and Technology Major Project of China (NMP) (2010ZX03004-002 and 2012ZX03003-003), the Strategic Pilot Project of Chinese Academy of Sciences (XDA06010302), and the National Natural Science Foundation of China (Grant No. 60972083).
文摘Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtual nodes and virtual edges onto substrate networks. Previous research has presented several heuristic algorithms, which fail to consider that the attributes of the substrate topology and virtual net- works affect the embedding process. In this paper, for the first time, we introduce complex network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering of the attributes of nodes and edges in the topology, our studies are more reasonable than existing work. In addition, with the guidance of topology quantitative evalua- tion, the proposed network embedding approach largely improves the network utilization efficiency and decreases the embedding complexity. We also investigate our algorithms on real network topologies (e.g., AT&T, DFN) and random network topologies. Experimental results demonstrate the usability and capability of the proposed approach.
基金Project supported by the National Basic Research Program (973) of China (No. 2012CB315801), the National Natural Science Foundation of China (Nos. 61302089 and 61300184), and the Fundamental Research Funds for the Central Universities, China (No. 2013RC0113)
文摘As a great challenge of network virtualization, virtual network embedding/mapping is increasingly important. It aims to successfully and efficiently assign the nodes and links of a virtual network (VN) onto a shared substrate network. The problem has been proved to be NP-hard and some heuristic algorithms have been proposed. However, most of the algorithms use only the local information of a node, such as CPU capacity and bandwidth, to determine how to map a VN, without considering the top- ological attributes which may pose significant impact on the performance of the embedding. In this paper, a new embedding algorithm is proposed based on real-time topological attributes. The concept ofbetweenness centrality in graph theory is borrowed to sort the nodes of VNs, and the nodes of the substrate network are sorted according to the correlation properties between the former selected and unselected nodes. In this way, node mapping and link mapping can be well coupled. A simulator is built to evaluate the performance of the proposed virtual network embedding (VNE) algorithm. The results show that the new algorithm significantly increases the revenue/cost (R/C) ratio and acceptance ratio as well as reduces the runtime.
基金supported by the Specialized Research Fund for the Doctoral Program of Higher Education of China(No.20131201110002)the Key Laboratory of Computer Architecture Opening Topic Fund Subsidization(No.CARCH201303)
文摘Network virtualization is a promising approach for resource management that allows customized Virtual Networks (VNs) to be multiplexed on a shared physical infrastructure. A key function that network virtualization can provide is Virtual Network Embedding (VNE), which maps virtual networks requested by users to a shared substrate network maintained by an Internet service provider. Existing research has worked on this, but has primarily focused on maximizing the revenue of the Internet service provider. In this paper, we consider energy-aware virtual network embedding, which aims at minimizing the energy consumption for embedding virtual networks in a substrate network. In our optimization model, we consider energy consumption of both links and nodes. We propose an efficient heuristic to assign virtual nodes to appropriate substrate nodes based on priority, where existing activated nodes have higher priority for hosting newly arrived virtual nodes. In addition, our proposed algorithm can take advantage of activated links for embedding virtual links so as to minimize total energy consumption. The simulation results show that, for all the cases considered, our algorithm can improve upon previous work by an average of 12.6% on acceptance rate, while the consumed energy can be reduced by 12.34% on average.
基金supported by the National Basic Research Programs of China(2012CB315801)
文摘Network virtualization is a promising way to overcome the current ossification of the Intemet. It is essential challenge to find effective, efficient and robust embedding algorithms for recovering virtual network. The virtual network mapping algorithm based on integer programming which was proposed months ago. But it did consider the faults of physical network resources, which is so called survivable virtual network embedding (VNE) problem. Previous strategies for enabling survivability in network virtualization focused on providing protection for the physical network or enhancing the virtual networks by providing backup physical resources in advance, and treated all the physical failures as link failures. In the article, a dynamic recovery method is proposed to solve the survivable virtual network embedding problem based on the integer programming VNE algorithm. The dynamic recovery method doesn't need to backup physical resources and it makes more substrate resources which can be used in the embedding. The dynamic recovery process will be activated only when physical failures occur. Different algorithms are used to recovery node and link failures. Simulations show that the method helps to recover almost all of physical failures by finding the substitute nodes and paths, and its performance is very close to that of pure VNE method without considering physical failures.
基金supported by the National Natural Science Foundation of China(61701521)the Shaanxi Provincial Natural Science Foundation(2018JQ6074)。
文摘The evolution of airborne tactical networks(ATNs)is impeded by the network ossification problem.As a solution,network virtualization(NV)can provide a flexible and scalable architecture where virtual network embedding(VNE)is a key part.However,existing VNE algorithms cannot be optimally adopted in the virtualization of ATN due to the complex interference in aircombat field.In this context,a highly reliable VNE algorithm based on the transmission rate for ATN virtualization(TR-ATVNE)is proposed to adapt well to the specific electromagnetic environment of ATN.Our algorithm coordinates node and link mapping.In the node mapping,transmission-rate resource is firstly defined to effectively evaluate the ranking value of substrate nodes under the interference of both environmental noises and enemy attacks.Meanwhile,a feasible splitting rule is proposed for path splitting in the link mapping,considering the interference between wireless links.Simulation results reveal that our algorithm is able to improve the acceptance ratio of virtual network requests while maintaining a high revenue-to-cost ratio under the complex electromagnetic interference.
基金supported in part by Open Foundation of State Key Laboratory of Information Photonics and Optical Communications (Grant No. IPOC2014B009)Fundamental Research Funds for the Central Universities (Grant Nos. N130817002, N140405005, N150401002)+3 种基金Foundation of the Education Department of Liaoning Province (Grant No. L2014089)National Natural Science Foundation of China (Grant Nos. 61302070, 61401082, 61471109, 61502075)Liaoning Bai Qian Wan Talents ProgramNational High-Level Personnel Special Support Program for Youth Top-Notch Talent
文摘Currently, the elastic interconnection has realized the high-rate data transmission among data centers(DCs). Thus, the elastic data center network(EDCN) emerged. In EDCNs, it is essential to achieve the virtual network(VN) embedding, which includes two main components: VM(virtual machine) mapping and VL(virtual link) mapping. In VM mapping, we allocate appropriate servers to hold VMs. While for VL mapping,an optimal substrate path is determined for each virtual lightpath. For the VN embedding in EDCNs, the power efficiency is a significant concern, and some solutions were proposed through sleeping light-duty servers.However, the increasing communication traffic between VMs leads to a serious energy dissipation problem, since it also consumes a great amount of energy on switches even utilizing the energy-efficient optical transmission technique. In this paper, considering load balancing and power-efficient VN embedding, we formulate the problem and design a novel heuristic for EDCNs, with the objective to achieve the power savings of servers and switches. In our solution, VMs are mapped into a single DC or multiple DCs with the short distance between each other, and the servers in the same cluster or adjacent clusters are preferred to hold VMs. Such that, a large amount of servers and switches will become vacant and can go into sleep mode. Simulation results demonstrate that our method performs well in terms of power savings and load balancing. Compared with benchmarks, the improvement ratio of power efficiency is 5%–13%.
基金supported by the national 973 project of China under Grants 2013CB329104the Natural Science Foundation of China under Grants 61372124,61427801,61271237,61271236Jiangsu Collaborative Innovation Center for Technology and Application of Internet of Things under Grants SJ213003
文摘As a key technology to realize smart services of Internet of Things(IoT), network virtualization technology can support the network diversification and ubiquity, and improve the utilization rate of network resources. This paper studies the service-ori- ented network virtualization architecture for loT services. Firstly the semantic description method for loT services is proposed, then the resource representation model and resource management model in the environment of network virtualization are presented. Based on the above models, the service-oriented virtual network architecture for loT is established. Finally, a smart campus system is designed and deployed based on the service-oriented virtual network architecture. Moreover, the proposed architecture and models are verified in experiments.
基金This work is supported by the Fundamental Research Funds for the Central Universities.
文摘In recent years,satellite networks have been proposed as an essential part of next-generation mobile communication systems.Software defined networking techniques are introduced in satellite networks to handle the growing challenges induced by time-varying topology,intermittent inter-satellite link and dramatically increased satellite constellation size.This survey covers the latest progress of software defined satellite networks,including key techniques,existing solutions,challenges,opportunities,and simulation tools.To the best of our knowledge,this paper is the most comprehensive survey that covers the latest progress of software defined satellite networks.An open GitHub repository is further created where the latest papers on this topic will be tracked and updated periodically.Compared with these existing surveys,this survey contributes from three aspects:(1)an up-to-date SDN-oriented review for the latest progress of key techniques and solutions in software defined satellite networks;(2)an inspiring summary of existing challenges,new research opportunities and publicly available simulation tools for follow-up studies;(3)an effort of building a public repository to track new results.
基金National Key R&D Program China under Grant 2018YFB1801701National Natural Science Foundation of China(NSFC)under Grant 61671313the Priority Academic Program Development of Jiangsu Higher Education Institutions。
文摘Network virtualization is important for elastic optical networks(EONs)because of more flexible service provisioning.To ensure guaranteed quality of service(QoS)for each virtual elastic optical network(VEON),clients usually request network resources from a network operator based on their bandwidth requirements predicted from historical traffic demands.However,this may not be efficient as the actual traffic demands of users always fluctuate.To tackle this,we propose a new VEON service provisioning scheme,called SATP,which consists of three stages,i.e.,spectrum assignment(SA),spectrum trading(ST),and spectrum purchasing(SP).Unlike conventional once-for-all VEON service provisioning approaches,the SATP scheme first allocates spectrum resources to VEONs according to their predicted bandwidth requirements with a satisfaction ratio α(0<α≤1).Then,to minimize service degradation on VEONs which are short of assigned spectra for their peak traffic periods,the scheme allows VEONs to trade spectra with each other according to their actual bandwidth requirements.Finally,it allows VEON clients to purchase extra spectrum resources from a network operator if the spectrum resources are still insufficient.To optimize this entire process,we formulate the problem as a mixed integer linear programming(MILP)model and also develop efficient heuristic algorithms for each stage to handle large test scenarios.Simulations are conducted under different test conditions for both static and dynamic traffic demand scenarios.Results show that the proposed SATP scheme is efficient and can achieve significant performance improvement under both static and dynamic scenarios.
基金supported by the National Basic Research Program of China (2011CB302901,2012CB315801)the Fundamental Research Funds for the Central Universities (2011RC0118)
文摘The virtual network embedding/mapping problem is a core issue of the network virtualization. It's mainly concerned with how to map virtual network requests to the substrate network efficiently. Previous researches mainly focus on developing heuristic algorithms for general topology virtual network request. In this paper, we propose a new algorithm for the hub-and-spoke (HAS) topology virtual request. The characters of the HAS topology are exploited to develop the new algorithm. The simulation results show that the new algorithm greatly enhances the performance of revenue/cost (R/C) ratio while the HAS topology request arrives.
基金supported in part by the National Natural Science Foundation of China(62001422)Henan Scientific and Technology Innovation Talents(22HASTIT016).
文摘As the core technology of optical networks virtualization, virtual optical network embedding(VONE) enables multiple virtual network requests to share substrate elastic optical network(EON) resources simultaneously and hence has been applicated in edge computing scenarios. In this paper, we propose a reinforced virtual optical network embedding(R-VONE) algorithm based on deep reinforcement learning(DRL) to optimize network embedding policies automatically. The network resource attributes are extracted as the environment state for model training, based on which DRL agent can deduce the node embedding probability. Experimental results indicate that R-VONE presents a significant advantage with lower blocking probability and higher resource utilization.