Dynamic Multicast Traffic Grooming for survivable WDM mesh networks

Author

Lu, Cai ; Li, Lemin

Author_Institution

Key Lab. of Broadband Opt. Fiber Transm. & Commun. Network, Univ. of Electron. Sci. & Technol. of China, Chengdu

fYear

2008

fDate

25-27 May 2008

Firstpage

567

Lastpage

571

Abstract

Survivable multicast traffic grooming (SMTG) is a promising approach to provide reliable and resource-efficient multi-granularity multicast services in mesh wavelength-division multiplexing (WDM) optical networks. In this paper, we focus on the problem of SMTG in WDM mesh networks and propose two models, named traffic grooming with shared protection (TG-SP) and traffic grooming with mixed band protection (TG-MBP) respectively. Basing on the two models, we present two algorithms, named multicast traffic grooming with segment protection (MTG-SP) and multicast traffic grooming with shared segment protection (MTG-SSP) respectively. From the simulation results, we can see that MTG-SSP algorithm has better performance than MTG-SP algorithm at the cost of higher computation complexity.

Keywords

multicast communication; optical fibre networks; telecommunication network reliability; telecommunication traffic; wavelength division multiplexing; WDM mesh networks; computation complexity; dynamic multicast traffic grooming; mesh wavelength-division multiplexing; multicast traffic grooming with segment protection; multicast traffic grooming with shared segment protection; resource-efficient multigranularity multicast services; survivable multicast traffic grooming; traffic grooming with mixed band protection; traffic grooming with shared protection; Computational efficiency; Computational modeling; Mesh networks; Multicast algorithms; Optical fiber networks; Protection; Telecommunication traffic; Traffic control; WDM networks; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on

Conference_Location

Fujian

Print_ISBN

978-1-4244-2063-6

Electronic_ISBN

978-1-4244-2064-3

Type

conf

DOI

10.1109/ICCCAS.2008.4657837

Filename

4657837