Cost efficient traffic grooming and regenerator placement in impairment-aware optical WDM networks

详细信息    查看全文

• 作者：Ankitkumar N. Patel^a ; ^{apatel@utdallas.edu} ; Chengyi Gao^a ; ^{cygao@utdallas.edu} ; Jason P. Jue^a ; ^{jjue@utdallas.edu} ; Xi Wang^b ; ^{xi.wang@us.fujitsu.com} ; Qiong Zhang^b ; ^{qiong.zhang@us.fujitsu.com} ; Paparao Palacharla^b ; ^{paparao.palacharla@us.fujitsu.com} ; Takao Naito^b ; ^{takao.naito@us.fujitsu.com}
• 关键词：Traffic grooming ; Regenerator ; Impairment-aware network ; Optical WDM network ; ROADM
• 刊名：Optical Switching and Networking
• 出版年：2012
• 出版时间：July, 2012
• 年：2012
• 卷：9
• 期：3
• 页码：225-239
• 全文大小：448 K

文摘

In this paper, we address the problem of traffic grooming and regenerator placement in a WDM optical network in which lightpaths are hop-constrained by physical impairments. The efficient placement of regenerators and electronic grooming equipment at ROADM nodes for a given network topology is required such that all traffic demands can be supported with minimum cost. We present a detailed ROADM node architecture together with an associated cost model. We model the problem by Integer Linear Programming (ILPs) and propose an auxiliary-graph-based heuristic for jointly placing regenerators and electronic grooming equipment in the network. To evaluate the performance of the proposed heuristic, we also derive a lower bound on the network cost. The numerical results show that combining the grooming problem with the placement of regenerators reduces the network cost significantly compared to the cases in which traffic grooming and regenerator placement are handled separately. The performance of the proposed polynomial-time heuristic is very close to the lower bound and approaches the bound as the network load increases.