Paper
8 February 2005 Disjoint path and protection with multiple QoS constraints based on traffic grooming
Yu Hua, Chanle Wu, Yong Wang, Zhi Zhou, Jun Du
Author Affiliations +
Abstract
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.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yu Hua, Chanle Wu, Yong Wang, Zhi Zhou, and Jun Du "Disjoint path and protection with multiple QoS constraints based on traffic grooming", Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); https://doi.org/10.1117/12.574441
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Network architectures

Computer simulations

Performance modeling

Control systems

Optical networks

Internet

Switching

Back to Top