In order to provide better QoS service, optical networks with survivability require complete procedures to provide routing and protection for the traffic carried on the light paths. Thus, the challenging problem of disjoint path routing and protection in WDM networks is pivotal to realize the end-to-end QoS guarantee. In this paper, we propose the novel routing algorithm, CHRTG (Constrained Heuristic Routing with Traffic Grooming). CHRTG with multiple QoS constraints is different from previous routing algorithms, which are based on the traditional single constraint (bottleneck or additive). We describe QoS constraints with different weights and corresponding metrics can be produced for path computation. Better performance can be realized through analyzing the complexity degree of time and space. The traffic load from each node can be expressed in self-similar traffic and several on/off source models. Simulation results show that CHRTG can achieve maximum sharing protection paths. The results of simulation also show that the algorithm is scalable, efficient and survivable.
With the increase of the Internet service, it is more and more important to provide better performance and quality in the WDM network. The paper introduces a novel dynamic routing (DR) algorithm based on OSPF with the balance parameter. Due to the limitation to the wavelength continuity, the problem of the routing and wavelength assignment (RWA) is also analyzed comprehensively. In designing the algorithm, RWA is considered, too. The protocol of OSPF may collect the network state information by flooding in WDM network. Furthermore, the algorithm can adapt to the traffic changes with rather little changes in transport performance and blocking probability. In order to prove the method efficient and robust, the simulation with two topologies is done and results are also analyzed and compared. At last, the conclusion and further work are given, too.