Share Email Print

Proceedings Paper

Disjoint path and protection with multiple QoS constraints based on traffic grooming
Author(s): Yu Hua; Chanle Wu; Yong Wang; Zhi Zhou; Jun Du
Format Member Price Non-Member Price
PDF $17.00 $21.00

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

Paper Details

Date Published: 8 February 2005
PDF: 9 pages
Proc. SPIE 5626, Network Architectures, Management, and Applications II, (8 February 2005); doi: 10.1117/12.574441
Show Author Affiliations
Yu Hua, Lucent Technologies/Bell Labs (China)
Wuhan Univ. (China)
Chanle Wu, Wuhan Univ. (China)
Yong Wang, Lucent Technologies/Bell Labs. (China)
Zhi Zhou, Wuhan Univ. (China)
Jun Du, Univ. of Bremen (Germany)

Published in SPIE Proceedings Vol. 5626:
Network Architectures, Management, and Applications II
S. J. Ben Yoo; Gee-Kung Chang; Guangcheng Li; Kwok-wai Cheung, Editor(s)

© SPIE. Terms of Use
Back to Top