Bee Colony Optimization Algorithm for Routing and Wavelength Assignment Based on Directional Guidance in Satellite Optical Networks

With the development of satellite communication,in order to solve the problems of shortage of on-board resources and refinement of delay requirements to improve the communication performance of satellite optical networks,this paper proposes a bee colony optimization algorithm for routing and wavelength assignment based on directional guidance(DBCO-RWA)in satellite optical networks.In D-BCORWA,directional guidance based on relative position and link load is defined,and then the link cost function in the path search stage is established based on the directional guidance factor.Finally,feasible solutions are expanded in the global optimization stage.The wavelength utilization,communication success probability,blocking rate,communication hops and convergence characteristic are simulated.The results show that the performance of the proposed algorithm is improved compared with existing algorithms.

An Ant Colony Algorithm Based on Cross-Layer Design for Routing and Wavelength Assignment in Optical Satellite Networks

This paper introduces an ant colony routing and wavelength assignment algorithm based on cross-layer design(CL-ACRWA),which can overcome the adverse effects of Doppler wavelength shift on data transmission in optical satellite networks. Firstly, a cross-layer optimization model is built, which considers the Doppler wavelength shift, the transmission delay as well as wavelength-continuity constraint. Then an ant colony algorithm is utilized to solve the cross-layer optimization model, resulting in finding an optimal light path satisfying the above constraints for every connection request. The performance of CL-ACRWA is measured by the communication success probability, the convergence property and the transmission delay. Simulation results show that CL-ACRWA performs well in communication success probability and has good global search ability as well as fast convergence speed. Meanwhile, the transmission delay can meet the basic requirement of real-time transmission of business.

Dynamic Routing and Wavelength Assignment for Multi-Lightpath Demands

In wavelength division multiplexing (WDM) networks without wavelengthconversion functionality, we convert the dynamic routing and wavelength assignment problem formulti-lightpath demands to the edge-disjoint paths problem, and propose a new algorithm. Thecomputer simulations show that the proposed algorithm has better blocking probability performancethan a sequential algorithm, which first separates a multi-lightpath demand into mutilplesingle-lightpath demands, then uses the fixed-alternate routing-first fit wavelength assignment(AR-FF) algorithm for each single-lightpath demand.

A Distributed Routing and Wavelength Assignment Algorithm for Online Multicast in All-Optical WDM Networks

Routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths on links and the consideration of wavelength conversion delay in WDM networks. This paper presents a distributed routing and wavelength assignment scheme for the setup of real-time multicast connections. It integrates routing and wavelength assignment as a single process, which greatly reduces the connection setup time. The proposed routing method is based on the Prim’s MST (Minimum Spanning Tree) algorithm and the K-restricted breadth-first search method, which can produce a sub-minimal cost tree under a given delay bound. The wave-length assignment uses the least-conversion and load balancing strategies. Simulation results show that the proposed algorithm is suitable for online multicast connection establishment in WDM networks.

Routing and Wavelength Assignment in GMPLS-based 10 Gb/s Ethernet Long Haul Optical Networks with and without Linear Dispersion Constraints

Given a set of lightpath connection requests in an all-10 Gb/s optical dense wavelength division multiplexed (DWDM) Ethernet network, lightpaths are designed. In addition the wavelength channels are assigned subject to minimization of the channel blocking and provisional requests satisfying the limits due to accumulative linear dispersion effects over the hops. This paper proposes a routing and wavelength assignment scheme for DWDM long-haul optical networks that includes routing, assignment and reservation of different wavelength channels operating under the Generalized Multiprotocol Label Switching (GMPLS) environment. The GMPLS framework can offer an approach to implement IP over DWDM with variable weighting assignments of routes based on the limitations due to residual dispersion accumulated on the lightwave path. The modeling is implemented under the framework of an object-oriented modeling platform OMNeT++. Network performance tests are evaluated based mainly on a long-haul terrestrial fiber mesh network composed of as well as three topologies structured as chain, ring, and mesh configurations. Blocking probability of lightpath connection requests are examined with the average link utilization in the network employing variable number of wavelength channels in association with the limits of route distance due to linear chromatic and polarization mode dispersion effects.

A New Multicast Wavelength Assignment Algorithm in Wavelength-Converted Optical Networks

In this paper, we propose a new multicast wavelength assignment algorithm called NGWA with complexity of O(N), where N is the number of nodes on a multicast tree. The whole procedure of NGWA algorithm is separated into two phases: the partial wavelength assignment phase and the complete wavelength assignment phase. It tries to minimize the total number of wavelength conversions of the multicast tree. Meanwhile, the number of different wavelengths used is minimized locally. Through illustrative example and simulation experiments, it is proved that the NGWA algorithm works well and achieves satisfactory performance in terms of the average number of wavelength conversions and the average blocking probability.

Dynamic routing and wavelength assignment algorithm of optical satellite networks based on cross-layer design

In order to overcome the adverse effects of Doppler wavelength shift on data transmission in the optical satellite networks,a dynamic routing and wavelength assignment algorithm based on crosslayer design( CL-DRWA) is introduced which can improve robustness of the network. Above all,a cross-layer optimization model is designed,which considers transmission delay and wavelength-continuity constraint,as well as Doppler wavelength shift. Then CL-DRWA is applied to solve this model,resulting in finding an optimal light path satisfying the above constraints for every connection request. In CL-DRWA,Bellman-Ford method is used to find an optimal route and a distributed relative capacity loss method is implemented to get an optimal wavelength assignment result on the optimal route. Moreover,compared with the dynamic routing and wavelength assignment algorithm based on minimum delay strategy( MD-DRWA),CL-DRWA can make an improvement of 5. 3% on the communication success probability. Meanwhile,CL-DRWA can meet the requirement of transmission delay for real-time services.

ROUTING AND WAVELENGTH ASSIGNMENT ALGORITHMS BASED ON EQUIVALENT NETWORKS

In this paper, a Wavelength Division Multiplexing (WDM) network model based on the equivalent networks is described, and wavelength-dependent equivalent arc, equivalent networks, equivalent multicast tree and some other terms are presented. Based on this model and relevant Routing and Wavelength Assign- ment (RWA) strategy, a unicast RWA algorithm and a multicast RWA algorithm are presented. The wave- length-dependent equivalent arc expresses the schedule of local RWA and the equivalent network expresses the whole topology of WDM optical networks, so the two algorithms are of the flexibility in RWA and the optimi- zation of the whole problem. The theoretic analysis and simulation results show the two algorithms are of the stronger capability and the lower complexity than the other existing algorithms for RWA problem, and the complexity of the two algorithms are only related to the scale of the equivalent networks. Finally, we prove the two algorithms’ feasibility and the one-by-one corresponding relation between the equivalent multicast tree and original multicast tree, and point out the superiorities and drawbacks of the two algorithms respectively.

A novel wavelength assignment scheme in OBS network for contention avoidance

Conventional optical burst switching(OBS)technique adopts purely statistical multiplex mechanismso that the bursts collide with each other very easily.To address this problem,a novel proactive con-tention avoidance scheme is proposed,which assigns dedicated wavelengths to each ingress node,then st-numbering algorithm is used to construct the traffic load balanced spanning trees .In this way,contentioncan be eliminated at ingress nodes,and the amount of bursts that could be accommodated by ingressnodes will be maximized.Further,those unused wavelengths left by traffic load balanced spanning treeare also organized as partial trees to carry bursts,thus the link utilization can be improved effectively.Simulation result shows that our scheme can improve the burst loss performance significantly without thewavelength converters or optical buffers comparing to other popular routing and wavelength assignment(RWA)algorithms.

基于改进天牛须群落的卫星光网络路由算法

针对当前卫星光网络路由算法波长利用率低,通信成功率低,导致路由效率低下的问题,提出一种改进天牛须群落的卫星光网络路由算法(BS-ACRWA)。该方法使用波长矩阵乘的形式生成与当前卫星节点相邻节点的波长冲突度,求得最大公有波长数,同时考虑时延和卫星节点负载状态构建约束优化模型,降低无效路由的次数。在路由阶段对天牛须群落算法进行改进,引入蚁群算法信息素机制,在搜索方向上充分考虑卫星之间链路有限的特性,对搜索方向进行更新,提高算法效率。仿真结果表明:与SARWA算法、CL-ACRWA算法和Dijkstra算法相比,BS-ACRWA算法将波长利用率提高了0.05、0.11、0.23,同时在平均时延、丢包率、阻塞率、路由成功率等方面具有更好的性能。

卫星光网络中基于DQN的匹配度感知波长路由算法

为了进一步降低卫星光网络的业务阻塞率,提出了一种基于深度Q网络(DQN)的匹配度感知波长路由算法。该算法首先设计了路径波长匹配度因子,用以反映当前路径与下一跳节点之间链路的共同空闲波长情况。随后,算法综合考虑了路径波长匹配度、相邻链路时延以及下一跳节点到目的节点的最短跳数等多个因素,以此为基础来构造奖励函数。在分配波长时,为了后续业务请求在相邻链路上有更多的空闲波长,设计了相邻链路波长匹配度指标,用于描述该路径与其相邻链路之间的空闲波长对齐情况。仿真结果表明,该算法可以降低网络阻塞率和时延,提高波长利用率。

A SYNTHETIC ALGORITHM FOR WAVELENGTH ROUTING IN OPTICAL NETWORK

After analyzing the merits and shortcomings of Fixed-Alternated Routing algorithm (FAR) and Least Loaded Routing algorithm (LLR),we propose one novel dynamic optical routing algorithm. Having considered the influences of path’s length and path’s congestion just like in FAR and LLR,we take into account the network resource status-amount of free wavelengths in the network. Proposed algorithm sets up connections on three possible paths according to amount of available free wave-lengths in the network,which effectively decreases the blocking probability. The National Science Foundation (NSF) network and mesh-torus network simulation results show that the performance of this algorithm is better than that of FAR and LLR.

Routing and wavelength assignment in hierarchical WDM networks

A new routing and wavelength assignment method applied in hierarchical wavelength division multiplexing(WDM)networks is proposed.The algorithm is called offline band priority algorithm(offline BPA).The offline BPA targets to maximize the number of waveband paths under the condition of minimum number of wavelengths,and solve the routing and wavelength assignment(RWA)problem with waveband grooming to reduce cost.Based on the circle construction algorithm,waveband priority function is introduced to calculate the RWA problem.Simulation results demonstrate that the proposed algorithm achieves significant cost reduction in WDM network construction.

DWDM光传送网中选路和波长分配

本文综述了密集波分复用 (DWDM)光传送网中选路和波长分配 (RAW )研究领域的最新研究成果。分析比较了固定路由和备用路由下不同RAW算法的性能 。

一种新的WDM光网络波长分配算法

分析比较了目前WDM光网络中提出的各种固定路由选路下的波长分配算法.提出了一种新的固定路由选路的波长分配算法,并在环网、Mesh网和类教育网中,对新算法和已有算法进行性能仿真.仿真结果表明,新算法减小了网络的阻塞概率,性能优于已有的算法.

WDM网络中P圈保护算法

为了充分利用WDM光网络中空闲波长资源,并提高整个网络性能,对P圈保护算法进行了深入的研究,提出了不同的P圈评价标准,并以此为基础,进一步从基础圈的选择、P圈扩张策略以及P圈扩张周期3个角度出发,提出了一系列新型的P圈生成算法.仿真结果表明,这些新型的P圈生成算法可以应用于不同的网络环境中,与传统的保护算法相比,提高了网络资源的使用效率.

WDM光传送网中支持优先级的波长分配算法

文中提出了一种用于WDM光传送网的支持优先级的波长分配算法———动态门限法 ,该算法保证了较高优先级的光路建立请求具有较低的阻塞率 ,同时又考虑到较低优先级的光路建立请求的性能优化 ,从而很好地降低了全网的平均阻塞率。文中给出了计算机仿真结果。

采用蚁群算法解决光网络中动态及分布式RWA问题的方法

为了在大规模节点网络中提高路由与波长分配(RWA)算法的性能指标,解决集中式计算方式与网络资源实时变化之间的矛盾问题,提出了一种基于动态业务模型下的分布式蚁群算法.该方法在波长连续的前提下,尝试利用蚂蚁找食的天然特性,由单只蚂蚁一次性的完成路由和波长分配任务,算法在两个具备不同规则的拓扑结构上进行了仿真.通过算法分析和仿真结果表明,基于分布式的策略可以更好地完成光路的选择,可降低光网络中的呼叫阻塞率,有利于提高网络资源的利用率.