Power series-based algorithm for dedicated protection in WDM optical networks

被引:1
|
作者
Xavier, Andre V. S. [1 ]
de Andrade Almeida, Raul Camelo, Jr. [1 ]
Chaves, Daniel A. R. [2 ]
Bastos-Filho, Carmelo J. A. [2 ]
Martins-Filho, Joaquim F. [1 ]
机构
[1] Univ Fed Pernambuco, Dept Elect & Syst, BR-50740550 Recife, PE, Brazil
[2] Univ Pernambuco, Polytech Sch Pernambuco, BR-50720001 Recife, PE, Brazil
关键词
WDM optical networks; Dedicated protection; Single failure; Resilience; Function expansion;
D O I
10.1007/s11107-015-0568-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
WDM optical networks allow the transmission of multiple services with high rates and low cost. Therefore, the occurrence of a failure in any network element can cause loss of several services. Some survival mechanisms may be used to try to overcome this type of failure event. We present in this paper a new dedicated protection algorithm for link-failure survivability in WDM optical networks, referred to as power series routing-based dedicated protection (PSR-DP) algorithm. PSR-DP is based on the evaluation of the network links' costs by using a power series expansion. This power series expansion uses input variables based on some relevant information of the network such as link physical length and wavelength availability. Other contribution of this paper is to propose a new input variable based on the wavelength continuity constraint. The performance of the proposed algorithm is compared to other well-known algorithms in the literature. We also propose a modification to Suurballe's algorithm and compare it with our PSR-DP algorithm. Three different topologies are used in our simulations, and statistical analysis is performed on the results of the investigated algorithms. In all simulated cases, PSR-DP algorithm outperformed the other analyzed algorithms.
引用
收藏
页码:40 / 53
页数:14
相关论文
共 50 条
  • [41] An Interval-Based Scheduling Algorithm for Optical WDM Star Networks
    Krishna M. Sivalingam
    Jie Wang
    Xiangjun Wu
    Manav Mishra
    Photonic Network Communications, 2002, 4 : 73 - 87
  • [42] An interval-based scheduling algorithm for optical WDM star networks
    Sivalingam, KA
    Wang, J
    Wu, XJ
    Mishra, M
    PHOTONIC NETWORK COMMUNICATIONS, 2002, 4 (01) : 73 - 87
  • [43] Traffic grooming algorithm based on Hamiltonian cycle protection in WDM mesh networks
    Xiang, B
    Wang, S
    Li, LM
    Yu, HF
    Wen, HB
    APOC 2003: ASIA-PACIFIC OPTICAL AND WIRELESS COMMUNICATIONS; NETWORK ARCHITECTURES, MANAGEMENT, AND APPLICATIONS, PTS 1 AND 2, 2003, 5282 : 703 - 710
  • [44] An adaptive protection algorithm with joint optimization in WDM networks
    He, Rong-Xi
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2006, 35 (05): : 740 - 743
  • [45] A fast scheduling algorithm for WDM optical networks
    Lai, CC
    Ali, BM
    Mukerjee, MR
    Prakash, V
    Selvakennedy, S
    IEEE 2000 TENCON PROCEEDINGS, VOLS I-III: INTELLIGENT SYSTEMS AND TECHNOLOGIES FOR THE NEW MILLENNIUM, 2000, : A487 - A492
  • [46] A Differentiated Shared Path Protection Algorithm in WDM Networks
    Zhou, Huihua
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 2745 - 2747
  • [47] p-cycles-based dynamic protection provisioning in optical WDM networks
    Zhong, WD
    Zhang, ZR
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2005, E88B (05) : 1921 - 1926
  • [48] Multilayer Protection with Availability Guarantees in Optical WDM Networks
    Massimo Tornatore
    Diego Lucerna
    Biswanath Mukherjee
    Achille Pattavina
    Journal of Network and Systems Management, 2012, 20 : 34 - 55
  • [49] Multilayer Protection with Availability Guarantees in Optical WDM Networks
    Tornatore, Massimo
    Lucerna, Diego
    Mukherjee, Biswanath
    Pattavina, Achille
    JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2012, 20 (01) : 34 - 55
  • [50] Multicast protection scheme in survivable WDM optical networks
    Liao, Luhua
    Li, Lemin
    Wang, Sheng
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2008, 31 (03) : 303 - 316