Title :
Fast service recovery under shared protection at connection level in WDM grooming networks
Author_Institution :
Gdansk Univ. of Technol., Gdansk
Abstract :
In this paper, a novel algorithm optimizing the utilization of backup path resources for survivable WDM mesh grooming networks, based on graph vertex-coloring approach, is proposed. This is the first optimization technique, dedicated to protection-at-connection level (PAC) in WDM grooming networks, such that does not increase the backup path length and thus provides fast service recovery. The concept was evaluated for the U.S. Long-Distance Network and European COST 239 Network. The results show that, with only a little degradation of link capacity utilization efficiency (up to 8%), up to 20% shorter average values of service recovery time can be achieved.
Keywords :
graph colouring; optimisation; resource allocation; wavelength division multiplexing; WDM mesh grooming network; backup path resource utilization; fast service recovery; graph vertex-coloring approach; optimization; shared protection; Costs; Degradation; Lead; Optical fiber networks; Optical losses; Optical wavelength conversion; Protection; Time division multiplexing; WDM networks; Wavelength division multiplexing;
Conference_Titel :
Computer and information sciences, 2007. iscis 2007. 22nd international symposium on
Conference_Location :
Ankara
Print_ISBN :
978-1-4244-1363-8
Electronic_ISBN :
978-1-4244-1364-5
DOI :
10.1109/ISCIS.2007.4456881