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.     

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.     

Performance analysis of traffic groomed optical network

In this paper we carry out the performance analysis of traffic groomed multilayer optical networks. It is seen that the number of wavelength channels required decreases as the wavelength grooming factor increases. We have evaluated blocking probability for different load and grooming factor. The performance of the network has been evaluated for different conditions; first for fixed number of links with grooming factor set to 3 and subsequently with increase in grooming factor up to 18 in steps. The load on each link is selected as 2, 5, 9, 12, 15 and 20 Erlangs and the blocking probability as function of number of optical channels has been evaluated. In this work the effect of number of wavelength channels, traffic load and grooming factor on network blocking probability has been studied. The investigation reveals that the blocking probability decreases with increase in wavelength channels. Similarly we found that the blocking probability increases with increase in traffic load which is quite evident. Further it is shown that when the grooming factor is increased to significant value (16), the number of wavelengths requirement (8) becomes relatively stable.     

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.     

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 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).     

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.     

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.     

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.     

三阶多粒度光交叉连接的优化设计研究

在采用密集波分复用技术的骨干网中,通过建立动态多粒度业务模型对由大粒度（光纤和波带）和小粒度（波长）组成的三阶多粒度光交叉连接所构成的节点的网络特性（阻塞概率和带宽阻塞比）进行了研究和仿真分析,并由此对三阶多粒度节点的结构参数和网络中的系统参数进行了优化设计.从仿真结果可以看出,所提出来的优化设计方案能够显著的减少节点结构的复杂度并改善阻塞性能,从而减小了网络中设备的规模和成本.     

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.     

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.     

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.     

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.     

Performance enhancement of optical burst switched networks

Optical burst switching (OBS) is an optical switching paradigm which offers a good tradeoff between the traditional optical circuit switching (OCS) and optical packet switching (OPS) since it has the relatively easy implementation of the first and the efficient bandwidth utilization of the second. Hence, OBS is a promising technology for the next generation optical Internet. A buffer-less OBS network can be implemented using ordinary optical communication equipment without the need for either wavelength converters or optical memories. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header) and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. In this paper, an efficient integrated scheme based on dynamic routing and burst segmentation has been proposed to improve reliability of data transport and network load balancing in optical burst switched networks. Simulation results demonstrate that the proposed approach reduces effectively blocking probability and hence contention. Further, it provides end-to-end throughput performance also. Hence, it establishes an appropriate tradeoff between loss rate and end-to-end throughput.     

Blocking probability analysis model for flexible spectrum optical networks

Compared to the traditional wavelength division multiplexing （WDM） optical networks with rigid and coarse granularities, flexible spectrum optical networks have high spectrum efficiency, which can support the service with various bandwidth requirements, such as sub and super channel. Among all network performance parameters, blocking probability is an important parameter for the performance evaluation and network planning in circuit~based optical networks including flexible spectrum optical networks. We propose an analytical method of blocking probability computation for flexible spectrum optical networks in this letter through mathematical analysis and theoretical derivation. Two blocking probability models are built respectively based on whether considering spectrum consecutiveness or not. Numerical results validate our proposed blocking probability models under different link capacity and traffic loads.     

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.     

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.