A Novel Survivable Traffic Grooming Algorithm in WDM Mesh Networks

摘要：

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.

关键词： WDM mesh networks Survivable Traffic Grooming Integer Linear Programming CLIR-MLTG algorithm

作者: Li Wang Lemin Li Hongfang Yu Xiaoning Zhang Hongbin Luo

作者单位: Key Lab of Broadband Optical Fiber Transmission and Communication Networks,University of Electronic Science and Technology of China,Chengdu 610054,China

会议类型: 国际会议

会议名称: 2008亚太光通信会议(Asia-Pacific Optical Communications 2008)

会议地点: 杭州

会议语种:英文

在线出版日期: 2008-10-26（万方平台首次上网日期，不代表论文的发表时间）