三层动态网络联合优化选路算法

 IP/MPLS over WDM被认为是下一代互联网络的最理想解决方案,但是在目前以及以后的很长一段时间内,网络结构仍然是IP/MPLS over SDH over WDM这样三层网络共存的情况。为了能够有效降低三层动态网络中的业务阻塞率,本文提出了三层动态网络联合优化选路算法。该算法分为两种模式,在模式1中,上层网络中被阻塞的业务可以开放的利用下层网络的空闲资源;在模式2中,将三层网络整合成为一个网络,在这个综合网络中为每一个业务进行选路。为了能够实时的传输每一个到达的动态业务,在这两种模式中采用蚁群策略为动态业务进行选路,提出了一个新的前向蚂蚁路径选择概率模型以及路径质量评判参数,使得所选的路径能兼顾链路利用率和路径跳数。仿真实验表明,同其他算法相比,本文提出的算法可以有效地降低三层动态网络的阻塞率。     

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.     

可变带宽光网络中多项式复杂度的频谱扫描路由算法

Optical Orthogonal Frequency Division Multiplexing (OOFDM) has been proposed as a highly spectrum-efficient modulation technique, which can provide flexible spectrum assignment with fine granularity. In OOFDM-based flexible optical networks, Routing and Spectrum Assignment (RSA) has become a key problem. However, widely used dynamic RSA schemes, such as Fixed Routing (FR) and K-shortest Paths (KSP) routing schemes, are not able to realize route computation based on the link state in-formation, thus leading to poor blocking performance and inefficient resource utilization. To solve this problem, Adaptive Routing (AR) schemes, e.g., the Entire Path Searching (EPS) scheme, have been proposed recently. These schemes have low blocking probability; however, since their computational complexities are factorial, they are not suitable for use in real networks. In this paper, we propose a novel Spectrum-Scan Routing (SSR) scheme in dynamic flexible optical networks. To the best of our knowledge, SSR is the first polynomial-time AR scheme that can realize adaptive shortest-route computation. Simulation results show that our proposed SSR scheme has lower blocking probability and higher resource utilization compared with FR and EPS. Moreover, the worst-case computational complexity of SSR increases linearly with the network scale of the torus topologies, making it applicable to real networks.     

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.     

A novel partition-plane impairment aware routing and spectrum assignment algorithm in mixed line rates elastic optical networks

In mixed line rates elastic optical networks, different line rate signals can coexist on the same fiber. As different line rates coexist in the same fiber, the impairments, especially the cross-phase modulation (XPM), become more and more serious affecting the quality of transmission of signals. Moreover, the spectrum constraints limit the efficient allocation of spectrum resources. In this paper, we propose a novel spectrum Partition-topology Plane impairments aware routing and spectrum assignment algorithm to set up lightpaths for connection requests, therefore decreasing the XPM impairments and increasing spectrum utilization. The proposed algorithm can satisfy the spectrum constraints restriction and avoid the XPM impairment together. The simulation results show that the proposed algorithm can significantly improve the performance of networks in blocking probability and the spectrum efficiency.     

An Innovative Solution for Dynamic Bandwidth Engineering in IP/MPLS Networks with QoS Support

This paper reports an original module for effectively handling bandwidth resources in a multi-service MPLS network. This module, named bandwidth engineering, allows accommodating more traffic with respect to traditional IP networks, reducing the network blocking probability, while preserving Class of Service (CoS) requirements. It consists of an algorithm that handles priority between label switched paths associated to different classes of services, and of a dynamic routing algorithm that works with the bandwidth constraint. Simulation results are reported to assess the validity of the proposed solution.     

Design of programmable logic device based on electro-optic effect of lithium-niobate-based Mach–Zehnder interferometers

Elastic optical network (EON) technology is considered as a very promising candidate for future high-speed networks due to its intrinsic flexibility and high efficiency in allocating the optical spectrum resources. The key issue that has to be addressed in EON is the routing and spectrum allocation (RSA) problem. RSA is NP-hard problem that has to be solved in an efficient manner. It is a highly challenging task particularly in the case of large problem instances. In this paper, we applied the bee colony optimization (BCO) metaheuristic approach to solve the RSA problem in EON with static traffic demands. The objective of the proposed BCO–RSA algorithm is to minimize both the network spectrum utilization and the average path length criterions. The results of numerous experimental studies show that our BCO–RSA algorithm performs superior compared to some benchmark greedy heuristics as well as to differential evolution (DE) metaheuristic algorithm recently proposed in the literature. The algorithm is evaluated in different realistic size optical networks, such as the NSFnet, two European optical networks (EON-19 and EON-28) and the USA network topology. Simulation results demonstrate that considerable spectrum savings could be achieved with our BCO–RSA algorithm compared to other considered approaches. In addition, we analyzed the efficiency of the BCO–RSA algorithm and compare it with the competitive DE approach according to the required CPU time and the convergence speed.     

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

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

Survivable spectrum-shared ability in flexible bandwidth optical networks with distributed data centers

The survivable spectrum-shared ability problems are addressed by considering the shared-path protection in flexible bandwidth optical networks with distributed data centers. The overall objective of this paper is to investigate the effect of the spectrum-shared ability on the spectrum efficiency and the blocking probability of cloud service requests. We propose a survivable algorithm with the spectrum-shared ability (SA_SSA) to minimize blocking probability of cloud service requests and to improve the spectrum efficiency in shared-path protection. For comparison, an existing shared-path protection algorithm named Aggressive algorithm with spectrum-shared ability is also introduced. Simulation results show that, considering the different spectrum-shared abilities, our proposed SA_SSA has a better performance in terms of blocking probability, number of frequency slots/Erlang, spectrum occupation ratio, and spectrum redundancy ratio compared to Aggressive algorithm in flexible bandwidth optical networks with distributed data centers. Meanwhile, the spectrum efficiencies of the SA_SSA and Aggressive algorithms improve as the spectrum-shared abilities are strengthened.     

An Ant-Based Approach for Dynamic RWA in Optical WDM Networks

In this paper, we propose a new ant-based algorithm for the dynamic routing and wavelength assignment (RWA) problem in optical WDM networks under the wavelength continuity constraint. Unlike conventional approaches, which usually require centralized global network information, our new RWA algorithm constructs the routing solution in a distributed manner by means of cooperative ants. To facilitate the ants’ foraging task, we adopt in our algorithm a probabilistic routing table structure for route selection. The new algorithm is highly adaptive in that it always keeps a suitable number of ants in the network to cooperatively explore the network states and continuously update the routing tables, so that the route for a connection request can be determined promptly by the current states of routing tables with only a small setup delay. Some new schemes for path scoring and path searching are also proposed to enhance the performance of our ant-based algorithm. Extensive simulation results upon three typical network topologies indicate that the proposed algorithm has a very good adaptability to traffic variations and it outperforms both the fixed routing algorithm and the promising fixed–alternate routing algorithm in terms of blocking probability. The ability to guarantee both a low blocking probability and a small setup delay makes the new ant-based routing algorithm very attractive for both the optical circuit switching networks and future optical burst switching networks     

A novel method to evaluate clustering algorithms for hierarchical optical networks

The routing issues in multi-layer and multi-domain optical networks have drawn much attention in current research. With the introduction of the path computation element, routes can be calculated more efficiently in multi-domain optical networks. However, the optimal degree of routing approach in multi-layer and multi-domain optical networks is also determined by the clustering algorithms deployed for construction of hierarchical networks. Therefore, it is important to investigate the way to evaluate the impact of the clustering algorithm on the routing approach (e.g., blocking probability) in optical networks with dynamic traffic, which has not been studied sufficiently. In this paper, a novel method to describe and evaluate the clustered structures generated by different clustering algorithms for hierarchical optical networks is proposed. This method deploys a novel evaluation metric that represents blocking probability of clustered optical networks, so it can be used as guidelines for designing clustered structures. Besides theoretical analysis, simulations are carried out on different network topologies and clustered types to validate the effectiveness of the method presented.     

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

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

Experimenting with bandwidth-variable routing and signaling on a large-scale ASON test-bed

Bandwidth-variable (BV) optical networks have been proposed as a novel technology to provide spectrum-efficient transportation. In order to study the performance of the BV optical networks, we propose a BV extension to RSVP-TE signaling protocol and implement it with different routing schemes on our large-scale ASON test-bed. Results show that the adaptive routing (AR) combined with forward reservation RSVP-TE signaling (AR+RSVP-fBV) scheme has lower routing blocking probability; however, since its signaling blocking probability is higher than the fixed routing (FR) combined with backward reservation RSVP-TE signaling (FR+RSVP-bBV) scheme, it has no significant advantage in the overall blocking performance, especially in a highly dynamic network scenario. The introduction of spectrum conversion cannot improve the overall blocking performance significantly due to its higher signaling blocking probability, and worse yet, it increases setup delay.     

Strategy for Dynamic Routing and Grooming of Data Flows into Lightpaths in New Generation Network Based on the GMPLS Paradigm

This paper reports on a novel strategy and related algorithm for realizing dynamic routing and grooming into wavelengths of data flows (label switched paths, LSPs) in new generation optical networks based on generalized MPLS (GMPLS). The method allows arbitrary granularities of LSPs. The new generation network is modeled as a multi-layer network consisting of an IP/MPLS layer and an optical layer. In particular, the proposed solution adopts a dynamic routing algorithm based on the Dijkstra algorithm, that makes use of a weight system, integrated with a suitable method for grooming LSPs into wavelengths based on the packing criterion, thus harmonizing the features of MPLS packet flows whose bandwidth vary in a continuous range of values, with the optical world, where the wavelength bandwidth ranges according to discrete values. The weight system is based on the concepts of least resistance routing that allows to evenly distribute the traffic at the MPLS layer, while packing improves the use of optical resources by favoring more filled wavelengths with respect to the emptier ones. To assess the validity of the proposed solution a simulation model has been realized. The results obtained by simulation show that the packing criterion allows reducing the refused bandwidth from two down to about four times, for a network load of 70% and 55%, respectively, when compared with the alternative method named spreading. The dependence of the proposed solution on bandwidth granularity has been also investigated. Moreover, in order to demonstrate the superior performance of the proposed routing solution, a comparison between the proposed strategy with relevant solutions known in the literature, based on either a single or multi-layer approach, is also reported. In order to perform the comparison, all the reference routing solutions that have been considered adopt the packing method for LSP grooming into the lightpaths. The results show that our solution outperforms the others in terms of amount of traffic that can be on-line accommodated. For instance, assuming a blocking probability of 10^–3, the proposed solution is able to further reduce the refused bandwidth of the best routing algorithm considered in the analysis by a factor of three times, thanks to the knowledge of optical resource availability.     

Routing,modulation level and spectrum allocation with dynamic modulation level conversion in elastic optical networks

Elastic optical network is introduced as a promising technology to provide multi-bitrate-friendly data transmission in the optical layer. Elastic optical networks are based on flexible modulation format conversion, which can make more efficient use of spectrum resources than current fix-grid WDM networks. In this paper, we define the routing, modulation level and spectrum resource allocation (RMLSA) problem and then propose two novel dynamic modulation level conversion (MLC) enabled RMLSA algorithms. Numerical simulations are conducted to compare the performance of the path modulation level conversion (Path-MLC) and link modulation level conversion (Link-MLC) with different MLC thresholds with K-shortest paths RSA in terms of blocking rate, occupied spectrum and the number of MLCs across two topologies. The results verify that the Link-MLC with unlimited MLC achieves the lowest blocking rate and moderate spectrum utilization at the expense of intermediate node modulation conversions in two topologies. Smaller MLC threshold has higher blocking rate and occupied less spectrum resource. The results also suggest that the Path-MLC approach is more resource efficient than the Link-MLC with relatively higher blocking rate, and this method maybe more preferable in the networks with tight budget and/or energy constraints.     

Hop distance–based bandwidth allocation technique for elastic optical networks

Elastic optical networks (EON) have emerged as a solution to the growing needs of the future internet, by allowing for greater flexibility, spectrum efficiency, and scalability, when compared to WDM solutions. EONs achieve those improvements through finer spectrum allocation granularity. However, due to the continuity and contiguity constrains, distant connections that are routed through multiple hops suffer from increased bandwidth blocking probability (BBP), while more direct connections are easier to form. This paper proposes HopWindows, a novel method that strategically allocates bandwidth to connections based on their hop distance. This new algorithm applies masks that control the range of frequency slots (FSs) allocated to each n‐hop connection. Furthermore, a new network metric is introduced, the normalized bandwidth blocking probability (normalized BBP). Utilization of this metric ensures increased fairness to distant connections. Extended simulation results are presented which indicate that the proposed HopWindows method achieves a superior performance over the well‐known FirstFit algorithm. The proposed algorithm may achieve a decrease in bandwidth blocking probability of up to 50%.     

串扰感知的空分弹性光网络频谱转换器稀疏配置和资源分配方法

针对大容量多芯光纤空分复用弹性光网络(SDM-EON)中芯间串扰导致业务传输质量下降和阻塞率上升的问题,该文提出了节点稀疏配置频谱转换器降低芯间串扰的路由纤芯频谱分配方法。该方法根据网络中节点中介中心性稀疏配置频谱转换器。在业务路由阶段,设计综合考虑光路负载和节点频谱转换能力的光路选择的权重方法;为了降低串扰,在纤芯频谱分配阶段,设计纤芯分组和频谱分区分配方法;最后,针对串扰较大的业务,采用频谱转换以降低业务串扰和改善带宽阻塞率。仿真结果表明,所提算法能有效地提高频谱利用率,降低因芯间串扰导致的带宽阻塞率。     

备用路由下一种新的WDM动态路由波长分配算法

基于波长转换度的空闲波长图模型,提出了一种用于WDM光网络在备选路由下的动态RWA算法。路由选择采用K条最短路径算法进行,备选路由集中首选最佳路由时考虑链路的代价、跳数和每一个链路上不可用波长数。通过计算机模拟,分析这3个参数对网络的阻塞率的影响,结果表明本算法中所选定研究的3个参数中选定路由的不可用波长数对网络阻塞率的影响程度比通道的代价,跳数对网络的影响程度大,这个结论对算法中这3个参数数值的选取提供了依据,使算法能够依据实际网络情况动态选取参数,降低网络阻塞率。     

Multicast service protection algorithm based on elastic optical network

With the rapid growth of the network traffic,the elastic optical network (EON) has been proposed as a promising solution due to its high spectrum efficiency and flexible bandwidth provision.Meanwhile,multicast routing and spectrum allocation,and the survivability of the network become more challenging than that in the conventional optical network.The routing for multicast traffic and its protection algorithm in EON was investigated.An integer linear programming (ILP) formulation with the objective to minimize total spectrum consumption was presented.In addition,a heuristic algorithm called multicast sub-tree protection algorithm (MSPA) to achieve sufficient protection and satisfy resources savings was designed.The simulation results demonstrate that comparing with the traditional multicast routing and protection algorithm,MSPA performs well in improving the blocking probability and the spectrum utilization of the network.     

A Bandwidth Guaranteed Integrated Routing Algorithm in IP over WDM Optical Networks

In this paper, we have developed an integrated online algorithm for dynamic routing of bandwidth guaranteed label switched paths (LSPs) in IP-over-WDM optical networks. Traditionally, routing at an upper layer (e.g., IP layer) is independent of wavelength routing at the optical layer. Wavelength routing at the optical layer sets up a quasi-static logical topology which is then used at the IP layer for IP routing. The coarse-grain wavelength channels and the pre-determined virtual topologies with respect to some a priori assumed traffic distribution are barriers to efficient resource use and inflexible to changing traffic. We take into account the combined knowledge of resource and topology information at both IP and optical layers. With this added knowledge, an integrated routing approach may extract better network efficiencies, be more robust to changing traffic patterns at the IP layer than schemes that either use dynamic routing information at the IP layer or use a static wavelength topology only. LSP set-up requests are represented in terms of a pair of ingress and egress routers as well as its bandwidth requirement, and arrive one-by-one. There is no a priori knowledge regarding the arrivals and characteristics of future LSP set-up requests. Our proposed algorithm considers not only the importance of critical links, but also their relative importance to routing potential future LSP set-up requests by characterizing their normalized bandwidth contribution to routing future LSP requests with bandwidth requirements. Moreover, link residual bandwidth information that captures the link's capability of routing future LSPs is also incorporated into route calculation. Extensive simulation was conducted to study the performance of our proposed algorithm and to compare it with some existing ones, such as the integrated minimum hop routing algorithm and the maximum open capacity routing algorithm. Simulation results show that our proposed algorithm performs better than both routing algorithms in terms of the number of LSP set-up requests rejected and the total available bandwidth between router pairs.