A Hierarchical Distributed Protocol for MPLS Path Creation
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Survey of Recovery Schemes in MPLS Networks
DEPCOS-RELCOMEX '06 Proceedings of the International Conference on Dependability of Computer Systems
A methodology of resilient MPLS/VPN path management under multiple link failures
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Engineering end-to-end IP resilience using resilience-differentiated QoS
IEEE Communications Magazine
Distributed schemes for diverse path computation in multidomain MPLS networks
IEEE Communications Magazine
Interdomain path computation: Challenges and Solutions for Label Switched Networks
IEEE Communications Magazine
Load-Balancing Data Traffic Among Inter-Domain Links
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Providing network QoS involves, among other things, ensuring network survivability in spite of network faults. Fault recovery mechanisms should reduce recovery time, especially for real-time and mission-critical applications while guaranteeing QoS requirements, in terms of bandwidth and delay constraints and maximizing network resources utilization. In this paper, we propose a scalable recovery mechanism based on hierarchical networks. The proposed mechanism is based on inter-domain segmental restoration and is performed by a recovery module (RM) introduced for each domain of the hierarchy. The RM cooperates with Path Computation Element (PCE) to perform recovery while maintaining QoS. Segmental restoration ensures faster recovery time by trying to recover failed paths as close as possible to where the fault occurred. The recovery mechanism aggregates fault notification messages to reduce the size of the signaling storm. In addition, the recovery mechanism ranks failed paths to reduce recovery time for high-priority traffic. We present simulation results conducted for different network sizes and hierarchy structures. Two metrics were considered: recovery time and signaling storm size. A significant decrease in the recovery time with increasing number of hierarchical levels for the same network size is observed. The larger the number of hierarchy levels, the smaller the number of network nodes in each domain and, generally, the faster the routing computations and routing tables search times. In addition, the recovery mechanism results in reducing recovery time for high priority traffic by nearly 90% over that of lower priority traffic. However, increasing the number of hierarchical levels results in a linear increase in signaling storm size.