A traffic grooming algorithm based on shared protection in WDM mesh networks

Author

Xiang, Bing ; Wang, Sheng ; Li, Lemin

Author_Institution

Nat. Key Lab of Broadband Opt. Fiber Transmission & Commun. Networks, Univ. of Electron. Sci. & Technol. of China, Chengdu, China

fYear

2003

fDate

27-29 Aug. 2003

Firstpage

254

Lastpage

258

Abstract

In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity lightpaths to make efficient use of the bandwidth. But most of the researches related to traffic grooming focused on ring networks, and fewer concerns are about the dependable traffic grooming of low-rate connections in WDM mesh networks. We present a shared protection traffic grooming algorithm based on wavelength layered-graph (SPTG-LG) considering both the survivability and traffic grooming in WDM mesh networks. Some simulations and analysis are also given out.

Keywords

graph theory; optical fibre networks; optical links; telecommunication network routing; telecommunication traffic; wavelength division multiplexing; WDM mesh network; bandwidth request; high-capacity lightpaths; ring network; shared protection; shared protection traffic grooming algorithm; simulations; survivability; wavelength layered-graph; Bandwidth; Heuristic algorithms; Intelligent networks; Mesh networks; Optical fiber communication; Protection; Telecommunication traffic; Traffic control; WDM networks; Wavelength division multiplexing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Print_ISBN

0-7803-7840-7

Type

conf

DOI

10.1109/PDCAT.2003.1236300

Filename

1236300