基于链路可靠性的无线虚拟网络分配方法

针对无线网络链路可靠性差影响无线虚拟网络的分配这一问题,提出了一种基于链路可靠性的无线虚拟网络分配算法（WVNEA-LR）。该算法通过物理网络拓扑预处理和允许同一个虚拟请求中的多个虚拟节点映射到同一个物理节点上的方法,提高了Vn构建成功率和节约了物理链路资源。利用Q因子改善了因拓扑分配稀疏时Vn构建成功率低的问题。此外,WVNEA-LR的节点分配为链路分配作了准备,并通过选择可靠性高的承载路径保证了分配后的Vn具有高可靠性。仿真结果表明, WVNEA-LR获得较好的虚拟网络构建成功率、较高的收益成本比和资源利用率。     

Research on mapping algorithm of virtual network oriented to SDN

In order to solve the problem of virtual network mapping,a mapping method based on ant colony hybrid genetic algorithm was put forward under SDN environment,which established a linear programming model for virtual network mapping,and divided the mapping process into node mapping and link mapping.Firstly,the fusion algorithm was adopted,in which virtual nodes were mapped to physical nodes.Then the shortest path algorithm was used to map the virtual link to a physical link.On this basis,the acceptance ratio of virtual network requests can be improved.Simulation experiment results show that acceptance rate of virtual network requests can be increased by 10% efficiently using the ant colony hybrid genetic algorithm,compared with existing mapping algorithms D-ViNE,RW-BFS and R-ViNE.Further more,proposed method can greatly improve the average utilization rate of nodes and links and the ratio of the mapping income to cost.     

虚拟网络映射高效节能运输模型及算法

网络虚拟化使得智能能量感知网络部署成为可能,已有研究忽略了节点映射能耗最优化。本文把节点映射能耗优化问题转化为生产地与销售地之间物资运输代价最优化问题,建立高效节能节点映射运输模型。根据最大元素法,提出了混合一阶段与两阶段映射算法,在链路映射的约束下找到节点分配最小能耗代价最优解;利用主动休眠策略,提出了基于运输模型的主动休眠虚拟网络映射节能算法;利用节点可重复映射技术,提出了基于运输模型的节点可重复映射算法,进一步提高了底层网络资源休眠数量。仿真结果验证了本文所提算法能够显著降低系统能耗,适合大规模高效节能虚拟网络映射。     

一种基于临近原则的虚拟网络映射算法

在两阶段虚拟网络映射算法的基础上,针对现有的贪婪策略对节点映射存在盲目性的缺点,提出了一种基于临近原则的虚拟网络映射算法。该算法对节点映射阶段做了优化和改进,在节点映射阶段充分考虑其对链路映射带来的影响,使节点映射到相对集中的区域,降低链路映射阶段的求解难度。仿真结果表明,所提出的算法与已有的算法相比,在虚拟网络请求接受率、平均时间收益和收益开销比等方面均有明显提高。     

A unified enhanced particle swarm optimization‐based virtual network embedding algorithm

Virtual network (VN) embedding is a major challenge in network virtualization. In this paper, we aim to increase the acceptance ratio of VNs and the revenue of infrastructure providers by optimizing VN embedding costs. We first establish two models for VN embedding: an integer linear programming model for a substrate network that does not support path splitting and a mixed integer programming model when path splitting is supported. Then we propose a unified enhanced particle swarm optimization‐based VN embedding algorithm, called VNE‐UEPSO, to solve these two models irrespective of the support for path splitting. In VNE‐UEPSO, the parameters and operations of the particles are well redefined according to the VN embedding context. To reduce the time complexity of the link mapping stage, we use shortest path algorithm for link mapping when path splitting is unsupported and propose greedy k‐shortest paths algorithm for the other case. Furthermore, a large to large and small to small preferred node mapping strategy is proposed to achieve better convergence and load balance of the substrate network. The simulation results show that our algorithm significantly outperforms previous approaches in terms of the VN acceptance ratio and long‐term average revenue. Copyright © 2012 John Wiley & Sons, Ltd.     

Virtual Topology Design and Reconfiguration of Virtual Private Networks (VPNs) over All-Optical WDM Networks

This paper studies the virtual topology design and reconfiguration problem of virtual private networks (VPNs) over all-optical WDM networks. To support VPN service, a set of lightpaths must be established over the underlying WDM network to meet the VPN traffic demands and this set of lightpaths must also be dynamically reconfigurable in response to changing VPN traffic. To achieve good network performance and meet the service requirements of optical virtual private networks (oVPNs), we formulate the problem as an integer programming problem with multi-objectives and present a general formulation of the problem. In the formulation, we take into account the average propagation delay over a lightpath, the maximum link load, and the reconfiguration cost with objectives to minimize the three metrics simultaneously. The formulated problem is NP-hard and is therefore not practical to have exact solutions. For this reason, we use heuristics to obtain approximate optimal solutions and propose a balanced alternate routing algorithm (BARA) based on a genetic algorithm. To make the problem computationally tractable, we approximately divide BARA into two independent stages: route computing and path routing. At the route computing stage, a set of alternate routes is computed for each pair of source and destination nodes in the physical topology. At the path routing stage, an optimal route is decided from a set of alternative routes for each of the lightpaths between a pair of source and destination nodes. A decision is subject to the constraints and objectives in the formulation. To improve the computational efficiency, we use a genetic algorithm in BARA. Through simulation experiments, we show the effectiveness of BARA and the evolution process of the best solution in a population of solutions produced by the genetic algorithm. We also investigate the impact of the number of alternative routes between each pair of source and destination nodes on the optimized solutions.     

面向动态环境的虚拟光网络资源优化算法

为解决采用单个虚拟网特征重配置导致虚拟网接受率低的问题,基于资源竞争特征重构底层网络模型,并基于此构建虚拟网映射线性规划模型。设计了无划分的随机舍入优化算法和有划分的随机舍入优化算法,为每个虚拟网分配全局最优的底层网络资源。与现有算法相比,该算法下虚拟网请求的平均接受率提升11%,节点资源平均利用率提升61%,链路资源平均利用率提升27%。     

业务需求感知的虚拟数据中心映射方法研究(英文)

Virtualization is a common technology for resource sharing in data center.To make efficient use of data center resources,the key challenge is to map customer demands(modeled as virtual data center,VDC) to the physical data center effectively.In this paper,we focus on this problem.Distinct with previous works,our study of VDC embedding problem is under the assumption that switch resource is the bottleneck of data center networks(DCNs).To this end,we not only propose relative cost to evaluate embedding strategy,decouple embedding problem into VM placement with marginal resource assignment and virtual link mapping with decided source-destination based on the property of fat-tree,but also design the traffic aware embedding algorithm(TAE) and first fit virtual link mapping(FFLM) to map virtual data center requests to a physical data center.Simulation results show that TAE+FFLM could increase acceptance rate and reduce network cost(about 49%in the case) at the same time.The traffic aware embedding algorithm reduces the load of core-link traffic and brings the optimization opportunity for data center network energy conservation.     

一种生存性军事虚拟网络映射新方法

针对生存性的军事虚拟网络映射问题,提出了生存性的军事虚拟网络映射需要遵循的原则。构建了虚拟网络映射模型,并采用蝙蝠算法进行求解。针对故障情况,提出了区分服务的故障恢复策略,对于高优先级虚网请求提前构建保护路径,对于低优先级虚网请求则提出基于链路可靠性的故障迁移算法,为了减少带宽消耗适当考虑了节点迁移策略。最后通过仿真验证了算法在虚拟网络运行成功率、故障修复率和链路利用率方面相比其他算法具有更好的性能。     

Method of network slicing deployment based on performance-aware

In order to deal with the performance degradation caused by resource contention due to the sharing of physical resources between VNF in the network slicing,a network slicing deployment method based on performance-awareness was proposed.When deploying network slice instances,first two-phase deployment that mapping virtual nodes was adopted,and then virtual links were mapped.In the virtual nodes mapping phase,the VNF performance influences factor was defined from the perspective of resource supply and demand to quantify the degree of VNF performance impact.Then the sum of the performance influence factors of all VNF on the deployable physical server was found in the network slice instance,the physical server with the smallest sum of performance influence factors was used as the mapping location,and the simulated annealing-discrete particle swarm algorithm was used to find the nodes mapping result.In the virtual links mapping phase,the shortest path algorithm was used to obtain the link mapping result.The simulation results show that the proposed method reduces the impact of other network slices on its own service performance.     

Dynamic recovery for survivable virtual network embedding

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.     

软件定义承载网中基于负载均衡的虚拟网络资源分配算法

在具有集中式控制特点的carrier-SDN（软件定义承载网）中应用网络虚拟化技术为虚拟网络分配资源,实现承载网资源分配是解决承载网结构僵化的重要途径。提出carrier-SDN中基于负载均衡的虚拟网络资源分配算法。首先,建立carrier-SDN多层模型;其次,根据虚拟网络映射算法的特点,二值化粒子群优化算法;最后,以负载均衡为优化目标,求解虚拟网络映射问题。仿真结果表明,与已有方法相比,所提算法在虚拟网络负载均衡性、请求接受率和网络收益方面性能优越。     

卫星光网络的虚拟信道和主信道双重优化数据封装方法

针对卫星 光网络中不同类型、不同速率业务统一封装实现难度大和传输效率低的问题,提出利用虚拟 信道(VC) 与主信道(MC)联合优化的数据封装方法,分别给出VC封装与MC处理方法,并针 对其原理进 行分析。在VC中,提出了基于优先级的虚拟信道调度算法,对帧调度的时间冲突进 行优化,提 高虚拟信道处理的帧复用效率。在MC处理中,对传输帧支持的业务类型进行了扩展, 分析了前向 纠错编码对帧传输的性能影响。研究结果表明,采用优先级算法后帧传输效率提升 24.61%;外码为RS 码、内码为卷积码的级联码是MC处理中可选择的最佳编码方式。     

WDM网络设计保护优化分析

WDM网络的物理保护由于需要大量冗余光资料而难以实现，而设计保护利用了层次结构网络中业务网络的生存能力，可以恢复光层故障中断的业务。为了消除业务网络的虚链路关联效应，文章提出了虚链路与光链路映射的优化模型并使用模拟退火算法进行了求解，仿真结果表明设计保护提供的业务恢复能力远远高于普通的最短路由算法。     

链路可靠性感知的差异保护虚拟光网络映射

针对弹性光网络的多链路故障影响虚拟光网络映射性能问题,提出一种链路可靠性感知的差异保护虚拟光网络映射（RA-DPVONE）方法.根据光节点的资源特性与相邻链路故障概率,该方法设计了光节点重要性评估准则和优先映射方法.根据候选光路上的可用频谱资源和链路故障概率,设计虚拟链路映射的工作光路和保护光路的链路代价更新公式,仅为不满足可靠性需求的虚拟链路映射资源共享保护光路.仿真结果表明,所提方法能降低网络的带宽阻塞率,提高虚拟网络请求接受率和弹性光网络的频谱资源利用率.     

可生存的虚拟网络多层映射方法研究

本文研究了可生存虚拟网络多层映射问题,首先对其建立了整数线性规划模型（ILP）,然后针对较大规模问题提出一种高效的启发式算法VNP-SVNME对其进行求解.实验表明,VNP-SVNME算法的资源映射开销相对ILP仅平均高15%,且优于现有的启发式可生存算法.此外,VNP-SVNME算法的映射时间相对ILP大大降低,可以满足在线虚拟网络映射的需求.     

面向节点异构的能耗感知虚拟网络映射算法

在底层网络节点异构的环境中,能耗优化的虚拟网络映射问题并不是最小化工作节点和链路数。该文针对此问题,构建底层网络节点和链路的负载能耗模型,并以能耗最优为目标,建立虚拟网络映射问题的数学模型,提出一种能耗感知虚拟网络映射算法。该算法在节点映射阶段以最小化能耗和协调链路映射为原则,将虚拟节点映射至综合资源能力最大的底层节点上,并采用改进的能耗感知k最短路径法进行链路映射。仿真结果表明,该算法显著减少虚拟网络映射的能耗,且底层网络节点异构性越大,能耗优势更为明显。     

LEO multi-service routing algorithm based on multi-objective decision making

In low earth orbit(LEO) satellite networks,in view of the unbalanced link resource,it's difficult to meet differentiated quality of service(QoS) requirements and easily lead to reduce the efficiency of the whole network.A routing algorithm based on multi-objective decision making was proposed which defined LEO satellite network transmission service as the delay sensitive,sensitive bandwidth and reliability sensitive three categories.It used the eigenvector method to calculate service weights,and used the consistency ratio to determine whether it can be accepted.Based on the multi-objective decision making theory,it combined with the actual state of satellite network nodes and links and the specific requirements of the business,calculating the path that meets the QoS requirements of the service,so as to realize the LEO satellite network multi objective dynamic routing optimization.Established simulation platform based on the iridium network system simulated network delay,the uncertain characteristics like the residual bandwidth and packet error rate,route planning for the randomly generated three classes of business.The simulation results show that,the algorithm not only satisfies the QoS constrain while balancing the traffic load of the satellite link effectively,but also improves the performance on the throughput.     

VNE-AFS：基于人工鱼群的网络虚拟化映射算法

虚拟网络资源映射是云计算研究领域的一个难点问题。以降低底层网络映射开销为目标,提出一种基于人工鱼群的网络虚拟化映射算法VNE-AFS。根据虚拟网络请求对底层网络节点和链路的约束关系建立二进制组合优化模型,并利用人工鱼群算法实现虚拟网络资源向底层网络资源的近似最优映射。实验结果表明,与现有的虚拟网络映射算法相比,该算法有效地降低了底层网络的开销和求解时间,提高了虚拟网络映射的成功率、平均收益和资源利用率。     

物理节点可重复映射的虚拟网映射算法

该文在已有的映射算法基础上,结合K短路径的思想,改进了链路映射过程。算法通过多次搜索K短路径,寻找满足虚链路带宽需求的物理路径,有效地提高了虚链路的映射率。同时,根据虚拟网映射特性,针对节点映射过程,提出了物理节点可重复映射的映射算法,即在同一虚拟网映射过程中,物理节点可接受多个虚节点的映射。算法不仅减少了部分虚链路的映射过程,降低了映射的复杂度,而且节约了链路映射的成本,使物理网可以接收更多的虚拟网请求,有效地提高了映射效率。模拟实验表明,算法在执行时间、映射成功率以及映射收益等指标上都有着明显优势。