Static and dynamic routing and wavelength assignment algorithms for future transport networks

In this paper, two static and three dynamic routing algorithms have been proposed and compared to some of the existing algorithms on the basis of blocking probability. The two proposed static routing and wavelength assignment (RWA) algorithms reduce the blocking probability to maximize the utilization of network. For dynamic algorithms, first a model with no weights assignments is presented and then three algorithms are proposed and analysed with weight assignment resulting in reduction of blocking probability. All these algorithms are analysed and compared with four wavelength assignment schemes which are first-fit, random, most used and least used. It is shown that our proposed static algorithms give the best performance for first-fit wavelength assignment and most used wavelength assignment strategies with reduced complexity. For least used wavelength assignment and random wavelength assignment, 1 fixed and 2 alternate routing algorithm gives the lowest blocking probability. For dynamic routing, it has been shown that our proposed algorithm “less weight to maximum empty and nearest” gives the least blocking probability as compared to the other dynamic routing algorithms for random, most used and least used wavelength assignment strategies.     

Routing and wavelength assignment in WDM networks with dynamic link weight assignment

We consider the routing and wavelength assignment problem on wavelength division multiplexing networks without wavelength conversion. When the physical network and required connections are given, routing and wavelength assignment (RWA) is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. In wavelength division multiplexing (WDM) optical networks, there is need to maximize the number of connections established and to minimize the blocking probability using limited resources. In this paper, we have proposed three dynamic link weight assignment strategies that change the link weight according to the traffic. The performance of the existing trend and the proposed strategies is shown in terms of blocking probability. The simulation results show that all the proposed strategies perform better than the existing trend.     

Combined Path and Maximum Empty Static Routing Algorithms with Wavelength Assignment for Future Transport Networks

Abstract

In this article, two static routing algorithms have been proposed and compared to some of the existing algorithms on the basis of blocking probability. The two proposed static routing and wavelength assignment algorithms reduce the blocking probability to maximize the utilization of the network. All of these algorithms are analyzed and compared with four wavelength assignment schemes, which are first-fit, random, most used, and least used. It is shown that our proposed static algorithms give the best performance for first-fit wavelength assignment and most used wavelength assignment strategies with reduced complexity. For least used wavelength assignment and random wavelength assignment, 1 fixed and 2 alternate routing algorithm gives the lowest blocking probability.     

智能光网络中一种新型的分布式恢复方法

提出了一种基于固定备用路由和目的端触发的智能光网络中的分布式恢复方法,所选择的任一对源端节点和目的的端节点之间的固定备用路由包括该节点对之间的k条最短路径路由和基于部分链路无关的路由.目的端节点一旦探测到业务通道的失效将立即启动恢复进程,根据网络当前的资源使用情况,在这些备用路由中按照一定的次序选择一条恢复路由并为此分配一条可用的波长(对于没有波长变换器的光网络),然后将恢复通道的建立请求消息发送给该恢复通道的相关节点,这些相关节点可以锁定相关的网络资源,以避免来自其他恢复通道的竞争.所提出的算法增加了固定备用路由的数量,从仿真结果可以看出,该方法明显改善了失效连接的阻塞性能.     

A QoS-aware wavelength assignment scheme for optical networks

Dispersion in fiber optic is wavelength dependent and it degrades the quality of service (QoS) in an optical network. Although use of dispersion compensating fiber reduces the effects of dispersion but it is very costly. In this paper, we propose a QoS-aware wavelength assignment (QWA) scheme to improve the quality of service in an optical network by reducing the overall dispersion in the network. In this scheme, the connection requests with longer lightpath are assigned the wavelengths having lesser dispersion and the wavelengths having higher dispersion are assigned to the lightpaths with shorter distance. The lightpaths are computed using alternate path routing to achieve the lower blocking probability. The performance analysis of QWA scheme is done in terms of total dispersion using step-index fiber (SIF). Results of our experiments show that QWA scheme outperforms conventional wavelength assignment scheme based on First-Fit method (WAFF).     

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

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

Delay-constrained anycast routing problem in WDM networks with wavelength conversions

Anycast routing and wavelength assignment problem has been intensively studied in wavelength-division multiplexing (WDM) networks, however, real-time application where packets have explicit expiration deadlines is not taken into consideration. In a WDM network, each link is associated with limited wavelengths available for channel connections. Data transmission over one wavelength to another requires wavelength conversion, which causes a long delay of message transmission. When the network and the set of anycast routing requests are given, the delay-constrained wavelength conversions anycast routing (DWCAR) problem is to find a set of light-paths, one for each source, for anycasting message to one member of the anycast destination group. The objective is to find a minimum number of wavelength conversions with the constraint that the sum of delays along every path must not exceed a given delay-bound. In this paper, we present a Tabu-search based delay-constrained anycast routing algorithm (TSDA) to solve this NP-complete problem, and compare it to a simple K shortest path based anycast algorithm (KSPA). Simulation results show TSDA achieves an average 40–50% improvement in required wavelength conversions.     

Translucent Optical Networks Design for Static Traffic

A routing and wavelength assignment algorithm is proposed to minimize the number of wavelengths and transceivers required simultaneously under static traffic in translucent optical networks design.     

WDM全光网络中一种分布式路由及波长分配协议

在全光网络中,光信号在全光域内传输,避免了光-电转换带来的延迟,因此全光网支持高数据率传输并提供巨大的网络容量。WDM(波分多路复用)技术的采用使得高速光传输线路与低速终端处理设备之间能够相互兼容。探讨了WDM全光网中的路由及波长分配问题,提出了一种用于WDM网络中的分布式路由及波长分配协议,具有开销小、阻塞率低以及良好的可扩展性,是一种比较实用的RWA协议。     

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

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

Generic-II routing and wavelength assignment algorithm for a wavelength-routed WDM network

In this paper, we have developed a Generic routing and wavelength assignment algorithm (Generic RWA-II) which is used for the calculation of blocking probability of network. A simple mathematical model has also been proposed for the optimization and minimization of blocking probability. The implementation of the proposed model and algorithm has less complexity and the computation used in this model is quite efficient. This paper suggests an optimum path and assigns wavelength to that path, as a solution to routing and wavelength assignment problem to have least blocking probability. This model can be implemented on different network topologies. Further, the model is also used to evaluate the blocking performance of a 6-node simple network topology and hence used to improve its performance on the basis of blocking probability.     

A New RWA Algorithm Based on Multi-Objective

In this article , we studied the associated research problems and challenges on routing and wavelength assignment (RWA) in WDM (wavelength division multiplexing) networks. Various RWA approaches are examined and compared.We proposed a new RWA algorithm based on multi-objective. In this new algorithm, we consider multiple network optimizing objectives to setup a lightpath with maximize profit and shortest path under the limited resources. By comparing and analyzing, the pro posed algorithm is much better than the algorithms, which only consider one optimizing objective.     

A heuristic priority based wavelength assignment scheme for optical networks

We propose a heuristic priority based wavelength assignment (HPWA) scheme to minimize the blocking probability. In this scheme, the connection requests having same s–d pair are groomed first and then these groomed connection requests are served for routing and wavelength assignment according to their priority order. The priority order of each groomed connection request is estimated based on both the types of path (direct link physical path or in-direct link physical path) first and then their traffic volume. The performance analysis of our proposed scheme is made in terms of blocking probability and compared the same with similar heuristic non-priority based wavelength assignment (HNPWA) scheme. Simulation study shows that the blocking probability of HPWA scheme is less than that of NPRWA. It is also seen that the performance of the proposed scheme is better in comparison to HNPWA, when the number of connection requests increases in the network.     

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

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

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

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

Performance analysis of topologies for optical wavelength convertible networks

An architecture of wavelength converters shared per-node wavelength cross-connects is proposed to function the optical node in simulation. And first-fit wavelength allocation algorithm and Dijkstra shortest path routing algorithm are used. It is shown that star topology performs the best on blocking probability, average hop count and average packet delay, but it is unfavorable on link utilization. Furthermore, wavelength conversion is not ideal for the star topology. However, the ring topology network is the cost-optimal one if the appropriate wavelength conversion capability in network is to be considered.     

Generic routing and wavelength assignment algorithm for a wavelength-routed WDM network

In this paper, we have developed a simple mathematical model which is used for the calculation of blocking probability of network. A generic routing and wavelength assignment algorithm has also been proposed for the optimization and minimization of blocking probability. The implementation of the proposed model has less complexity and the computation used in this model is quite efficient. This paper suggests an optimum path and assigns wavelength to that path, as a solution to routing and wavelength assignment problem to have least blocking probability. This model can be implemented on different network topologies. Further, the model is also used to evaluate the blocking performance of a 6-node simple network topology and hence used to improve its performance on the basis of blocking probability.     

Routing and wavelength assignment in wavelength-routed all-optical WDM networks

In this paper, low-complexity mathematical model has been developed which is used for the calculation of the blocking probability of network and this model does not require any simulation statistics. The implementation of the model proposed has less complexity and the computation used in this model is quite efficient. The routing algorithm has also been proposed in this paper depending upon the proposed model, which is very efficient in calculation and minimization of the blocking probability. This algorithm suggests an optimum path as a solution to routing problem. The wavelength assignment technique has also been suggested in this paper to minimize the blocking probability. The proposed model and algorithms can be implemented on different network topologies. Furthermore, the model, routing algorithm and wavelength assignment technique is also used to evaluate the blocking performance of NSFNet and EUPAN Network topology and hence used to improve its performance on the basis of the blocking probability.     

Wavelength assignment algorithms for WDM optical networks

In this paper, we have proposed an efficient wavelength assignment algorithm for dynamic provisioning of lightpath. This proposed algorithm is based on most-used wavelength assignment algorithm. We have also suggested a mathematical model for WDM optical networks for minimization of blocking probability. The results of proposed algorithm and suggested model are then compared with the conventional wavelength assignment algorithms such as first-fit, best-fit, random and most-used wavelength assignment algorithms. These proposed approaches are very effective for the minimization of blocking probability of optical WDM networks.     

Wavelength assignment for all-to-all broadcast in bidirectional WDM optical ring with limited drops

All-to-all broadcast is to disseminate a unique message from each node to every other node in a network. This problem is significant in the context of control plane design as it relates to status information dissemination. In this paper, a wavelength assignment method to reduce the number of wavelengths is proposed to establish all-to-all broadcast in a bidirectional WDM ring network. The network model is an all-optical network, in which a message from source node can be dropped (or split) only at a limited number of destination nodes along a light path due to power loss of dropping optical signals. An expression for the upper bound on the number of wavelengths required to support all-to-all broadcast is derived for certain cases of WDM ring while for other cases, an attractive algorithm is given to identify the lengths of connection sets that can be grouped together with suitable wavelength assignment strategies. Numerical results are computed to show that the results obtained are close to the lower bound.