共查询到19条相似文献,搜索用时 156 毫秒
1.
2.
针对多个虚拟网络请求(Virtual Network Request,VNR)动态到达的网络场景,本文提出一种基于成本及功耗联合优化的软件定义网络(Software-Defined Networking,SDN)虚拟网络映射(Virtual Network Embedding,VNE)算法.在对虚拟节点及链路映射成本及功耗进行评估的基础上,建模VNE成本及功耗的代价函数,进而在满足资源需求等约束条件下,建模基于代价函数最小化的VNE模型.该优化问题为整数线性规划问题,难以直接求解;为解决此问题,提出基于时间窗的虚拟网络批处理映射策略动态处理在线请求.继而针对特定时间窗内的VNR,将其转换为虚拟节点映射子问题和虚拟链路映射子问题,并应用启发式算法对两个子问题分别进行求解,从而确定VNR映射策略.仿真结果表明,所提算法能显著减少VNE成本及功耗,提高VNR接受率. 相似文献
3.
针对多个虚拟网络请求(Virtual Network Request,VNR)动态到达的网络场景,本文提出一种基于成本及功耗联合优化的软件定义网络(Software-Defined Networking,SDN)虚拟网络映射(Virtual Network Embedding,VNE)算法.在对虚拟节点及链路映射成本及功耗进行评估的基础上,建模VNE成本及功耗的代价函数,进而在满足资源需求等约束条件下,建模基于代价函数最小化的VNE模型.该优化问题为整数线性规划问题,难以直接求解;为解决此问题,提出基于时间窗的虚拟网络批处理映射策略动态处理在线请求.继而针对特定时间窗内的VNR,将其转换为虚拟节点映射子问题和虚拟链路映射子问题,并应用启发式算法对两个子问题分别进行求解,从而确定VNR映射策略.仿真结果表明,所提算法能显著减少VNE成本及功耗,提高VNR接受率. 相似文献
4.
5.
该文针对现有的虚拟网络映射算法对网络中节点的拓扑属性考虑不够周到,导致其请求接受率和收益开销比较低的问题,将物理学里的场论思想引入了虚拟网络映射,并提出一种基于拓扑势的虚拟网络映射算法。该算法在节点映射阶段,通过计算节点的拓扑势、节点的资源能力、待映射节点与已映射节点之间的距离,将虚拟节点映射至最佳的物理节点。在链路映射阶段,通过计算物理路径的可用带宽和路径跳数,将虚拟链路映射至最佳的物理路径。仿真实验表明,该算法在多种虚拟网络到达强度下的请求接受率和收益开销比均优于当前的虚拟网络映射算法。 相似文献
6.
S-MAc协议是weiYe等人在IEEE802.儿协议的基础上,针对WSNs网络能量有效性而提出的一种专用于WSNs网络的节能协议。S-MAC协议主要使用三种新技术来减少能耗:节点周期性的休眠,邻节点形成虚拟簇在休眠制度上自同步,以及利用消息传递机制来发送长包,减少竞争反应时间。本文将对无线传感网络(WSNs)的节点能耗问题进行讨论,并对无线传感器网络MAc层节能协议进行分析。 相似文献
7.
为了提高无色无向无冲突灵活的可重构光分插复用器(CDC-F ROADM)节点的弹性光网络IP组播频谱-能耗效率,该文提出一种全光组播能效调度算法(AMEESA)。在算法路由阶段,考虑能耗和链路频谱资源使用情况设计链路代价函数,构建最小代价光树算法组播光树。在频谱分配阶段,设计基于高效光谱分辨率(HSR)光树中间节点频谱转换方法,选择节能频谱转换方案为组播光树分配频谱块资源。仿真分析表明,所提算法能有效提升网络能效,降低IP组播带宽阻塞率。 相似文献
8.
9.
在两阶段虚拟网络映射算法的基础上,针对现有的HAS算法在节点映射阶段存在局限性的缺点,提出了一种基于HAS拓扑的虚拟网络映射算法。该算法融合了HAS拓扑的特征,对节点映射阶段做了优化和改进,在节点映射阶段充分考虑其对链路映射带来的影响,使节点映射到相对集中的区域,降低链路映射阶段的求解难度。仿真结果表明,所提出的算法与已有的算法相比,在虚拟网络请求接受率、平均时间收益和收益开销比等方面均有明显提高。 相似文献
10.
11.
12.
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. 相似文献
13.
14.
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. 相似文献
15.
虚拟网络映射是网络虚拟化的关键问题之一,其目的是在满足虚拟网络资源需求的前提下,为该虚拟网络分配合适的底层网络节点和链路资源,从而在共享的物理网络基础设施之上构建彼此隔离的多重异构虚拟网络,为网络基础创新研究提供实验环境和平台,为网络新应用提供承载服务。论述了虚拟网络映射模型和映射算法,并提出基于最小割集理论设计VN映射算法。 相似文献
16.
17.
针对无线网络链路可靠性差影响无线虚拟网络的分配这一问题,提出了一种基于链路可靠性的无线虚拟网络分配算法(WVNEA-LR)。该算法通过物理网络拓扑预处理和允许同一个虚拟请求中的多个虚拟节点映射到同一个物理节点上的方法,提高了Vn构建成功率和节约了物理链路资源。利用Q因子改善了因拓扑分配稀疏时Vn构建成功率低的问题。此外,WVNEA-LR的节点分配为链路分配作了准备,并通过选择可靠性高的承载路径保证了分配后的Vn具有高可靠性。仿真结果表明, WVNEA-LR获得较好的虚拟网络构建成功率、较高的收益成本比和资源利用率。 相似文献
18.
虚拟网映射是网络虚拟化研究中亟待解决的问题,针对已有映射算法中存在的对于网络拓扑信息利用不足的现状,该文提出了基于资源区域聚集度的虚拟网映射算法(RCI-VNE)。在映射预处理阶段,根据局部拓扑信息和区域资源聚集度提出节点区域资源聚集评价算法。在节点映射阶段,提出一种基于节点区域资源聚集排名的2-近邻聚集映射算法,该算法将虚拟网节点集中映射到底层网络中可用资源丰富的区域,减小承载链路的长度。实验结果表明,该算法降低了虚拟网映射开销,且具有较高的虚拟网请求接受率和较低的平均执行时间。 相似文献
19.
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. 相似文献