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.     

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.     

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.     

Wavelength assignment algorithms in OBS networks

The wavelength assignment algorithm is a method to improve the performance in respect of blocking probability and to provide cost effective communication system. In this paper, we have developed a simple mathematical model which is used for the calculation of blocking probability of an OBS network. The implementation of the proposed model has less complexity and the computation used is quite efficient. This model can be implemented on different network topologies. The validity of model is supported by simulation results.     

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.     

Blocking probability analysis of survivable routing in WDM optical networks with/without sparse-wavelength conversion

In this paper, a new algorithm for wavelength assignment has been proposed and its performance is evaluated in terms of blocking probability and fairness. It has been shown that the proposed algorithm offers the least blocking probability. The blocking performance of wavelength division multiplexing (WDM) network has been analyzed for the network having 10 nodes and for varying loads. As the load per link (in Erlangs) increases, the blocking probability increases. The result shows that the performance of first-fit algorithm is better than random algorithm whereas the proposed algorithm offers the least blocking.     

Blocking in wavelength-routed all-optical WDM networks

In this paper, we have developed a low complexity mathematical model which is used for the calculation of 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. This paper suggests an optimum path as a solution to routing problem and the appropriate number of wavelengths have also been suggested which should be free in a network to have the least blocking probability. This model can be implemented on different network topologies. Further, the model is also used to evaluate the blocking performance of NSFNet topology and hence used to improve its performance on the basis of 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.     

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.     

An efficient algorithm for optimal allocation of wavelength converters in wavelength routing optical network

In a wavelength routing optical network(WRON),the optimal allocation of wavelength converters(WCs)is very important to minimize the number of WCs,enhance the fiber utilization,reduce the blocking probability,etc..In this paper,a novel simplified network model with shared WCs has been proposed.An effective algorithm for optimal allocation of shared WCs has been presented by using a revised Dijkstra algorithm and genetic algorithm(GA).The effectiveness of the revised algorithm was verified through the simulation on Nature and Science Foundation(NSF)net of USA.This revised algorithm can achieve blocking probability 36% less than the algorithm in previous work,and the calculating time of the minimum blocking probability can be reduced dramatically.     

Routing and wavelength assignment algorithms for multiclass WDM optical networks

In this paper dynamic routing and wavelength assignment strategies have been proposed for multiclass WDM optical networks. Multiclass optical networks provide multiple classes of services to the subscriber according to the requirement, which in turn increase operational profitability. Each class of service could be characterized by parameters like number of wavelengths, expected call holding time and average arrival rate of request. The proposed strategies have been analyzed and compared with existing strategies on the basis of blocking probabilities for multiclass traffic scenarios. Simulation results on different network topologies demonstrate that the performance of proposed strategies “Fixed shortest/alternate shortest path routing with wavelength reservation (FSASWR)” and “Fixed alternate shortest path routing with least priority wavelength assignment (FASPL)” are much better as compared to existing strategies. Proposed strategies minimize blocking probability of the multiclass network using limited number of wavelengths.     

Blocking probability calculation in wavelength-routed all-optical networks

In this paper we have proposed a mathematical model to reduce the blocking probability of the WDM optical network. The mathematical model proposed has a closed-form expression and does not require simulated statistics, it has low implementation complexity and the computation is quite efficient. This model suggests us to choose the best path and appropriate number of free wavelengths in the network. We can go for the compromise between the path length and number of free wavelength. The model is also used to evaluate the blocking performance of NSFNet topology and hence used to improve its performance.     

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.     

Blocking in wavelength-routed all-optical WDM network with wavelength conversion

The blocking probability in wavelength-routed all optical networks is very important measure of performance of the network, which can be affected by many factors such as network topology, traffic load, number of links, algorithms employed and whether wavelength conversion is available or not. In this paper, we have proposed a mathematical model to reduce the blocking probability of the WDM optical network for wavelength-convertible networks. The model can be used to evaluate the blocking performance of any network topology also it can be useful to improve its blocking performance of the given network topology. The blocking probability variation of the network for a particular load (per link) has been studied based on the load variation and total number of wavelengths used in the network. This model gives good results for high load (per link).     

Blocking in wavelength-routed all-optical WDM network with or without wavelength conversion

The blocking probability in wavelength-routed all-optical networks is a very important measure of performance of the network. This blocking probability can be affected by many factors such as network topology, traffic load, number of links, algorithms employed and whether wavelength conversion is available or not. In this paper we have proposed a mathematical model to reduce the blocking probability of the WDM optical network for both wavelength convertible networks as well as for wavelength non-convertible networks. The model is can be used to evaluate the blocking performance of any network topology also it can be useful to improve its performance of the given network topology.     

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.     

Survivability strategies with backup multiplexing in WDM optical networks

In this paper, we have presented four variations of applying the same routing algorithm for primary and backup lightpaths, wavelength assignment strategy for survivability. The simulation results show that although everything is the same, yet how and when they are applied leads to variations in results in terms of number of connections accepted. The backup multiplexing technique has been incorporated to reduce the blocking probability in all the strategies. The results have been calculated both for the systems that require 100% degree of survivability, i.e. critical, and for those that do not. The variation to be used depends upon whether the application is critical or not.     

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

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

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

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

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

In this paper, we investigate 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 propose a mechanism, which is used to combat multiple link failures. A routing and wavelength assignment algorithm has been proposed with the name of fault-tolerant routing and wavelength assignment algorithm. The comparison of this algorithm has also been made with the best-fit and first-fit algorithms. 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.