Share Email Print
cover

Proceedings Paper

A novel survivable traffic grooming algorithm in WDM mesh networks
Author(s): Li Wang; Lemin Li; Hongfang Yu; Xiaoning Zhang; Hongbin Luo
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 19 November 2008
PDF: 9 pages
Proc. SPIE 7137, Network Architectures, Management, and Applications VI, 71373C (19 November 2008); doi: 10.1117/12.804141
Show Author Affiliations
Li Wang, Univ. of Electronic Science and Technology of China (China)
Lemin Li, Univ. of Electronic Science and Technology of China (China)
Hongfang Yu, Univ. of Electronic Science and Technology of China (China)
Xiaoning Zhang, Univ. of Electronic Science and Technology of China (China)
Hongbin Luo, Univ. of Electronic Science and Technology of China (China)


Published in SPIE Proceedings Vol. 7137:
Network Architectures, Management, and Applications VI
Weisheng Hu; Shoa-Kai Liu; Ken-ichi Sato; Lena Wosinska, Editor(s)

© SPIE. Terms of Use
Back to Top