A new green multicast grooming protection algorithm in WDM optical networks

被引:3
作者
Yu, Cunqian [1 ]
Liu, Yejun [1 ]
Hou, Weigang [1 ]
Yu, Yao [1 ]
Wu, Jingjing [1 ]
Jiang, Peipei [1 ]
机构
[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Peoples R China
来源
OPTIK | 2014年 / 125卷 / 02期
基金
中国国家自然科学基金;
关键词
Optical network; Green multicast grooming; Protection; Spanning path; MESH NETWORKS; SHARED PROTECTION; CONSTRAINTS; TREES;
D O I
10.1016/j.ijleo.2013.07.073
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Since optical network carries a lot of traffic, survivability is very important to ensure the service continuity against network failures. Recently, multicast services become more popular to meet the huge multimedia demand in network, so that multicast survivability in optical network has got more attention. However, multicast survivability may lead to more energy consumption due to more redundant backup resources allocated. Since greening network is particularly important with the energy crisis keeping growing, green multicast survivability in optical network is a challenging issue. This paper focuses on the green multicast grooming protection problem in optical network and designs two auxiliary graphs that includes a virtual topology graph and an integrated graph to address the survivable multicast grooming, routing and wavelength assignment. Based on the auxiliary graphs, this paper proposes an efficient heuristic called green multicast grooming algorithm based on spanning path dedicated protection (GMG-SPDP), in which the network reliability and the energy efficiency are jointly taken into account. Simulation results show that, compared to other algorithms, the proposed GMG-SPDP not only has lower blocking probability and higher bandwidth utilization ratio, but also saves more energy. (C) 2013 Elsevier GmbH. All rights reserved.
引用
收藏
页码:657 / 662
页数:6
相关论文
共 16 条
[1]  
[Anonymous], 2011, TECHNICAL REPORT
[2]   Minimizing average path cost in colored trees for disjoint multipath routing [J].
Balasubramanian, Ravi ;
Ramasubramanian, Srinivasan .
ICCCN 2006: 15TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2006, :185-+
[3]  
Global Action Plan, 2007, TECHNICAL REPORT
[4]   Path-based routing provisioning with mixed shared protection in WDM mesh networks [J].
Guo, L ;
Cao, J ;
Yu, HF ;
Li, LM .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 2006, 24 (03) :1129-1141
[5]   A new shared-path protection algorithm under shared risk link group constraints for survivable WDM mesh networks [J].
Guo, L ;
Yu, HF ;
Li, LM .
OPTICS COMMUNICATIONS, 2005, 246 (4-6) :285-295
[6]   A novel survivable routing algorithm with partial shared-risk link groups (SRLG)-disjoint protection based on differentiated reliability constraints in WDM optical mesh networks [J].
Guo, Lei ;
Li, Lemin .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 2007, 25 (06) :1410-1415
[7]   LSSP: A novel local segment-shared protection for multi-domain optical mesh networks [J].
Guo, Lei .
COMPUTER COMMUNICATIONS, 2007, 30 (08) :1794-1801
[8]   On finding feasible solutions with shared backup resources for surviving double-link failures in path-protected WDM mesh networks [J].
Guo, Lei ;
Li, Lemin ;
Cao, Jin ;
Yu, Hongfang ;
Wei, Xuetao .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 2007, 25 (01) :287-296
[9]   Shared sub-path protection algorithm in traftic-grooming WDM mesh networks [J].
He, RX ;
Wen, HB ;
Li, LM ;
Wang, GX .
PHOTONIC NETWORK COMMUNICATIONS, 2004, 8 (03) :239-249
[10]  
ldzikowski F., 2010, P ONDM, DOI DOI 10.1109/0NDM.2010.5431569