PCE Working Group H. Chen
Internet-Draft D. Dhody
Intended status: Informational Huawei Technologies
Expires: November 1, 2013 April 30, 2013
The Applicability of the PCE to Computing Protection and Recovery Paths
for Single Domain and Multi-Domain Networks.
draft-chen-pce-protection-applicability-03
Abstract
The Path Computation Element (PCE) provides path computation
functions in support of traffic engineering in Multiprotocol Label
Switching (MPLS) and Generalized MPLS (GMPLS) networks.
A link or node failure can significantly impact network services in
large-scale networks. Therefore it is important to ensure the
survivability of large scale networks which consist of various
connections provided over multiple interconnected networks with
varying technologies.
This document examines the applicability of the PCE architecture,
protocols, and procedures for computing protection paths and
restoration services, for single and multi-domain networks.
This document also explains the mechanism of Fast Re-Route (FRR)
where a point of local repair (PLR) needs to find the appropriate
merge point (MP) to do bypass path computation using PCE.
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on November 1, 2013.
Copyright Notice
Chen & Dhody Expires November 1, 2013 [Page 1]
Internet-Draft Applicability of PCE to Protection April 2013
Copyright (c) 2013 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Chen & Dhody Expires November 1, 2013 [Page 2]
Internet-Draft Applicability of PCE to Protection April 2013
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1. Domains . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1.1. Inter-domain LSPs . . . . . . . . . . . . . . . . . . 5
1.2. Recovery . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.3. Requirements Language . . . . . . . . . . . . . . . . . . 5
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 5
3. Path Computation Element Architecture Considerations . . . . . 7
3.1. Online Path Computation . . . . . . . . . . . . . . . . . 7
3.2. Offline Path Computation . . . . . . . . . . . . . . . . . 7
4. Protection Service Traffic Engineering . . . . . . . . . . . . 8
4.1. Path Computation . . . . . . . . . . . . . . . . . . . . . 8
4.2. Bandwidth Reservation . . . . . . . . . . . . . . . . . . 8
4.3. Disjoint Path . . . . . . . . . . . . . . . . . . . . . . 8
4.4. Service Preemption . . . . . . . . . . . . . . . . . . . . 8
4.5. Share Risk Link Groups . . . . . . . . . . . . . . . . . . 8
4.6. Multi-Homing . . . . . . . . . . . . . . . . . . . . . . . 8
4.6.1. Ingress and Egress Protection . . . . . . . . . . . . 9
5. Packet Protection Applications . . . . . . . . . . . . . . . . 9
5.1. Single Domain Service Protection . . . . . . . . . . . . . 10
5.2. Multi-domain Service Protection . . . . . . . . . . . . . 10
5.3. Backup Path Computation . . . . . . . . . . . . . . . . . 10
5.4. Fast Reroute (FRR) Path Computation . . . . . . . . . . . 10
5.4.1. Methods to find MP and calculate the optimal