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%.展开更多
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.展开更多
Virtual network embedding (VNE) is an essential part of network virtualization, which is considered as one of the most promising way for the future network. Its main object is to efficiently assign the nodes and lin...Virtual network embedding (VNE) is an essential part of network virtualization, which is considered as one of the most promising way for the future network. Its main object is to efficiently assign the nodes and links of a virtual network (VN) to a shared substrate network (SN), The NP-hard and exiting studies have put forward several heuristic algorithms. However, most of the algorithms only consider the local resource of nodes, such as CPU and bandwidth (BW), to decide the embedding, and ignore the significant impact of network attributes. Based on the attributes of entire network, a model of the connectivity between each pair of nodes was formulated to measure the resource ranking of the nodes, and a new two-stage embedding algorithm was proposed. Thereafter, the node mapping and link mapping can be jointly considered. Extensive simulation shows that the proposed algorithm improves the performance of VNE by increasing the revenue/cost ratio and acceptance ratio of VN requests while reducing the runtime.展开更多
Network virtualization provides a powerful way of sharing substrate networks. Efficient allocation of network resources for multiple virtual networks( VNs) has always been a challenging task. Especially under the ever...Network virtualization provides a powerful way of sharing substrate networks. Efficient allocation of network resources for multiple virtual networks( VNs) has always been a challenging task. Especially under the everincreasing demand of customized VN requests,many problems arise as network conditions change constantly.Particularly with the emergance of resource conflict alongside the development of VNs,service provider( SP) needs to provide a faster and more effective solution. Recently,software defined network( SDN) has emerged as a new networking paradigm,SDN’s centralized control and customizable routing features present new opportunities for convenient and flexible embedding VNs in the network. However,due to the limitations of SDN,replacing all legacy devices in current operational networks by SDN-enabled switches in a short span of time is impractical.Thus,in our study,we focus on the scenario of VN embedding( VNE) in software-defined hybrid networks. In this work,first of all,we propose partially deploying SDN nodes; and then,we use the characteristics of SDN to allocate resources for VN requests,and redirect the path for requests conflict in hybrid SDN network. We formulate the problems and provide simple algorithms to solve them. Simulation results show that our scheme has high ratio in responsiveness and acceptance.展开更多
研究目的:基于虚拟网络请求和底层物理网络实时拓扑属性,提出一种高效的两步式虚拟网络映射算法。创新要点:分别利用中介中心性和物理节点相关性对虚拟网络请求和底层物理网络中节点进行重要性评估,在此基础上给出一种两步式映射算法(算...研究目的:基于虚拟网络请求和底层物理网络实时拓扑属性,提出一种高效的两步式虚拟网络映射算法。创新要点:分别利用中介中心性和物理节点相关性对虚拟网络请求和底层物理网络中节点进行重要性评估,在此基础上给出一种两步式映射算法(算法1,2)。研究方法:首先给出中间中心性、接近中心性以及节点相关性计算模型,结合节点本地资源分别提出虚拟网络请求和物理网络中节点排名计算方式。当虚拟网络请求到达后,根据虚拟节点排名,将其映射到拥有足够资源的物理节点中排名最靠前的节点。节点映射完成后,使用K-th最短路径算法进行链路映射。映射过程中采用文献(Yu et al.,2008)中所使用的时间窗口模式进行接入控制。重要结论:利用节点本地资源,针对性分析虚拟网络请求和物理网络实时拓扑属性,提出两步式映射算法。该算法提高请求接受率、开销收益比的同时减少算法映射时间,取得更好的映射效果(图3-10)。展开更多
基金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 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 by the National Basic Research Program of China (2012CB315801)the National Natural Science Foundation of China (61302089)the fundamental research funds for the Central Universities (2013RC0113)
文摘Virtual network embedding (VNE) is an essential part of network virtualization, which is considered as one of the most promising way for the future network. Its main object is to efficiently assign the nodes and links of a virtual network (VN) to a shared substrate network (SN), The NP-hard and exiting studies have put forward several heuristic algorithms. However, most of the algorithms only consider the local resource of nodes, such as CPU and bandwidth (BW), to decide the embedding, and ignore the significant impact of network attributes. Based on the attributes of entire network, a model of the connectivity between each pair of nodes was formulated to measure the resource ranking of the nodes, and a new two-stage embedding algorithm was proposed. Thereafter, the node mapping and link mapping can be jointly considered. Extensive simulation shows that the proposed algorithm improves the performance of VNE by increasing the revenue/cost ratio and acceptance ratio of VN requests while reducing the runtime.
基金supported by the National Natural Science Foundation of China ( 61602051)the Fundamental Research Funds for the Central Universities ( 2017RC11)
文摘Network virtualization provides a powerful way of sharing substrate networks. Efficient allocation of network resources for multiple virtual networks( VNs) has always been a challenging task. Especially under the everincreasing demand of customized VN requests,many problems arise as network conditions change constantly.Particularly with the emergance of resource conflict alongside the development of VNs,service provider( SP) needs to provide a faster and more effective solution. Recently,software defined network( SDN) has emerged as a new networking paradigm,SDN’s centralized control and customizable routing features present new opportunities for convenient and flexible embedding VNs in the network. However,due to the limitations of SDN,replacing all legacy devices in current operational networks by SDN-enabled switches in a short span of time is impractical.Thus,in our study,we focus on the scenario of VN embedding( VNE) in software-defined hybrid networks. In this work,first of all,we propose partially deploying SDN nodes; and then,we use the characteristics of SDN to allocate resources for VN requests,and redirect the path for requests conflict in hybrid SDN network. We formulate the problems and provide simple algorithms to solve them. Simulation results show that our scheme has high ratio in responsiveness and acceptance.
基金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)
文摘研究目的:基于虚拟网络请求和底层物理网络实时拓扑属性,提出一种高效的两步式虚拟网络映射算法。创新要点:分别利用中介中心性和物理节点相关性对虚拟网络请求和底层物理网络中节点进行重要性评估,在此基础上给出一种两步式映射算法(算法1,2)。研究方法:首先给出中间中心性、接近中心性以及节点相关性计算模型,结合节点本地资源分别提出虚拟网络请求和物理网络中节点排名计算方式。当虚拟网络请求到达后,根据虚拟节点排名,将其映射到拥有足够资源的物理节点中排名最靠前的节点。节点映射完成后,使用K-th最短路径算法进行链路映射。映射过程中采用文献(Yu et al.,2008)中所使用的时间窗口模式进行接入控制。重要结论:利用节点本地资源,针对性分析虚拟网络请求和物理网络实时拓扑属性,提出两步式映射算法。该算法提高请求接受率、开销收益比的同时减少算法映射时间,取得更好的映射效果(图3-10)。