scispace - formally typeset
Proceedings ArticleDOI

A scheduling mechanism for service aware restoration of MPLS networks

T. Shan, +1 more
- pp 2145-2150
Reads0
Chats0
TLDR
This paper presents a restoration technique for recovering the label-switched paths (LSPs) in MPLS networks, where a variety of services with heterogeneous QoS requirements are supported.
Abstract
This paper presents a restoration technique for recovering the label-switched paths (LSPs) in MPLS networks, where a variety of services with heterogeneous QoS requirements are supported. A scheduling mechanism is designed for sending the failure notification messages of various priority LSPs. It ensures better routes and preferential resource access for the higher priority LSPs, and achieves acceptable recovery time for lower priority LSPs at the same time. Simulation results show that the proposed scheduling mechanism achieves significant performance improvement in terms of the LSP restoration time. Our approach is feasible for the restoration of the MPLS networks and any other connection-oriented packet networks

read more

References
More filters

RSVP-TE: Extensions to RSVP for LSP Tunnels

TL;DR: In this paper, the use of RSVP (Resource Reservation Protocol) to establish label-switched paths (LSPs) in MPLS (Multi-Protocol Label Switching) is described.

Constraint-Based LSP Setup using LDP

TL;DR: This document specifies mechanisms and TLVs (Type/Length/Value) for support of CR-LSPs (constraint-based routed Label Switched Path) using LDP (Label Distribution Protocol).
Journal ArticleDOI

Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques

TL;DR: This work presents enhancements to two commonly used IP signaling protocols, RSVP and LDP, to support GMPLS and discusses mechanisms for bidirectional LSP setup, and describes the applications of suggested labels.
Journal ArticleDOI

Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

TL;DR: A method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfermode (ATM) virtual path (VP)-based restoration and jointly optimizing working path routing and spare capacity placement.
Journal ArticleDOI

Restoration strategies and spare capacity requirements in self-healing ATM networks

TL;DR: A new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration, and results illustrate that the heuristicgorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment.
Related Papers (5)