基于蚁群优化的IP over WDM光网络动态生存性映射算法

随着光网络规模的不断扩大以及网络体系结构的扁平化过程加速,网络传输的可靠性和实时性以及生存性路面算法本身面临新的挑战本文在单点割集的松弛生存性约束条件下,结合动态业务下的IP over WDM光网络的特点.借助蚁群优化算法的强鲁棒性和记忆能力,通过改变与调整蚁群优化算法结构中的信息素结构与其更新机制,在动态路由选择过程中,引入网络可生存性约束信息改进路由选择概率计算机制,来实现IP over WDM光网络动态生存性映射的路由策略,与其他同类算法相比,该算法不再存储网络备用路由集和物理拓扑自身庞大的割集关系,在保证网络生存性效果的前提下,通过割集松弛条件有效降低了计算的时间复杂度,提高算法收敛速度,适应网络实时性要求,仿真结果表明:与传统最短路算法比较,该算法能有效提高动态光网络的可生存性映射性能和网络的资源利用效率,并降低业务阻塞率.     

IP over WDM网络中可恢复的路由选择策略与算法

研究了IP over WDM网络中各层备用资源的分配问题,提出了一种新的IP over WDM网络中可恢复的路由选择策略以及应用于其中的备用路由选择算法.该策略通过层间备用资源共享,能够完全利用网络中为恢复光层故障所预留的资源来进行IP层故障恢复,从而大大提高了网络的资源利用率.对所提出的策略进行了性能分析,并给出了相应的性能指标.     

WDM波长路由光网络的波长分配算法

由于WDM网络中的传输和交换是以波长为粒度进行的。因此波长分配算法就成为光网络的研究热点。有效的算法可大大提高波长的利用率，并可充分挖掘WDM的带宽资源。介绍了WDM全光网络中静态和动态波长分配算法，尤其是结合大型网孔网络详述了几种动态波长分配算法。针对波长变换器在全光网络中的应用。提出了一种可以解决任意类型光网络的分层图算法，它可以一次性解决路由选择和波长分配问题，大大提高了该算法的效率。是未来光网络中非常有前景的一种波长分配算法。     

自相似业务下WDM光网的动态阻塞性能

研究了在自相似业务下,WDM光网的动态路由和波长分配问题以阻塞率为判据,通过大量的数字仿真试验分析了WDM光网在不同路由策略下,相对于自相似业务的Hurst参量和标准偏差参量的动态性能此外,对在泊松业务和自相似业务下的WDM光网的动态性能做了比较。     

Mixed-Line-Rate IP over OTN网络中基于蚁群算法的路由和资源分配策略(英文)

混合线路速率场景下光传送网业务的路由和资源分配问题需要进行特定研究;根据网络的总代价更新蚁群的信息素表,对网络进行虚拓扑重构,由此实现基于蚁群算法的光网络路由和资源分配问题的启发式算法;并通过控制业务光路的时延来平衡网络的服务质量和成本.通过与k短路算法的仿真比较得出,对网络总代价而言,在不同的网络负载下,相对k短路算法,本算法拥有20%左右的性能优势;通过对不同线路速率及混合线路速率下的性能比较得出,本算法能很好地适应混合线路速率的场景并实现其优势,对解决混合线路速率场景下的光传送网业务路由和资源分配问题拥有良好的效果.     

基于一种高生存性RPR网络的路由研究

由标准弹性分组环衍生出的高生存性RPR网络弥补了单环结构中带宽浪费，利用率不高的缺点。基于此多环RPR网络提出了一种路由算法，它将网络中源节点到目的节点的路由过程转换成对相邻节点参考距离的选择，适应了网络的高生存性的特点。通过OPNET完成对路由算法模型的仿真，证明该算法实现了高生存性RPR网络的路由功能，而且具有转发跳数少，路由表结构简单，网络开销小等特点。     

WDM网状网中动态域间流量疏导策略

对波分复用(Wavelength Division Multiplexing,WDM)网状网中的动态域间流量疏导问题进行了深入研究.在源路由模式下,提出了一种基于固定备选路由方式的动态域间流量疏导算法,并在其基础上提出了只考虑波长均衡和同时考虑波长均衡与业务均衡的改进方法.该算法可以有效地避免路由环,得到较低的阻塞率,节省全网的收发器数目和波长资源.仿真结果表明,这种算法可以有效地改善网络性能.     

WDM光网络安全生存机制研究

针对WDM光网络安全生存性问题的故障的发现、定位和恢复三个重要环节之中的恢复问题,提出了一种WDM光层中的安全保护与恢复方案。采用了恢复路由选择算法和恢复波长分配算法,提出了一种混合的多层恢复机制,从而构建了一种从故障的发现、定位到故障恢复的覆盖各环节的连续性光网络安全生存机制,并在理论上进行了性能比较。     

一种求解虚波长路径光网络波长资源优化问题的启发式算法

本文提出了一种虚波长路径光网络的启发式路由选择算法,它可以用来解决以最小化网络所需波长数目为目标的资源优化问题.该算法应用了基于最大概率路径的选路优化策略.对一个样例网络的数值分析结果表明该算法是有效的.     

全光网络中动态业务下的阻塞性能分析

通过对自适应路由和动态备选路由算法的性能分析,研究了波长选择和波长交换这两种类型的全光网络在动态业务下的阻塞性能,并提出了将动态波长分配与自适应路由选择相结合的算法.数值结果表明:1)相比波长交换网络而言,多纤波长选择网络是更为经济且切实可行的选择;2)动态备选路由算法可以获得与自适应路由算法相似的性能,并且文中所提出的算法能够更好的提高网络的阻塞性能.分析表明:不同算法的性能与网络拓扑的连接度以及备选路由的数目密切相关.     

Survivable routing and wavelength assignment algorithm for multiple link failures in wavelength-routed all-optical WDM networks

In this paper, we have investigated the problem of enhancing multiple-fault restorability in the path protected wavelength-routed all-optical WDM networks. The system architecture considered is circuit-switched with dynamic arrival of session requests. We have proposed a mechanism, which is used to combat multiple link failures. A survivable routing and wavelength assignment algorithm has been proposed which is very efficient for the networks having multiple failures. This algorithm deals with the optical networks with multiple faults and is effective for the varying load applied to nodes. This algorithm works well for the load applied to the nodes varying from low to high.     

A new green multicast grooming protection algorithm in WDM optical networks

Since optical network carries a lot of traffic, survivability is very important to ensure the service continuity against network failures. Recently, multicast services become more popular to meet the huge multimedia demand in network, so that multicast survivability in optical network has got more attention. However, multicast survivability may lead to more energy consumption due to more redundant backup resources allocated. Since greening network is particularly important with the energy crisis keeping growing, green multicast survivability in optical network is a challenging issue. This paper focuses on the green multicast grooming protection problem in optical network and designs two auxiliary graphs that includes a virtual topology graph and an integrated graph to address the survivable multicast grooming, routing and wavelength assignment. Based on the auxiliary graphs, this paper proposes an efficient heuristic called green multicast grooming algorithm based on spanning path dedicated protection (GMG-SPDP), in which the network reliability and the energy efficiency are jointly taken into account. Simulation results show that, compared to other algorithms, the proposed GMG-SPDP not only has lower blocking probability and higher bandwidth utilization ratio, but also saves more energy.     

Survivable routing and spectrum allocation algorithm based on p-cycle protection in elastic optical networks

With the number of large capacity applications in core network increasing, the bandwidth requirement of optical connections in conventional Wavelength Division Multiplexing (WDM) networks keeps enhancing, so that the Orthogonal Frequency Division Multiplexing (OFDM) technology is adopted to provide higher spectrum efficiency and flexibility in the future elastic optical networks. Meanwhile, survivability in the conventional WDM optical networks has been widely studied as an important issue to ensure the service continuity. However, survivability in OFDM-based elastic optical networks is more challenging than that in conventional WDM optical networks because each fiber usually carries even more connections. Therefore, it is necessary to study the new lightpath protection algorithm in elastic optical networks. Since p-cycle protection scheme has short restoration time and simple protection switching procedure, in this paper, we study the static Survivable p-Cycle Routing and Spectrum Allocation (SC-RSA) problem with providing an Integer Linear Programming (ILP) formulation. Since RSA is a NP-hard problem, we propose a new heuristic algorithm called Elastic p-Cycle Protection (ECP) to tolerate the single-fiber link failure. For each demand, ECP scheme can compute highly-efficient p-cycles to provide protection for all of the on-cycle links and the straddling links. We also consider the load balancing and choose the proper working path for each demand. Simulation results show that the proposed ECP scheme achieves better performances than traditional single-line-rate survivable schemes.     

Survivable WDM-PON with self-protection and in-service fault localization capabilities

In this paper, we analyze the survivability of wavelength division multiplexed (WDM) passive optical network (PON). We propose and experimentally demonstrate a novel survivable WDM-PON architecture with self-protection and in-service fault localization capabilities. Two WDM-PONs are combined together and multiple sub-ring architecture is formed. Protection switching is achieved automatically at optical network units (ONUs) when failure occurs. Fiber loss, fiber fault localization and automatic protection switching in each ONU are real-time monitored in central office (CO) without interrupting customer service. No signaling for failure notice or protection switching is required for either CO or ONUs. Extra fibers required for protection are minimized compared with previous protection schemes. The self-protection and in-service fault localization capabilities of the proposed WDM-PON architecture are experimentally verified.     

Multicast protection algorithms based on aggregated logical topology in survivable multi-domain optical networks

Since the optical network carries a lot of traffic, the survivability is an important issue to ensure the service continuity. At the same time, with the network scale increasing, the optical network has been divided into multi-domains each of which is managed by a unique network provider. Therefore, the survivability in multi-domain optical networks has got more attention in recent years. However, current works mostly addressed the unicast survivability and few or no solved the multicast survivability in multi-domain optical networks. Therefore, in this paper we propose two heuristic algorithms called Multicast Multi-domain Dedicated Protection (MMDP) and Multicast Multi-domain Shared Protection (MMSP) to provide the survivability in multicast multi-domain optical networks. In MMDP and MMSP, to provide the intra-domain protection, we use the modified Minimal-cost Path Heuristic (MPH) algorithm to compute the intra-domain survivable multicast tree. To provide the inter-domain protection, based on multi-domain logical topology, we firstly use the MPH algorithm to compute the inter-domain logical multicast tree and then use the Dijkstra algorithm to compute the inter-domain logical backup sub-path for each inter-link on this logical multicast tree. Simulation results show that MMSP has better resource utilization efficiency and lower blocking probability.     

IP/WDM网络的集成服务质量(QoS)控制方法

对IP/WDM网络的集成服务质量（QoS）控制技术问题做了研究, 给出了基于通用多协议标记交换（GMPLS）技术的业务差分处理模型, 设计了新的业务分类、光路分类以及层间映射/疏导/重构策略, 给出了具体的映射技术方案. 本方法具有三大特点：1）光电集成的差分服务模型; 2）多粒度多优先级业务的自适应资源管理机制; 3）支持电信级应用. 该模型较好地折中了多种类型业务的QoS控制复杂性和有效性, 具有较强的实用性和可扩展性, 能够解决光因特网络中支持多媒体业务传送的QoS问题.