draft-ietf-ccamp-general-constraint-encode-06.txt   draft-ietf-ccamp-general-constraint-encode-07.txt 
Network Working Group G. Bernstein Network Working Group G. Bernstein
Internet Draft Grotto Networking Internet Draft Grotto Networking
Intended status: Standards Track Y. Lee Intended status: Standards Track Y. Lee
Expires: June 2012 D. Li Expires: September 2012 D. Li
Huawei Huawei
W. Imajuku W. Imajuku
NTT NTT
December 13, 2011 March 6, 2012
General Network Element Constraint Encoding for GMPLS Controlled General Network Element Constraint Encoding for GMPLS Controlled
Networks Networks
draft-ietf-ccamp-general-constraint-encode-06.txt draft-ietf-ccamp-general-constraint-encode-07.txt
Status of this Memo Status of this Memo
This Internet-Draft is submitted to IETF in full conformance with the This Internet-Draft is submitted to IETF in full conformance with the
provisions of BCP 78 and BCP 79. provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as Internet- other groups may also distribute working documents as Internet-
Drafts. Drafts.
skipping to change at page 1, line 38 skipping to change at page 1, line 38
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 June 13, 2012. This Internet-Draft will expire on September 6, 2012.
Copyright Notice Copyright Notice
Copyright (c) 2011 IETF Trust and the persons identified as the Copyright (c) 2012 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
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
skipping to change at page 3, line 6 skipping to change at page 3, line 6
1.3. Change Log................................................5 1.3. Change Log................................................5
2. Encoding.......................................................5 2. Encoding.......................................................5
2.1. Link Set Field............................................5 2.1. Link Set Field............................................5
2.2. Label Set Field...........................................7 2.2. Label Set Field...........................................7
2.2.1. Inclusive/Exclusive Label Lists......................8 2.2.1. Inclusive/Exclusive Label Lists......................8
2.2.2. Inclusive/Exclusive Label Ranges.....................9 2.2.2. Inclusive/Exclusive Label Ranges.....................9
2.2.3. Bitmap Label Set.....................................9 2.2.3. Bitmap Label Set.....................................9
2.3. Available Labels Sub-TLV.................................10 2.3. Available Labels Sub-TLV.................................10
2.4. Shared Backup Labels Sub-TLV.............................11 2.4. Shared Backup Labels Sub-TLV.............................11
2.5. Connectivity Matrix Sub-TLV..............................11 2.5. Connectivity Matrix Sub-TLV..............................11
2.6. Port Label Restriction sub-TLV...........................12 2.6. Port Label Restriction sub-TLV...........................13
2.6.1. SIMPLE_LABEL........................................13 2.6.1. SIMPLE_LABEL........................................14
2.6.2. CHANNEL_COUNT.......................................14 2.6.2. CHANNEL_COUNT.......................................14
2.6.3. LABEL_RANGE1........................................14 2.6.3. LABEL_RANGE1........................................14
2.6.4. SIMPLE_LABEL & CHANNEL_COUNT........................15 2.6.4. SIMPLE_LABEL & CHANNEL_COUNT........................15
2.6.5. Link Label Exclusivity..............................15 2.6.5. Link Label Exclusivity..............................15
3. Security Considerations.......................................15 3. Security Considerations.......................................16
4. IANA Considerations...........................................16 4. IANA Considerations...........................................16
5. Acknowledgments...............................................16 5. Acknowledgments...............................................16
APPENDIX A: Encoding Examples....................................17 APPENDIX A: Encoding Examples....................................17
A.1. Link Set Field...........................................17 A.1. Link Set Field...........................................17
A.2. Label Set Field..........................................17 A.2. Label Set Field..........................................17
A.3. Connectivity Matrix Sub-TLV..............................18 A.3. Connectivity Matrix Sub-TLV..............................18
A.4. Connectivity Matrix with Bi-directional Symmetry.........21 A.4. Connectivity Matrix with Bi-directional Symmetry.........21
6. References....................................................24 6. References....................................................24
6.1. Normative References.....................................24 6.1. Normative References.....................................24
6.2. Informative References...................................24 6.2. Informative References...................................24
7. Contributors..................................................25 7. Contributors..................................................25
Authors' Addresses...............................................26 Authors' Addresses...............................................26
Intellectual Property Statement..................................27 Intellectual Property Statement..................................27
Disclaimer of Validity...........................................27 Disclaimer of Validity...........................................28
1. Introduction 1. Introduction
Some data plane technologies that wish to make use of a GMPLS control Some data plane technologies that wish to make use of a GMPLS control
plane contain additional constraints on switching capability and plane contain additional constraints on switching capability and
label assignment. In addition, some of these technologies must label assignment. In addition, some of these technologies must
perform non-local label assignment based on the nature of the perform non-local label assignment based on the nature of the
technology, e.g., wavelength continuity constraint in WSON [WSON- technology, e.g., wavelength continuity constraint in WSON [WSON-
Frame]. Such constraints can lead to the requirement for link by link Frame]. Such constraints can lead to the requirement for link by link
label availability in path computation and label assignment. label availability in path computation and label assignment.
skipping to change at page 5, line 21 skipping to change at page 5, line 21
Changes from 03 version: Changes from 03 version:
(a)Removed informational BNF from section 1. (a)Removed informational BNF from section 1.
(b) Removed section on "Extension Encoding Usage Recommendations" (b) Removed section on "Extension Encoding Usage Recommendations"
Changes from 04,05 versions: Changes from 04,05 versions:
No changes just refreshed document that was expiring. No changes just refreshed document that was expiring.
Changes from 06 version:
Added priority information to available wavelength encodings.
2. Encoding 2. Encoding
A type-length-value (TLV) encoding of the general connectivity and A type-length-value (TLV) encoding of the general connectivity and
label restrictions and availability extensions is given in this label restrictions and availability extensions is given in this
section. This encoding is designed to be suitable for use in the section. This encoding is designed to be suitable for use in the
GMPLS routing protocols OSPF [RFC4203] and IS-IS [RFC5307] and in the GMPLS routing protocols OSPF [RFC4203] and IS-IS [RFC5307] and in the
PCE protocol PCEP [PCEP]. Note that the information distributed in PCE protocol PCEP [PCEP]. Note that the information distributed in
[RFC4203] and [RFC5307] is arranged via the nesting of sub-TLVs [RFC4203] and [RFC5307] is arranged via the nesting of sub-TLVs
within TLVs and this document makes use of such constructs. First, within TLVs and this document makes use of such constructs. First,
however we define two general purpose fields that will be used however we define two general purpose fields that will be used
skipping to change at page 10, line 34 skipping to change at page 10, line 34
represents the next label logically above the previous. represents the next label logically above the previous.
The size of the bit map is Num Label bits, but the bit map is padded The size of the bit map is Num Label bits, but the bit map is padded
out to a full multiple of 32 bits so that the TLV is a multiple of out to a full multiple of 32 bits so that the TLV is a multiple of
four bytes. Bits that do not represent labels (i.e., those in four bytes. Bits that do not represent labels (i.e., those in
positions (Num Labels) and beyond SHOULD be set to zero and MUST be positions (Num Labels) and beyond SHOULD be set to zero and MUST be
ignored. ignored.
2.3. Available Labels Sub-TLV 2.3. Available Labels Sub-TLV
To indicate the labels available for use on a link the Available The Available Labels sub-TLV link consists of an availability flag,
Labels sub-TLV consists of a single variable length label set field priority flags, and a single variable length label set field as
as follows: follows:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|A| Reserved | Priority Flags| Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Label Set Field | | Label Set Field |
: : : :
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where
A (Availability bit) = 1 or 0 indicates that the labels listed in the
following label set field are available or not available,
respectively, for use at a given priority level as indicated by the
Priority Flags.
Priority Flags: Bit 8 corresponds to priority level 0 and bit 15
corresponds to priority level 7. If a bit is set then the labels in
the label set field are available or not available as indicated by
the A bit for use at that particular priority level.
Note that Label Set Field is defined in Section 3.2. Note that Label Set Field is defined in Section 3.2.
2.4. Shared Backup Labels Sub-TLV 2.4. Shared Backup Labels Sub-TLV
To indicate the labels available for shared backup use on a link the The Shared Backup Labels sub-TLV consists of an availability flag,
Shared Backup Labels sub-TLV consists of a single variable length priority flags, and single variable length label set field as
label set field as follows: follows:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|A| Reserved | Priority Flags| Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Label Set Field | | Label Set Field |
: : : :
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where
A (Availability bit) = 1 or 0 indicates that the labels listed in the
following label set field are available or not available,
respectively, for use at a given priority level as indicated by the
Priority Flags.
Priority Flags: Bit 8 corresponds to priority level 0 and bit 15
corresponds to priority level 7. If a bit is set then the labels in
the label set field are available or not available as indicated by
the A bit for use at that particular priority level.
2.5. Connectivity Matrix Sub-TLV 2.5. Connectivity Matrix Sub-TLV
The Connectivity Matrix represents how ingress ports are connected to The Connectivity Matrix represents how ingress ports are connected to
egress ports for network elements. The switch and fixed connectivity egress ports for network elements. The switch and fixed connectivity
matrices can be compactly represented in terms of a minimal list of matrices can be compactly represented in terms of a minimal list of
ingress and egress port set pairs that have mutual connectivity. As ingress and egress port set pairs that have mutual connectivity. As
described in [Switch] such a minimal list representation leads described in [Switch] such a minimal list representation leads
naturally to a graph representation for path computation purposes naturally to a graph representation for path computation purposes
that involves the fewest additional nodes and links. that involves the fewest additional nodes and links.
skipping to change at page 14, line 10 skipping to change at page 14, line 23
2.6.1. SIMPLE_LABEL 2.6.1. SIMPLE_LABEL
In the case of the SIMPLE_LABEL the GeneralPortRestrictions (or In the case of the SIMPLE_LABEL the GeneralPortRestrictions (or
MatrixSpecificRestrictions) format is given by: MatrixSpecificRestrictions) format is given by:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| MatrixID | RstType = 0 | Reserved | | MatrixID | RstType = 0 | Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Label Set Field | | Label Set Field |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
In this case the accompanying label set indicates the labels In this case the accompanying label set indicates the labels
permitted on the port. permitted on the port.
2.6.2. CHANNEL_COUNT 2.6.2. CHANNEL_COUNT
In the case of the CHANNEL_COUNT the format is given by: In the case of the CHANNEL_COUNT the format is given by:
0 1 2 3 0 1 2 3
skipping to change at page 15, line 17 skipping to change at page 15, line 30
2.6.4. SIMPLE_LABEL & CHANNEL_COUNT 2.6.4. SIMPLE_LABEL & CHANNEL_COUNT
In the case of the SIMPLE_LABEL & CHANNEL_COUNT the format is given In the case of the SIMPLE_LABEL & CHANNEL_COUNT the format is given
by: by:
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| MatrixID | RstType = 3 | MaxNumChannels | | MatrixID | RstType = 3 | MaxNumChannels |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Label Set Field | | Label Set Field |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
In this case the accompanying label set and MaxNumChannels indicate In this case the accompanying label set and MaxNumChannels indicate
labels permitted on the port and the maximum number of labels that labels permitted on the port and the maximum number of labels that
can be simultaneously used on the port. can be simultaneously used on the port.
2.6.5. Link Label Exclusivity 2.6.5. Link Label Exclusivity
In the case of the SIMPLE_LABEL & CHANNEL_COUNT the format is given In the case of the SIMPLE_LABEL & CHANNEL_COUNT the format is given
by: by:
skipping to change at page 26, line 4 skipping to change at page 26, line 4
Email: Jonas.Martensson@acreo.se Email: Jonas.Martensson@acreo.se
Itaru Nishioka Itaru Nishioka
NEC Corp. NEC Corp.
1753 Simonumabe, Nakahara-ku, Kawasaki, Kanagawa 211-8666 1753 Simonumabe, Nakahara-ku, Kawasaki, Kanagawa 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
Rajan Rao
Infinera Corporation
169, Java Drive
Sunnyvale, CA-94089
USA
Email: rrao@infinera.com
Authors' Addresses Authors' Addresses
Greg M. Bernstein (ed.) Greg M. Bernstein (ed.)
Grotto Networking Grotto Networking
Fremont California, USA Fremont California, USA
Phone: (510) 573-2237 Phone: (510) 573-2237
Email: gregb@grotto-networking.com Email: gregb@grotto-networking.com
 End of changes. 18 change blocks. 
17 lines changed or deleted 53 lines changed or added

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