基于多目标遗传算法优化弹性光网络的多路径保护机制

弹性光网络中多路径的保护方案相比单路径有效地降低网络带宽阻塞率,但会导致接收端多径时延差的问题,且业务的多路径分割传输策略使用了光网络较多的频谱资源。该文基于多目标遗传算法提出了遗传多路径保护算法(Genetic Multipath Protection Algorithm, GMPA),解决多路径时延差和节约频谱资源问题。在GMPA算法中,根据业务请求在光网络中建立K条边分离最短路径和带宽分配方案作为GMPA算法的初始种群,设计了一种联合考虑传输时延差和带宽资源分配的向量函数优化种群分类和拥挤距离排序。为提高算法的搜索能力和收敛速度,算法在交叉操作中设计个体自交叉方式,在变异过程中设置了带宽基因位变异范围及约束条件。仿真结果表明,相比多路径保护(Multiple Path Protection, MPP)算法和工作路径首次分配保护路径最后分配(Primary First-fit Modified Backup Last-fit, PF-MBL) 算法,GMPA算法获得最低的带宽阻塞率,其频谱资源利用率接近最优的MPP算法,路径间距离差异性能优于MPP算法。     

弹性光网络中面向任播业务的节能路由算法

为提高数据中心间光互联网络的能效,面向任播业务提出一种具有业务持续时间感知的混合路径传输节能路由算法.为了减少新建光路和工作元器件数量,优先采用单路径传输;若业务阻塞则以传输能耗最小化为目标进行多路径传输.除此之外,引入基于频谱预留的业务疏导策略来降低保护带宽和光收发器的开销.仿真结果表明:与传统节能路由算法相比,所提算法在显著降低网络能耗的同时,有效避免了业务阻塞率的过度增加,实现了网络能耗与性能的平衡.     

基于频谱感知的业务分割-合并的弹性光网络资源分配策略

针对弹性光网络中业务分割的资源分配策略消耗更多保护带与设备端口,浪费频谱资源和增加网络能耗的问题,该文提出一种频谱感知的业务分割再合并的资源分配策略。为新业务分配频谱资源时,先计算路径上总链路剩余频谱连续度,选择使剩余频谱连续度最大频谱块传输业务;当路径上频隙数不满足业务传输需求空闲频谱块时,将该业务分割为多个子业务,尽可能选取使剩余频谱连续度最大的多个频谱块承载各子业务。当监视到子业务传输路径上有可用频隙数满足业务传输所需空闲频谱块时,计算剩余频谱连续度作为子业务合并触发的判决条件,将子业务再合并后继续传输。仿真结果表明该文提出的策略能有效降低网络的带宽阻塞率,并节约网络的能耗。     

弹性光网络中基于安全性感知的差异化虚拟光网络的映射策略

针对虚拟环境下底层网络中光纤的概率性故障,传统的100%保护至少需要配置一条保护路径,造成资源冗余度高和虚拟网络请求接受率低的问题,该文提出一种基于安全性感知的差异化虚拟光网络的映射(SA-DVNM)策略,在链路发生故障时为差异化虚拟网络请求提供安全保证。在SA-DVNM策略中,设计了一个综合考虑物理节点对之间跳数和相邻带宽大小的节点权重式避免链路映射过长,并提出路径频谱资源使用均衡的链路映射机制,最小化瓶颈链路的数量。当单路径传输失败时,SA-DVNM策略设计允许路径分割的资源分配机制,为保障时延敏感业务的安全性,SA-DVNM策略在路由选择中设计了基于时延差优化的多路径路由频谱分配方法。仿真结果表明该文所提策略在概率故障环境中能够降低带宽阻塞率,提高频谱资源利用率和虚拟光网络接受率。     

弹性光网络中基于自适应调制的碎片感知共享通路保护算法

为了提高弹性光网络(EON)的频谱利用率,提出一种基于自适应调制的碎片感知共享通路保护算法。该算法利用频谱块承载权重(SBBW)衡量不同频谱块接纳业务的能力,优先选择SBBW大的链路构成候选工作路径,并利用分配前、后SBBW差值最小的频谱块建立工作路径。然后选择可用频谱块和保护频谱块承载能力大的链路构成候选保护路径,建立保护路径时优先使用分配前、后SBBW差值最小的保护频谱块,建立失败时才选择分配前、后SBBW差值最小的可用频谱块。仿真结果表明:该算法可以降低带宽阻塞率、频谱碎片率和备用容量冗余。     

光树分割和共享光路合并优化任多播阻塞率

针对弹性光互联数据中心网络中任多播业务的频谱利用率低和带宽阻塞率高等问题,论文提出了一种基于光树分割和共享光路合并算法.该算法选择对光树最大长度和调制等级影响较小的树枝加入光树,使生成光树频谱代价最小.当光树传输所需频谱资源不足时,该算法将光树分割为可选较高调制等级的多子光树传输,提高频谱利用率.当网络中有足够资源时,设计一种基于链路共享度的将满足条件的子光树合并到光树上传输的机制以降低频谱消耗.仿真结果表明：论文所提算法具有较低的带宽阻塞率和较高的频谱利用率.     

EON中针对提前预留业务的碎片感知RSA算法

为了减少弹性光网络(EON)中的频谱和时间碎片,针对提前预留(AR)业务提出一种碎片感知路由与频谱分配(RSA)算法。在选路阶段,该算法采用K最短路径算法,综合考虑路径距离、跳数、频谱资源消耗和邻接链路数等因素影响来挑选侯选路径集;在资源分配阶段,则采用局部影响因子统计可能产生的频谱和时间碎片,以降低候选资源块周围的频谱、时间资源碎片化程度,并利用整体影响因子尽可能将占用资源集中在频率轴边界处,以增加中间空闲资源连续性,同时还引入时域资源使用度因子以避免过度占用资源。仿真结果表明,该算法进一步改善了带宽阻塞率性能,提高了资源利用率。     

面向业务的弹性光网络光路损伤感知能效路由策略

针对弹性光网络中物理损伤导致业务频谱利用率低和传输能耗高问题,该文提出一种面向业务的链路损伤感知频谱分区(LI-ASP)能效路由策略。在LI-ASP策略中,为降低不同信道间非线性损伤,基于负载均衡设计一个综合考虑链路频谱状态和传输损伤的路径权重公式,根据调制方式的频谱效率和最大传输距离构造分层辅助图,从最高调制等级开始,为高质量业务选择K条边分离的最大权重传输路径;为低质量业务选择K条边分离的最短能效路径。然后,LI-ASP策略根据业务速率比值对频谱分区,采用首次命中(FF)和尾端命中(LF)联合频谱分配方式,减少不同传输速率业务间的交叉相位调制。仿真结果表明,该文所提LI-ASP策略在有效降低带宽阻塞率的同时,减少了业务传输能耗。     

QoS路由的多路径算法

本文分析了预约网络中采用多路径路由传送数据以保证应用的带宽要求、和/或端到端时延限制条件.文中提出的路由方案综合了单路径和多路径路由的优点:通过多路径路由以降低呼叫阻塞率,同时侧重单路径路由以降低协议开销.在考察网络中的四个一般性问题基础上,提出了启发式算法.     

自适应的认知无线Mesh网络QoS约束的路由与频谱分配算法

提出了一种自适应的满足QoS约束的路由与频谱分配(SA2JR)算法,SA2JR的目标是:在满足无线业务QoS约束的情况下,最大化无线业务接受率,让尽可能多的无线业务需求能够被满足.SA2JR包括2个部分,按需的κ-路径路由(κ-Routing)算法,以及QoS驱动的频谱分配(QDSA)算法.κ-Routing负责为每一个需求产生κ条潜在路由路径,QDSA算法自适应地进行频谱分配,目标是从κ-Routing产生的κ条潜在路由路径中找出一条满足QoS约束的可行路由路径.仿真结果表明SA2JR能达到预定目标,获得了较高的无线业务接受率.     

RDMSR: A reactive defragmentation with minimum spectrum route strategy for mixed grid optical network

In this paper, we propose a reactive defragmentation with minimum spectrum route (RDMSR) for the problem of route, spectrum, and modulation-format allocation (RSMA) in mixed grid optical network. In mixed grid network, spectrum redundancy and its assignment problem increase due to the spectrum continuity and contiguity constrains. In the proposed RDMSR strategy, process of defragmentation initiates after the termination of the existing connections. In addition, the route that needs minimum spectrum is given priority over the other available routes. The performance of the proposed strategy is compared with the two existing strategies: shortest path first (SPF) and mixed grid aware dynamic resources allocation (MDRA). Simulations are performed on NSFNET and ARPANET topologies. The existing and proposed strategies are evaluated on the metrics of bandwidth blocking probability (BBP), network capacity (NC), and average hops (AH) at three different combinations of the network traffic. Results show the proposed strategy outperforms than the other existing state of art strategies.     

Resource efficiency improved approach for shared path protection in EONs

For improving the resource efficiency of dynamic shared path protection in elastic optical networks, a survivable RSA (SRSA)-based heuristic algorithm is proposed in the paper. In SRSA, an adaptive adjustment link cost function is devised to effectively select working and protection paths. The cost function sufficiently considers available spectrum resources and the length of light paths for both working and protection paths. In order to achieve high resource efficiency, a spectrum allocation strategy named minimal cost stable set is proposed to allocate spectrum for protection paths with respect to the resource efficiency in the link cost function. And the graph coloring algorithm is introduced to select the shared protection path with the highest resource efficiency for the request. Compared with the shared path protection and dynamic load balancing shared path protection, simulation results show that the proposed SRSA decreases bandwidth blocking probability and achieves high resource efficiency.     

弹性光网络中结合预测的多维感知RSA算法

弹性光网络(EON)中的传统路由频谱分配(RSA)算法多考虑路由跳数或频谱资源占用情况,缺乏时域与相邻链路的信息有效利用.提出一种结合预测的多维感知RSA算法,对持续时间已知业务的历史时间信息通过后向传播神经网络预测未来业务的时间信息,在路由时综合考虑时间、频谱和相邻链路资源占用程度.仿真结果表明:与传统RSA算法相比...     

Adaptive subcarrier-distribution algorithm for routing and spectrum allocation in OFDM-based elastic optical networks

In this paper, we have proposed the adaptive subcarriers-distribution routing and spectrum allocation (ASD-RSA) algorithm, which is the first elastic optical network routing and spectrum allocation algorithm based on distributed subcarriers. It allocates lightpaths to request adaptively and proved to achieve much lower bandwidth blocking probability than traditional routing and spectrum allocation algorithms based on centralized subcarriers with integer linear programming and dynamic simulation methods. Additionally, the ASD-RSA algorithm performs the best with three alternate routing paths; this character will decrease the calculating amount of both alternate routing path searching and spectrum allocation immensely in large networks.     

Performance of Adaptive Routing in Wavelength-Routed Networks with Wavelength Conversion Capability

This paper concerns itself with the performance of adaptive routing in wavelength-routed networks with wavelength conversion capability. Exploiting the concept of load balancing, we propose an adaptive weighted-shortest-cost-path (WSCP) routing strategy. The salient feature of WSCP is that it seeks the path that minimizes the resource cost while simultaneously maintaining the traffic load among the links as balanced as possible. In our simulation, we compare the blocking probability, average hops and link utilization of WSCP with traditional shortest-cost-path (SCP) strategy, fixed routing and alternate routing. The numerical results show that WSCP can enhance blocking performance and just lengthen hop distances a little longer. The improvement is more significant in denser networks or with more wavelengths. We also develop an analytical model to estimate blocking performance of WSCP and compare analyses with simulations. Because of the benefit from load balancing, the proposed WSCP strategy can be used as a path selection algorithm in traffic engineering.     

Channel Adaptive Shortest Path Routing for Ad Hoc Networks

1　IntroductionAdhocnetworksareformedwithoutrequiringthepreexistinginfrastructureorcentralizedadminis tration ,incontrasttocellularnetworks.Asidefromtheoriginalmilitaryapplication ,ithasapplicationinpublicsafetyandcommercialareas,butadaptiveprotocolsarerequiredinorderforthemtodoso .Twoimportantcharacteristicsofacommunicationlinkinadhocnetworksareitsunreliabilityanditsvariability .Thelinksinsuchanetworkareunreli ablebecauseoffading ,interference,noise,andper hapsthefailureofthetransmittingorrec…     

Admission control on multipath routing in 802.11-based wireless mesh networks

Admission control (AC) is a mechanism for meeting bandwidth requirements of data transmissions. Early research on admission control for wireless mesh networks (WMNs) was centered around single-path routing. Compared to single-path routing, parallel multipath routing may offer more reliable network services and better load balancing. Applying admission control to multipath routing could further improve service quality, but it also faces a number of challenges. For example, transmission on one path may affect transmission on a neighboring path. Addressing these challenges, this paper presents an AC algorithm on parallel multipath routing for WMNs. In particular, we formulate an optimization problem for achieving the best service based on available bandwidth and bandwidth consumption of to-be-admitted data sessions. While solving this problem is a complex task, we devise an optimal algorithm for selecting two node-disjoint paths with rate allocation, and propose a distributed multipath routing and admission control protocol to achieve a near-optimal solution. Simulations show that MRAC is efficient and effective in meeting bandwidth requirements.