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.     

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.     

Restoration approach in WDM optical networks

Critical applications require proactive-based survivability strategy which provides 100% degree of survivability, low blocking probability and very low restoration time. In this paper, we have proposed an efficient proactive restoration approach for WDM optical network that efficiently utilizes the resources and reduces blocking probability as compared to existing proactive restoration approach. It gives priority to primary lightpath as compared to backup lightpath because primary lightpath should not share resources with other lightpaths in critical applications but backup lightpaths can share the resources, i.e. backup multiplexing.     

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.     

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.     

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.     

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

In this paper, we have investigated 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 have proposed a mechanism, which is used to combat multiple link failures. A survivable routing and wavelength assignment algorithm has been proposed which is very efficient for the networks having multiple failures. 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.     

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.     

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.     

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.     

有业务量疏导能力的WDM网格网阻塞性能分析

提出一个新分析模型来计算有业务量疏导能力的波分复用(WDM)网格网的呼叫阻塞概率,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.     

IP over WDM网络中可恢复的路由选择策略与算法

研究了IP over WDM网络中各层备用资源的分配问题,提出了一种新的IP over WDM网络中可恢复的路由选择策略以及应用于其中的备用路由选择算法.该策略通过层间备用资源共享,能够完全利用网络中为恢复光层故障所预留的资源来进行IP层故障恢复,从而大大提高了网络的资源利用率.对所提出的策略进行了性能分析,并给出了相应的性能指标.     

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.     

Distributed control based routing and wavelength assignment strategy for WDM optical networks

Wavelength-division-multiplexing (WDM) is emerging as the dominant technology for the next generation optical networks. The control strategy can be either centralized or distributed. In centralized control, there is a central controller to keep track of the state of the network. It is also responsible for selecting the path for data transmission. Most of the work done in this field is based on centralized control. For large networks, distributed control is preferred over centralized control because of low control overhead. Distributed control strategy requires exchange of control messages among nodes. The distributed control generally results in the possibility of resource reservation conflicts among simultaneous path establishments and poor resource utilization. In this paper, we have proposed one distributed control based routing and wavelength assignment strategy that avoids the problem of resource reservation conflicts along with the efficient utilization of resources.     

WDM光网络安全生存机制研究

针对WDM光网络安全生存性问题的故障的发现、定位和恢复三个重要环节之中的恢复问题,提出了一种WDM光层中的安全保护与恢复方案。采用了恢复路由选择算法和恢复波长分配算法,提出了一种混合的多层恢复机制,从而构建了一种从故障的发现、定位到故障恢复的覆盖各环节的连续性光网络安全生存机制,并在理论上进行了性能比较。     

Ultra-fast tunable optical filters for WDM networks

One missing component in the next generation optical communications link is an ultra-fast tunable filter. This is a crucial element in dense wavelength division multiplexing systems. Here, a novel fiber loop configuration is proposed, which operates as such a filter. The filter implementation is based upon currently available technologies. It is shown that with the suggested technique, optical selective elements can be generated with a tuning speed of a few nanoseconds. This is three orders of magnitude faster than other currently available filters. The filter can be designed as compact and is immunized to external instabilities. Using compound configurations, the filter can be designed with a very wide range of filter finesse and free spectral range.     

A clustering-driven medium access control protocol for WDM star networks

Channel assignment and nodes’ service order are two key issues that have to be addressed when designing medium access control (MAC) protocols for WDM star networks. Traditional scheduling techniques consider either channel assignment or nodes’ service order issues. Furthermore, they make use of information such as data channels or receivers’ availability, without combining it with senders’ demands. This paper introduces a novel approach to message scheduling algorithms for WDM star networks, which is driven by clustering techniques. The proposed clustering driven-minimum scheduling latency (CD-MSL) scheme combines all the aforementioned information to create groups of similar source nodes on the basis of the destination nodes of their messages, aiming at rearranging nodes’ service order and improving network performance. Extensive simulation results are presented, which indicate that the proposed clustering-driven scheme leads to a significantly higher throughput-delay performance, in comparison to conventional scheduling algorithms.