@inproceedings{1f0b7f9f74de48bda63b0963348593b7,
title = "A Novel survivable traffic grooming algorithm in WDM mesh networks",
abstract = "In this paper, we focus on the survivable traffic grooming problem under SRLG (Shared Risk Link Groups) constraints in WDM mesh networks. Our objective is to minimize the total network resource for a given traffic demands metric. An efficient simplified ILP (Integer Linear Programming) mathematical formulation is presented. Considering the computational complexity of ILP, a fast heuristic algorithm named Cross Layer Information Routing \& Multi-Layer Traffic Grooming (CLIR-MLTG) is proposed and evaluated. We compare our simplified ILP model with the regular ILP model, and the CLIR-MLTG algorithm is also compared both with our simplified model and a heuristic algorithm named SSR in the literature [1]. Finally, we demonstrate in numerical results that our simplified ILP model obtains optimal performance and costs much less time compared to the regular ILP model, and the CLIR-MLTG algorithm outperforms the SSR scheme and it obtains similar performance compared to the ILP model.",
keywords = "CLIR-MLTG algorithm, Integer linear programming, Survivable traffic grooming, WDM mesh networks",
author = "Li Wang and Lemin Li and Hongfang Yu and Xiaoning Zhang and Hongbin Luo",
year = "2008",
doi = "10.1117/12.804141",
language = "英语",
isbn = "9780819473776",
series = "Proceedings of SPIE - The International Society for Optical Engineering",
booktitle = "Network Architectures, Management, and Applications VI",
note = "Network Architectures, Management, and Applications VI ; Conference date: 27-10-2008 Through 30-10-2008",
}