draft-ietf-pce-pcep-svec-list-04.txt   draft-ietf-pce-pcep-svec-list-05.txt 
Network Working Group I. Nishioka Network Working Group Itaru Nishioka
Internet Draft NEC Internet Draft NEC Corp.
Intended status: Informational Daniel King Intended Status: Informational Daniel King
Created: February 10, 2010 Old Dog Consulting Expires: December 6, 2010 Old Dog Consulting
Expires: August 10, 2010 June 6, 2010
The use of SVEC (Synchronization VECtor) list for Synchronized The use of SVEC (Synchronization VECtor) list for Synchronized
dependent path computations dependent path computations
draft-ietf-pce-pcep-svec-list-04.txt draft-ietf-pce-pcep-svec-list-05.txt
Abstract Abstract
A Path Computation Element (PCE) may be required to perform A Path Computation Element (PCE) may be required to perform
dependent path computations. Dependent path computations are dependent path computations. Dependent path computations are
requests that need to be synchronized in order to meet specific requests that need to be synchronized in order to meet specific
objectives. An example of a dependent request would be a PCE objectives. An example of a dependent request would be a PCE
computing a set of services which are required to be diverse computing a set of services which are required to be diverse
(disjointed) from each other. When a PCE computes sets of dependent (disjointed) from each other. When a PCE computes sets of dependent
path computation requests concurrently, it is required to use the path computation requests concurrently, it is required to use the
skipping to change at page 1, line 54 skipping to change at page 1, line 54
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt. http://www.ietf.org/ietf/1id-abstracts.txt.
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html. http://www.ietf.org/shadow.html.
This Internet-Draft will expire on August 10, 2010. This Internet-Draft will expire on December 6, 2010.
Copyright Notice Copyright Notice
Copyright (c) 2010 IETF Trust and the persons identified as the Copyright (c) 2010 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
skipping to change at page 3, line 8 skipping to change at page 3, line 8
Without obtaining an adequate license from the person(s) Without obtaining an adequate license from the person(s)
controlling the copyright in such materials, this document may not controlling the copyright in such materials, this document may not
be modified outside the IETF Standards Process, and derivative works be modified outside the IETF Standards Process, and derivative works
of it may not be created outside the IETF Standards Process, except of it may not be created outside the IETF Standards Process, except
to format it for publication as an RFC or to translate it into to format it for publication as an RFC or to translate it into
languages other than English. languages other than English.
Table of Contents Table of Contents
1. Introduction ..................................................3 1. Introduction ..................................................3
1.1. SVEC Object ...................................................4 1.1. SVEC Object ...............................................4
1.2. Application of SVEC Lists .....................................4 1.2. Application of SVEC Lists .................................4
2. Terminology ...................................................6 2. Terminology ...................................................6
3. SVEC association scenarios ....................................6 3. SVEC association scenarios ....................................6
3.1. Synchronized computation for diverse path requests ............6 3.1. Synchronized computation for diverse path requests ........6
3.2. Synchronized computation for point-to-multipoint path 3.2. Synchronized computation for point-to-multipoint path
requests ......................................................8 requests ..................................................8
4. SVEC association ..............................................8 4. SVEC association ..............................................8
4.1. SVEC list .....................................................8 4.1. SVEC list .................................................8
4.2. Associated SVECs ..............................................8 4.2. Associated SVECs ..........................................8
4.3. Non-associated SVECs ..........................................9 4.3. Non-associated SVECs ......................................9
5. Processing of SVEC list ......................................10 5. Processing of SVEC list .......................................10
5.1. Single PCE, single domain environments .......................10 5.1. Single PCE, single domain environments ....................10
5.2. Multi-PCE, single domain environments ........................11 5.2. Multi-PCE, single domain environments .....................11
5.3. Multi-PCE, multi-domain environments .........................11 5.3. Multi-PCE, multi-domain environments ......................11
6. End-to-end diverse path computation ..........................12 6. End-to-end diverse path computation ...........................12
6.1. Disjoint VSPT ................................................12 6.1. Disjoint VSPT .............................................12
6.2. Disjoint VSPT encoding .......................................14 6.2. Disjoint VSPT encoding ....................................13
6.3. Path computation procedure ...................................14 6.3. Path computation procedure ................................14
7. Manageability considerations .................................15 7. Manageability considerations ..................................14
7.1. Control of Function and Policy ...............................15 7.1. Control of Function and Policy ............................14
7.2. Information and Data Models, e.g. MIB modules ................15 7.2. Information and Data Models, e.g. MIB modules .............15
7.3. Liveness Detection and Monitoring ............................15 7.3. Liveness Detection and Monitoring .........................15
7.4. Verifying Correct Operation ..................................15 7.4. Verifying Correct Operation ...............................15
7.5. Requirements on Other Protocols and Functional Components.....16 7.5. Requirements on Other Protocols and Functional Components..15
7.6. Impact on Network Operation ..................................16 7.6. Impact on Network Operation ...............................15
8. Security Considerations ......................................16 8. Security Considerations .......................................15
9. IANA Considerations ..........................................17 9. IANA Considerations ...........................................16
10. References ..................................................17 10. References ...................................................16
10.1. Normative References ........................................17 10.1. Normative References .....................................16
10.2. Informative References ......................................18 10.2. Informative References ...................................17
11. Acknowledgements ............................................18 11. Acknowledgements .............................................17
12. Authors' Addresses ...........................................17
1. Introduction 1. Introduction
[RFC5440] describes the specifications for PCEP (Path Computation [RFC5440] describes the specifications for PCEP (Path Computation
Element communication Protocol). PCEP specifies the communication Element communication Protocol). PCEP specifies the communication
between a Path Computation Client (PCC) and a Path Computation between a Path Computation Client (PCC) and a Path Computation
Element (PCE), or between two PCEs based on the PCE architecture Element (PCE), or between two PCEs based on the PCE architecture
[RFC4655]. PCEP interactions include path computation requests and [RFC4655]. PCEP interactions include path computation requests and
path computation replies. path computation replies.
skipping to change at page 9, line 12 skipping to change at page 9, line 12
is introduced to associate these SVECs, especially for correlating is introduced to associate these SVECs, especially for correlating
among SVECs with dependency flags. among SVECs with dependency flags.
Request identifiers in the SVEC objects are used to indicate the Request identifiers in the SVEC objects are used to indicate the
association among SVEC objects. If the same request-IDs exist in association among SVEC objects. If the same request-IDs exist in
SVEC objects, this indicates these SVEC objects are associated. When SVEC objects, this indicates these SVEC objects are associated. When
associating among SVEC objects, at least one request identifier must associating among SVEC objects, at least one request identifier must
be shared between associated SVECs. The SVEC objects can be be shared between associated SVECs. The SVEC objects can be
associated regardless of the dependency flags in each SVEC object, associated regardless of the dependency flags in each SVEC object,
but it is recommended to use a single SVEC if the dependency flags but it is recommended to use a single SVEC if the dependency flags
are not set in all SVEC objects. are not set in all SVEC objects. Similarly, when associating among
SVEC objects with dependency flags, it is recommended to construct
them using a minimum set of associated SVECs, thus avoiding complex
relational associations.
Below is an example of associated SVECs. In this example, the first Below is an example of associated SVECs. In this example, the first
SVEC is associated with the other SVECs, and all of path computation SVEC is associated with the other SVECs, and all of path computation
requests contained in the associated SVECs (i.e. Request-ID#1,#2,#3, requests contained in the associated SVECs (i.e. Request-ID#1,#2,#3,
#4, #X, #Y) must be synchronized. #4,#X,#Y,#Z) must be synchronized.
<SVEC-list> <SVEC-list>
<SVEC> without dependency flags <SVEC> without dependency flags
Request-ID #1, Request-ID #3, Request-ID #X Request-ID #1, Request-ID #3, Request-ID #X
<SVEC> with one or more dependency flags <SVEC> with one or more dependency flags
Request-ID #1, Request-ID #2 Request-ID #1, Request-ID #2
skipping to change at page 17, line 32 skipping to change at page 17, line 32
[ID.h-pce] King, D., Farrel, A. "The Application of the Path [ID.h-pce] King, D., Farrel, A. "The Application of the Path
Computation Element Architecture to the Determination of a Computation Element Architecture to the Determination of a
Sequence of Domains in MPLS & GMPLS", draft-king-pce- Sequence of Domains in MPLS & GMPLS", draft-king-pce-
hierarchy-fwk, work in progress, December 2009. hierarchy-fwk, work in progress, December 2009.
11. Acknowledgements 11. Acknowledgements
The authors would like to thank Adrian Farrel, Julien Meuric and The authors would like to thank Adrian Farrel, Julien Meuric and
Filippo Cugini for their valuable comments. Filippo Cugini for their valuable comments.
Authors' Addresses 12. Authors' Addresses
Itaru Nishioka Itaru Nishioka
NEC Corp. NEC Corp.
1753 Shimonumabe, 1753 Shimonumabe,
Kawasaki, 211-8666, Kawasaki, 211-8666,
Japan Japan
Phone: +81 44 396 3287 Phone: +81 44 396 3287
Email: i-nishioka@cb.jp.nec.com Email: i-nishioka@cb.jp.nec.com
 End of changes. 9 change blocks. 
39 lines changed or deleted 43 lines changed or added

This html diff was produced by rfcdiff 1.38. The latest version is available from http://tools.ietf.org/tools/rfcdiff/