Preplanned weighted restoration in highly dynamic GMPLS networks

The paper proposed the application of the PWR scheme to generalised multiprotocol label switching (GMPLS) networks. Simulation results indicates that the PWR scheme outperforms the AR scheme in terms of expected network blocking probability, while achieving comparably fast restoration completion times. Due to its contained signaling and robustness during traffic changes, the PWR scheme may be a good candidate for GMPLS networks subject to frequent traffic changes. The network utilization factor, /spl eta/, is defined as the ratio between the sum of the number of working wavelengths on all links and the total network capacity.

[1]  Luca Valcarenghi,et al.  The preplanned weighted restoration scheme , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[2]  Ken Owens.  Extensions to CRLDP for MPLS Path Protection , 2001 .

[3]  Ayan Banerjee,et al.  Generalized multiprotocol label switching: an overview of routing and management enhancements , 2001, IEEE Commun. Mag..

[4]  Gaeil An,et al.  Design and implementation of MPLS network simulator supporting LDP and CR-LDP , 2000, Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium.

[5]  Dongmei Wang,et al.  Experiments in fast restoration using GMPLS in optical/electronic mesh networks , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[6]  Kireeti Kompella,et al.  OSPF Extensions in Support of Generalized MPLS , 2001 .

[7]  Wayne D. Grover,et al.  A highly efficient path-restoration protocol for management of optical network transport integrity , 2000, IEEE Journal on Selected Areas in Communications.