draft-ietf-ccamp-general-constraint-encode-07.txt   draft-ietf-ccamp-general-constraint-encode-08.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: September 2012 D. Li Expires: January 2013 D. Li
Huawei Huawei
W. Imajuku W. Imajuku
NTT NTT
March 6, 2012 July 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-07.txt draft-ietf-ccamp-general-constraint-encode-08.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
provisions of BCP 78 and BCP 79. the 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.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six
and may be updated, replaced, or obsoleted by other documents at any months and may be updated, replaced, or obsoleted by other documents
time. It is inappropriate to use Internet-Drafts as reference at any time. It is inappropriate to use Internet-Drafts as
material or to cite them other than as "work in progress." reference 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 September 6, 2012. This Internet-Draft will expire on January 6, 2012.
Copyright Notice Copyright Notice
Copyright (c) 2012 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
to this document. Code Components extracted from this document must respect to this document. Code Components extracted from this
include Simplified BSD License text as described in Section 4.e of document must include Simplified BSD License text as described in
the Trust Legal Provisions and are provided without warranty as Section 4.e of the Trust Legal Provisions and are provided without
described in the Simplified BSD License. warranty as described in the Simplified BSD License.
Abstract Abstract
Generalized Multiprotocol Label Switching can be used to control a Generalized Multiprotocol Label Switching can be used to control a
wide variety of technologies. In some of these technologies network wide variety of technologies. In some of these technologies network
elements and links may impose additional routing constraints such as elements and links may impose additional routing constraints such as
asymmetric switch connectivity, non-local label assignment, and label asymmetric switch connectivity, non-local label assignment, and
range limitations on links. label range limitations on links.
This document provides efficient, protocol-agnostic encodings for This document provides efficient, protocol-agnostic encodings for
general information elements representing connectivity and label general information elements representing connectivity and label
constraints as well as label availability. It is intended that constraints as well as label availability. It is intended that
protocol-specific documents will reference this memo to describe how protocol-specific documents will reference this memo to describe how
information is carried for specific uses. information is carried for specific uses.
Conventions used in this document Conventions used in this document
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
skipping to change at page 2, line 44 skipping to change at page 2, line 44
Table of Contents Table of Contents
1. Introduction...................................................3 1. Introduction...................................................3
1.1. Node Switching Asymmetry Constraints......................3 1.1. Node Switching Asymmetry Constraints......................3
1.2. Non-Local Label Assignment Constraints....................4 1.2. Non-Local Label Assignment Constraints....................4
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...........................13 2.6. Port Label Restriction sub-TLV...........................13
2.6.1. SIMPLE_LABEL........................................14 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 ..........................................15
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 ................................16
3. Security Considerations.......................................16 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....................................................25
6.1. Normative References.....................................24 6.1. Normative References.....................................25
6.2. Informative References...................................24 6.2. Informative References...................................25
7. Contributors..................................................25 7. Contributors..................................................26
Authors' Addresses...............................................26 Authors' Addresses...............................................27
Intellectual Property Statement..................................27 Intellectual Property Statement..................................28
Disclaimer of Validity...........................................28 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
plane contain additional constraints on switching capability and control plane contain additional constraints on switching capability
label assignment. In addition, some of these technologies must and 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
label availability in path computation and label assignment. link label availability in path computation and label assignment.
This document provides efficient encodings of information needed by This document provides efficient encodings of information needed by
the routing and label assignment process in technologies such as WSON the routing and label assignment process in technologies such as
and are potentially applicable to a wider range of technologies. Such WSON and are potentially applicable to a wider range of
encodings can be used to extend GMPLS signaling and routing technologies. Such encodings can be used to extend GMPLS signaling
protocols. In addition these encodings could be used by other and routing protocols. In addition these encodings could be used by
mechanisms to convey this same information to a path computation other mechanisms to convey this same information to a path
element (PCE). computation element (PCE).
1.1. Node Switching Asymmetry Constraints 1.1. Node Switching Asymmetry Constraints
For some network elements the ability of a signal or packet on a For some network elements the ability of a signal or packet on a
particular ingress port to reach a particular egress port may be particular ingress port to reach a particular egress port may be
limited. In addition, in some network elements the connectivity limited. In addition, in some network elements the connectivity
between some ingress ports and egress ports may be fixed, e.g., a between some ingress ports and egress ports may be fixed, e.g., a
simple multiplexer. To take into account such constraints during path simple multiplexer. To take into account such constraints during
computation we model this aspect of a network element via a path computation we model this aspect of a network element via a
connectivity matrix. connectivity matrix.
The connectivity matrix (ConnectivityMatrix) represents either the The connectivity matrix (ConnectivityMatrix) represents either the
potential connectivity matrix for asymmetric switches or fixed potential connectivity matrix for asymmetric switches or fixed
connectivity for an asymmetric device such as a multiplexer. Note connectivity for an asymmetric device such as a multiplexer. Note
that this matrix does not represent any particular internal blocking that this matrix does not represent any particular internal blocking
behavior but indicates which ingress ports and labels (e.g., behavior but indicates which ingress ports and labels (e.g.,
wavelengths) could possibly be connected to a particular output port. wavelengths) could possibly be connected to a particular output
Representing internal state dependent blocking for a node is beyond port. Representing internal state dependent blocking for a node is
the scope of this document and due to it's highly implementation beyond the scope of this document and due to it's highly
dependent nature would most likely not be subject to standardization implementation dependent nature would most likely not be subject to
in the future. The connectivity matrix is a conceptual M by N matrix standardization in the future. The connectivity matrix is a
representing the potential switched or fixed connectivity, where M conceptual M by N matrix representing the potential switched or
represents the number of ingress ports and N the number of egress fixed connectivity, where M represents the number of ingress ports
ports. and N the number of egress ports.
1.2. Non-Local Label Assignment Constraints 1.2. Non-Local Label Assignment Constraints
If the nature of the equipment involved in a network results in a If the nature of the equipment involved in a network results in a
requirement for non-local label assignment we can have constraints requirement for non-local label assignment we can have constraints
based on limits imposed by the ports themselves and those that are based on limits imposed by the ports themselves and those that are
implied by the current label usage. Note that constraints such as implied by the current label usage. Note that constraints such as
these only become important when label assignment has a non-local these only become important when label assignment has a non-local
character. For example in MPLS an LSR may have a limited range of character. For example in MPLS an LSR may have a limited range of
labels available for use on an egress port and a set of labels labels available for use on an egress port and a set of labels
already in use on that port and hence unavailable for use. This already in use on that port and hence unavailable for use. This
information, however, does not need to be shared unless there is some information, however, does not need to be shared unless there is
limitation on the LSR's label swapping ability. For example if a TDM some limitation on the LSR's label swapping ability. For example if
node lacks the ability to perform time-slot interchange or a WSON a TDM node lacks the ability to perform time-slot interchange or a
lacks the ability to perform wavelength conversion then the label WSON lacks the ability to perform wavelength conversion then the
assignment process is not local to a single node and it may be label assignment process is not local to a single node and it may be
advantageous to share the label assignment constraint information for advantageous to share the label assignment constraint information
use in path computation. for use in path computation.
Port label restrictions (PortLabelRestriction) model the label Port label restrictions (PortLabelRestriction) model the label
restrictions that the network element (node) and link may impose on a restrictions that the network element (node) and link may impose on
port. These restrictions tell us what labels may or may not be used a port. These restrictions tell us what labels may or may not be
on a link and are intended to be relatively static. More dynamic used on a link and are intended to be relatively static. More
information is contained in the information on available labels. Port dynamic information is contained in the information on available
label restrictions are specified relative to the port in general or labels. Port label restrictions are specified relative to the port
to a specific connectivity matrix for increased modeling flexibility. in general or to a specific connectivity matrix for increased
Reference [Switch] gives an example where both switch and fixed modeling flexibility. Reference [Switch] gives an example where both
connectivity matrices are used and both types of constraints occur on switch and fixed connectivity matrices are used and both types of
the same port. constraints occur on the same port.
1.3. Change Log 1.3. Change Log
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: Changes from 06 version:
Added priority information to available wavelength encodings. Added priority information to available wavelength encodings.
Changes from 07 version:
In port label constraint changed reserved field to Switching
Capability and Encoding to allow for self description of labels used
and interface capability.
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
PCE protocol PCEP [PCEP]. Note that the information distributed in the PCE protocol PCEP [PCEP]. Note that the information distributed
[RFC4203] and [RFC5307] is arranged via the nesting of sub-TLVs in [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
repeatedly in the subsequent TLVs. repeatedly in the subsequent TLVs.
2.1. Link Set Field 2.1. Link Set Field
We will frequently need to describe properties of groups of links. To We will frequently need to describe properties of groups of links.
do so efficiently we can make use of a link set concept similar to To do so efficiently we can make use of a link set concept similar
the label set concept of [RFC3471]. This Link Set Field is used in to the label set concept of [RFC3471]. This Link Set Field is used
the <ConnectivityMatrix> sub-TLV, which is defined in Section 2.5. in the <ConnectivityMatrix> sub-TLV, which is defined in Section
The information carried in a Link Set is defined by: 2.5. The information carried in a Link Set is defined 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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action |Dir| Format | Length | | Action |Dir| Format | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Identifier 1 | | Link Identifier 1 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
: : : : : :
: : : : : :
skipping to change at page 6, line 28 skipping to change at page 6, line 30
Action: 8 bits Action: 8 bits
0 - Inclusive List 0 - Inclusive List
Indicates that one or more link identifiers are included in the Link Indicates that one or more link identifiers are included in the Link
Set. Each identifies a separate link that is part of the set. Set. Each identifies a separate link that is part of the set.
1 - Inclusive Range 1 - Inclusive Range
Indicates that the Link Set defines a range of links. It contains Indicates that the Link Set defines a range of links. It contains
two link identifiers. The first identifier indicates the start of the two link identifiers. The first identifier indicates the start of
range (inclusive). The second identifier indicates the end of the the range (inclusive). The second identifier indicates the end of
range (inclusive). All links with numeric values between the bounds the range (inclusive). All links with numeric values between the
are considered to be part of the set. A value of zero in either bounds are considered to be part of the set. A value of zero in
position indicates that there is no bound on the corresponding either position indicates that there is no bound on the
portion of the range. Note that the Action field can be set to corresponding portion of the range. Note that the Action field can
0x02(Inclusive Range) only when unnumbered link identifier is used. be set to 0x02(Inclusive Range) only when unnumbered link identifier
is used.
Dir: Directionality of the Link Set (2 bits) Dir: Directionality of the Link Set (2 bits)
0 -- bidirectional 0 -- bidirectional
1 -- ingress 1 -- ingress
2 -- egress 2 -- egress
For example in optical networks we think in terms of unidirectional For example in optical networks we think in terms of unidirectional
as well as bidirectional links. For example, label restrictions or as well as bidirectional links. For example, label restrictions or
connectivity may be different for an ingress port, than for its connectivity may be different for an ingress port, than for its
"companion" egress port if one exists. Note that "interfaces" such as "companion" egress port if one exists. Note that "interfaces" such
those discussed in the Interfaces MIB [RFC2863] are assumed to be as those discussed in the Interfaces MIB [RFC2863] are assumed to be
bidirectional. This also applies to the links advertised in various bidirectional. This also applies to the links advertised in various
link state routing protocols. link state routing protocols.
Format: The format of the link identifier (6 bits) Format: The format of the link identifier (6 bits)
0 -- Link Local Identifier 0 -- Link Local Identifier
Indicates that the links in the Link Set are identified by link local Indicates that the links in the Link Set are identified by link
identifiers. All link local identifiers are supplied in the context local identifiers. All link local identifiers are supplied in the
of the advertising node. context of the advertising node.
1 -- Local Interface IPv4 Address 1 -- Local Interface IPv4 Address
2 -- Local Interface IPv6 Address 2 -- Local Interface IPv6 Address
Indicates that the links in the Link Set are identified by Local Indicates that the links in the Link Set are identified by Local
Interface IP Address. All Local Interface IP Address are supplied in Interface IP Address. All Local Interface IP Address are supplied in
the context of the advertising node. the context of the advertising node.
Others TBD. Others TBD.
skipping to change at page 7, line 37 skipping to change at page 7, line 40
Length: 16 bits Length: 16 bits
This field indicates the total length in bytes of the Link Set field. This field indicates the total length in bytes of the Link Set field.
Link Identifier: length is dependent on the link format Link Identifier: length is dependent on the link format
The link identifier represents the port which is being described The link identifier represents the port which is being described
either for connectivity or label restrictions. This can be the link either for connectivity or label restrictions. This can be the link
local identifier of [RFC4202], GMPLS routing, [RFC4203] GMPLS OSPF local identifier of [RFC4202], GMPLS routing, [RFC4203] GMPLS OSPF
routing, and [RFC5307] IS-IS GMPLS routing. The use of the link local routing, and [RFC5307] IS-IS GMPLS routing. The use of the link
identifier format can result in more compact encodings when the local identifier format can result in more compact encodings when
assignments are done in a reasonable fashion. the assignments are done in a reasonable fashion.
2.2. Label Set Field 2.2. Label Set Field
Label Set Field is used within the <AvailableLabels> sub-TLV or the Label Set Field is used within the <AvailableLabels> sub-TLV or the
<SharedBackupLabels> sub-TLV, which is defined in Section 2.3. and <SharedBackupLabels> sub-TLV, which is defined in Section 2.3. and
2.4. , respectively. 2.4. , respectively.
The general format for a label set is given below. This format uses The general format for a label set is given below. This format uses
the Action concept from [RFC3471] with an additional Action to define the Action concept from [RFC3471] with an additional Action to
a "bit map" type of label set. The second 32 bit field is a base define a "bit map" type of label set. The second 32 bit field is a
label used as a starting point in many of the specific formats. base label used as a starting point in many of the specific formats.
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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action| Num Labels | Length | | Action| Num Labels | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Base Label | | Base Label |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Additional fields as necessary per action | | Additional fields as necessary per action |
| |
skipping to change at page 8, line 35 skipping to change at page 8, line 38
3 - Exclusive Range 3 - Exclusive Range
4 - Bitmap Set 4 - Bitmap Set
Num Labels is only meaningful for Action value of 4 (Bitmap Set). It Num Labels is only meaningful for Action value of 4 (Bitmap Set). It
indicates the number of labels represented by the bit map. See more indicates the number of labels represented by the bit map. See more
detail in section 3.2.3. detail in section 3.2.3.
Length is the length in bytes of the entire field. Length is the length in bytes of the entire field.
2.2.1. Inclusive/Exclusive Label Lists 2.2.1. Inclusive/Exclusive Label Lists
In the case of the inclusive/exclusive lists the wavelength set In the case of the inclusive/exclusive lists the wavelength set
format is given by: 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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 or 1 | Num Labels (not used) | Length | |0 or 1 | Num Labels (not used) | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Base Label | | Base Label |
skipping to change at page 9, line 23 skipping to change at page 9, line 23
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Last Label | | Last Label |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where: Where:
Num Labels is not used in this particular format since the Length Num Labels is not used in this particular format since the Length
parameter is sufficient to determine the number of labels in the parameter is sufficient to determine the number of labels in the
list. list.
2.2.2. Inclusive/Exclusive Label Ranges 2.2.2. Inclusive/Exclusive Label Ranges
In the case of inclusive/exclusive ranges the label set format is In the case of inclusive/exclusive ranges the label set format is
given by: 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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|2 or 3 | Num Labels(not used) | Length | |2 or 3 | Num Labels(not used) | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Start Label | | Start Label |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| End Label | | End Label |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note that the start and end label must in some sense "compatible" in Note that the start and end label must in some sense "compatible" in
the technology being used. the technology being used.
2.2.3. Bitmap Label Set 2.2.3. Bitmap Label Set
In the case of Action = 4, the bitmap the label set format is given In the case of Action = 4, the bitmap the label set 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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| 4 | Num Labels | Length | | 4 | Num Labels | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Base Label | | Base Label |
skipping to change at page 10, line 48 skipping to change at page 10, line 48
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 | |A| Reserved | Priority Flags| Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Label Set Field | | Label Set Field |
: : : :
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where Where
A (Availability bit) = 1 or 0 indicates that the labels listed in the A (Availability bit) = 1 or 0 indicates that the labels listed in
following label set field are available or not available, the following label set field are available or not available,
respectively, for use at a given priority level as indicated by the respectively, for use at a given priority level as indicated by the
Priority Flags. Priority Flags.
Priority Flags: Bit 8 corresponds to priority level 0 and bit 15 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 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 label set field are available or not available as indicated by
the A bit for use at that particular priority level. 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.
skipping to change at page 11, line 30 skipping to change at page 11, line 30
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 | |A| Reserved | Priority Flags| Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Label Set Field | | Label Set Field |
: : : :
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where Where
A (Availability bit) = 1 or 0 indicates that the labels listed in the A (Availability bit) = 1 or 0 indicates that the labels listed in
following label set field are available or not available, the following label set field are available or not available,
respectively, for use at a given priority level as indicated by the respectively, for use at a given priority level as indicated by the
Priority Flags. Priority Flags.
Priority Flags: Bit 8 corresponds to priority level 0 and bit 15 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 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 label set field are available or not available as indicated by
the A bit for use at that particular priority level. 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
egress ports for network elements. The switch and fixed connectivity to egress ports for network elements. The switch and fixed
matrices can be compactly represented in terms of a minimal list of connectivity matrices can be compactly represented in terms of a
ingress and egress port set pairs that have mutual connectivity. As minimal list of ingress and egress port set pairs that have mutual
described in [Switch] such a minimal list representation leads connectivity. As described in [Switch] such a minimal list
naturally to a graph representation for path computation purposes representation leads naturally to a graph representation for path
that involves the fewest additional nodes and links. computation purposes that involves the fewest additional nodes and
links.
A TLV encoding of this list of link set pairs is: A TLV encoding of this list of link set pairs is:
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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Connectivity | MatrixID | Reserved | | Connectivity | MatrixID | Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Set A #1 | | Link Set A #1 |
: : : : : :
skipping to change at page 12, line 33 skipping to change at page 12, line 34
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where Where
Connectivity is the device type. Connectivity is the device type.
0 -- the device is fixed 0 -- the device is fixed
1 -- the device is switched(e.g., ROADM/OXC) 1 -- the device is switched(e.g., ROADM/OXC)
MatrixID represents the ID of the connectivity matrix and is an 8 bit MatrixID represents the ID of the connectivity matrix and is an 8
integer. The value of 0xFF is reserved for use with port wavelength bit integer. The value of 0xFF is reserved for use with port
constraints and should not be used to identify a connectivity matrix. wavelength constraints and should not be used to identify a
connectivity matrix.
Link Set A #1 and Link Set B #1 together represent a pair of link Link Set A #1 and Link Set B #1 together represent a pair of link
sets. There are two permitted combinations for the link set field sets. There are two permitted combinations for the link set field
parameter "dir" for Link Set A and B pairs: parameter "dir" for Link Set A and B pairs:
o Link Set A dir=ingress, Link Set B dir=egress o Link Set A dir=ingress, Link Set B dir=egress
The meaning of the pair of link sets A and B in this case is that The meaning of the pair of link sets A and B in this case is that
any signal that ingresses a link in set A can be potentially any signal that ingresses a link in set A can be potentially
switched out of an egress link in set B. switched out of an egress link in set B.
skipping to change at page 13, line 14 skipping to change at page 13, line 17
The meaning of the pair of link sets A and B in this case is that The meaning of the pair of link sets A and B in this case is that
any signal that ingresses on the links in set A can potentially any signal that ingresses on the links in set A can potentially
egress on a link in set B, and any ingress signal on the links in egress on a link in set B, and any ingress signal on the links in
set B can potentially egress on a link in set A. set B can potentially egress on a link in set A.
See Appendix A for both types of encodings as applied to a ROADM See Appendix A for both types of encodings as applied to a ROADM
example. example.
2.6. Port Label Restriction sub-TLV 2.6. Port Label Restriction sub-TLV
Port Label Restriction tells us what labels may or may not be used on Port Label Restriction tells us what labels may or may not be used
a link. on a link.
The port label restriction of section 1.2. can be encoded as a sub- The port label restriction of section 1.2. can be encoded as a sub-
TLV as follows. More than one of these sub-TLVs may be needed to TLV as follows. More than one of these sub-TLVs may be needed to
fully specify a complex port constraint. When more than one of these fully specify a complex port constraint. When more than one of these
sub-TLVs are present the resulting restriction is the intersection of sub-TLVs are present the resulting restriction is the intersection
the restrictions expressed in each sub-TLV. To indicate that a of the restrictions expressed in each sub-TLV. To indicate that a
restriction applies to the port in general and not to a specific restriction applies to the port in general and not to a specific
connectivity matrix use the reserved value of 0xFF for the MatrixID. connectivity matrix use the reserved value of 0xFF for the MatrixID.
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 | RestrictionType | Reserved/Parameter | | MatrixID | RestrictionType| Switching Cap | Encoding |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Additional Restriction Parameters per RestrictionType | | Additional Restriction Parameters per RestrictionType |
: : : :
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Where: Where:
MatrixID: either is the value in the corresponding Connectivity MatrixID: either is the value in the corresponding Connectivity
Matrix sub-TLV or takes the value OxFF to indicate the restriction Matrix sub-TLV or takes the value OxFF to indicate the restriction
applies to the port regardless of any Connectivity Matrix. applies to the port regardless of any Connectivity Matrix.
RestrictionType can take the following values and meanings: RestrictionType can take the following values and meanings:
0: SIMPLE_LABEL (Simple label selective restriction) 0: SIMPLE_LABEL (Simple label selective restriction)
1: CHANNEL_COUNT (Channel count restriction) 1: CHANNEL_COUNT (Channel count restriction)
2: LABEL_RANGE1 (Label range device with a movable center
label and width)
2: LABEL_RANGE1 (Label range device with a movable center label
and width)
3: SIMPLE_LABEL & CHANNEL_COUNT (Combination of SIMPLE_LABEL 3: SIMPLE_LABEL & CHANNEL_COUNT (Combination of SIMPLE_LABEL
and CHANNEL_COUNT restriction. The accompanying label set and and CHANNEL_COUNT restriction. The accompanying label set and
channel count indicate labels permitted on the port and the channel count indicate labels permitted on the port and the
maximum number of channels that can be simultaneously used on maximum number of channels that can be simultaneously used on
the port) the port)
4: LINK_LABEL_EXCLUSIVITY (A label may be used at most once 4: LINK_LABEL_EXCLUSIVITY (A label may be used at most once
amongst a set of specified ports) amongst a set of specified ports)
2.6.1. SIMPLE_LABEL Switching Capability is defined in [RFC4203] and Encoding in
[RFC3471]. The combination of these fields defines the type of
labels used in specifying the port label restrictions as well as the
interface type to which these restrictions apply.
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
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 = 1 | MaxNumChannels | | MatrixID | RstType = 1 | MaxNumChannels |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
In this case the accompanying MaxNumChannels indicates the maximum In this case the accompanying MaxNumChannels indicates the maximum
number of channels (labels) that can be simultaneously used on the number of channels (labels) that can be simultaneously used on the
port/matrix. port/matrix.
2.6.3. LABEL_RANGE1 2.6.3. LABEL_RANGE1
In the case of the LABEL_RANGE1 the GeneralPortRestrictions (or In the case of the LABEL_RANGE1 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 = 2 | MaxLabelRange | | MatrixID | RstType = 2 | MaxLabelRange |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Label Set Field | | Label Set Field |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
In this case the accompanying MaxLabelRange indicates the maximum In this case the accompanying MaxLabelRange indicates the maximum
range of the labels. The corresponding label set is used to indicate range of the labels. The corresponding label set is used to indicate
the overall label range. Specific center label information can be the overall label range. Specific center label information can be
obtained from dynamic label in use information. It is assumed that obtained from dynamic label in use information. It is assumed that
both center label and range tuning can be done without causing faults both center label and range tuning can be done without causing
to existing signals. faults to existing signals.
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:
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 = 4 | Reserved | | MatrixID | RstType = 4 | Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Set Field | | Link Set Field |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
In this case the accompanying port set indicate that a label may be In this case the accompanying port set indicate that a label may be
used at most once among the ports in the link set field. used at most once among the ports in the link set field.
3. Security Considerations 3. Security Considerations
This document defines protocol-independent encodings for WSON This document defines protocol-independent encodings for WSON
information and does not introduce any security issues. information and does not introduce any security issues.
skipping to change at page 17, line 12 skipping to change at page 17, line 12
This document was prepared using 2-Word-v2.0.template.dot. This document was prepared using 2-Word-v2.0.template.dot.
APPENDIX A: Encoding Examples APPENDIX A: Encoding Examples
Here we give examples of the general encoding extensions applied to Here we give examples of the general encoding extensions applied to
some simple ROADM network elements and links. some simple ROADM network elements and links.
A.1. Link Set Field A.1. Link Set Field
Suppose that we wish to describe a set of ingress ports that are have Suppose that we wish to describe a set of ingress ports that are
link local identifiers number 3 through 42. In the link set field we have link local identifiers number 3 through 42. In the link set
set the Action = 1 to denote an inclusive range; the Dir = 1 to field we set the Action = 1 to denote an inclusive range; the Dir =
denote ingress links; and, the Format = 0 to denote link local 1 to denote ingress links; and, the Format = 0 to denote link local
identifiers. In particular we have: identifiers. In particular we have:
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=1 |0 1|0 0 0 0 0 0| Length = 12 | | Action=1 |0 1|0 0 0 0 0 0| Length = 12 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #3 | | Link Local Identifier = #3 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #42 | | Link Local Identifier = #42 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
A.2. Label Set Field A.2. Label Set Field
Example: Example:
A 40 channel C-Band DWDM system with 100GHz spacing with lowest A 40 channel C-Band DWDM system with 100GHz spacing with lowest
frequency 192.0THz (1561.4nm) and highest frequency 195.9THz frequency 192.0THz (1561.4nm) and highest frequency 195.9THz
(1530.3nm). These frequencies correspond to n = -11, and n = 28 (1530.3nm). These frequencies correspond to n = -11, and n = 28
respectively. Now suppose the following channels are available: respectively. Now suppose the following channels are available:
Frequency (THz) n Value bit map position Frequency (THz) n Value bit map position
-------------------------------------------------- --------------------------------------------------
192.0 -11 0 192.0 -11 0
192.5 -6 5 192.5 -6 5
193.1 0 11 193.1 0 11
193.9 8 19 193.9 8 19
194.0 9 20 194.0 9 20
195.2 21 32 195.2 21 32
195.8 27 38 195.8 27 38
With the Grid value set to indicate an ITU-T G.694.1 DWDM grid, C.S. With the Grid value set to indicate an ITU-T G.694.1 DWDM grid, C.S.
set to indicate 100GHz this lambda bit map set would then be encoded set to indicate 100GHz this lambda bit map set would then be encoded
as follows: as 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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| 4 | Num Wavelengths = 40 | Length = 16 bytes | | 4 | Num Wavelengths = 40 | Length = 16 bytes |
skipping to change at page 18, line 45 skipping to change at page 18, line 45
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|Grid | C.S. | Reserved | n for lowest frequency = 27 | |Grid | C.S. | Reserved | n for lowest frequency = 27 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
A.3. Connectivity Matrix Sub-TLV A.3. Connectivity Matrix Sub-TLV
Example: Example:
Suppose we have a typical 2-degree 40 channel ROADM. In addition to Suppose we have a typical 2-degree 40 channel ROADM. In addition to
its two line side ports it has 80 add and 80 drop ports. The picture its two line side ports it has 80 add and 80 drop ports. The picture
below illustrates how a typical 2-degree ROADM system that works with below illustrates how a typical 2-degree ROADM system that works
bi-directional fiber pairs is a highly asymmetrical system composed with bi-directional fiber pairs is a highly asymmetrical system
of two unidirectional ROADM subsystems. composed of two unidirectional ROADM subsystems.
(Tributary) Ports #3-#42 (Tributary) Ports #3-#42
Ingress added to Egress dropped from Ingress added to Egress dropped from
West Line Egress East Line Ingress West Line Egress East Line Ingress
vvvvv ^^^^^ vvvvv ^^^^^
| |||.| | |||.| | |||.| | |||.|
+-----| |||.|--------| |||.|------+ +-----| |||.|--------| |||.|------+
| +----------------------+ | | +----------------------+ |
| | | | | | | |
Egress | | Unidirectional ROADM | | Ingress Egress | | Unidirectional ROADM | | Ingress
skipping to change at page 20, line 5 skipping to change at page 20, line 5
#3-#42 (add ports) can only connect to the egress on port #1. While #3-#42 (add ports) can only connect to the egress on port #1. While
the ingress side of port #2 (line side) can only connect to the the ingress side of port #2 (line side) can only connect to the
egress on ports #3-#42 (drop) and to the egress on port #1 (pass egress on ports #3-#42 (drop) and to the egress on port #1 (pass
through). Similarly, the ingress direction of ports #43-#82 can only through). Similarly, the ingress direction of ports #43-#82 can only
connect to the egress on port #2 (line). While the ingress direction connect to the egress on port #2 (line). While the ingress direction
of port #1 can only connect to the egress on ports #43-#82 (drop) or of port #1 can only connect to the egress on ports #43-#82 (drop) or
port #2 (pass through). We can now represent this potential port #2 (pass through). We can now represent this potential
connectivity matrix as follows. This representation uses only 30 32- connectivity matrix as follows. This representation uses only 30 32-
bit words. bit words.
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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Conn = 1 | MatrixID | Reserved |1 | Conn = 1 | MatrixID | Reserved |1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: adds to line Note: adds to line
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=1 |0 1|0 0 0 0 0 0| Length = 12 |2 | Action=1 |0 1|0 0 0 0 0 0| Length = 12 |2
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #3 |3 | Link Local Identifier = #3 |3
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #42 |4 | Link Local Identifier = #42 |4
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |1 0|0 0 0 0 0 0| Length = 8 |5 | Action=0 |1 0|0 0 0 0 0 0| Length = 8 |5
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #1 |6 | Link Local Identifier = #1 |6
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: line to drops Note: line to drops
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 1|0 0 0 0 0 0| Length = 8 |7 | Action=0 |0 1|0 0 0 0 0 0| Length = 8 |7
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #2 |8 | Link Local Identifier = #2 |8
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=1 |1 0|0 0 0 0 0 0| Length = 12 |9 | Action=1 |1 0|0 0 0 0 0 0| Length = 12 |9
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #3 |10 | Link Local Identifier = #3 |10
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #42 |11 | Link Local Identifier = #42 |11
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: line to line Note: line to line
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 1|0 0 0 0 0 0| Length = 8 |12 | Action=0 |0 1|0 0 0 0 0 0| Length = 8 |12
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #2 |13 | Link Local Identifier = #2 |13
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |1 0|0 0 0 0 0 0| Length = 8 |14 | Action=0 |1 0|0 0 0 0 0 0| Length = 8 |14
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #1 |15 | Link Local Identifier = #1 |15
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: adds to line Note: adds to line
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=1 |0 1|0 0 0 0 0 0| Length = 12 |16 | Action=1 |0 1|0 0 0 0 0 0| Length = 12 |16
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #43 |17 | Link Local Identifier = #43 |17
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #82 |18 | Link Local Identifier = #82 |18
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |1 0|0 0 0 0 0 0| Length = 8 |19 | Action=0 |1 0|0 0 0 0 0 0| Length = 8 |19
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #2 |20 | Link Local Identifier = #2 |20
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: line to drops Note: line to drops
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 1|0 0 0 0 0 0|| Length = 8 |21 | Action=0 |0 1|0 0 0 0 0 0|| Length = 8 |21
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #1 |22 | Link Local Identifier = #1 |22
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=1 |1 0|0 0 0 0 0 0| Length = 12 |23 | Action=1 |1 0|0 0 0 0 0 0| Length = 12 |23
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #43 |24 | Link Local Identifier = #43 |24
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #82 |25 | Link Local Identifier = #82 |25
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: line to line Note: line to line
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 1|0 0 0 0 0 0| Length = 8 |26 | Action=0 |0 1|0 0 0 0 0 0| Length = 8 |26
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #1 |27 | Link Local Identifier = #1 |27
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |1 0|0 0 0 0 0 0| Length = 8 |28 | Action=0 |1 0|0 0 0 0 0 0| Length = 8 |28
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #2 |30 | Link Local Identifier = #2 |29
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
A.4. Connectivity Matrix with Bi-directional Symmetry A.4. Connectivity Matrix with Bi-directional Symmetry
If one has the ability to renumber the ports of the previous example If one has the ability to renumber the ports of the previous example
as shown in the next figure then we can take advantage of the bi- as shown in the next figure then we can take advantage of the bi-
directional symmetry and use bi-directional encoding of the directional symmetry and use bi-directional encoding of the
connectivity matrix. Note that we set dir=bidirectional in the link connectivity matrix. Note that we set dir=bidirectional in the link
set fields. set fields.
(Tributary) (Tributary)
skipping to change at page 22, line 29 skipping to change at page 22, line 29
(West Line Side) | |(East Line Side) (West Line Side) | |(East Line Side)
-----------------+ +----------------------+ +-------------- -----------------+ +----------------------+ +--------------
>=====================| |===================> >=====================| |===================>
-----------------+ | Unidirectional ROADM | +-------------- -----------------+ | Unidirectional ROADM | +--------------
Ingress | | | | Egress Ingress | | | | Egress
| | _ | | | | _ | |
| +----------------------+ | | +----------------------+ |
+-----| |||.|--------| |||.|------+ +-----| |||.|--------| |||.|------+
| |||.| | |||.| | |||.| | |||.|
vvvvv ^^^^^ vvvvv ^^^^^
Ports #3-#42 Ports #43-82 Ports #3-#42 Ports #43-82
Egress dropped from Ingress added to Egress dropped from Ingress added to
West Line ingress East Line egress West Line ingress East Line egress
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
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Conn = 1 | MatrixID | Reserved |1 | Conn = 1 | MatrixID | Reserved |1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Add/Drops #3-42 to Line side #1 Add/Drops #3-42 to Line side #1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=1 |0 0|0 0 0 0 0 0| Length = 12 |2 | Action=1 |0 0|0 0 0 0 0 0| Length = 12 |2
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #3 |3 | Link Local Identifier = #3 |3
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #42 |4 | Link Local Identifier = #42 |4
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 0|0 0 0 0 0 0| Length = 8 |5 | Action=0 |0 0|0 0 0 0 0 0| Length = 8 |5
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #1 |6 | Link Local Identifier = #1
|6
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: line #2 to add/drops #43-82 Note: line #2 to add/drops #43-82
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 0|0 0 0 0 0 0| Length = 8 |7 | Action=0 |0 0|0 0 0 0 0 0| Length = 8 |7
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #2 |8 | Link Local Identifier = #2 |8
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=1 |0 0|0 0 0 0 0 0| Length = 12 |9 | Action=1 |0 0|0 0 0 0 0 0| Length = 12 |9
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #43 |10 | Link Local Identifier = #43
|10
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #82 |11 | Link Local Identifier = #82
|11
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Note: line to line Note: line to line
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 0|0 0 0 0 0 0| Length = 8 |12 | Action=0 |0 0|0 0 0 0 0 0| Length = 8
|12
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #1 |13 | Link Local Identifier = #1
|13
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Action=0 |0 0|0 0 0 0 0 0| Length = 8 |14 | Action=0 |0 0|0 0 0 0 0 0| Length = 8
|14
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Link Local Identifier = #2 |15 | Link Local Identifier = #2
|15
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
6. References 6. References
6.1. Normative References 6.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119, March 1997. Requirement Levels", BCP 14, RFC 2119, March 1997.
[RFC2863] McCloghrie, K. and F. Kastenholz, "The Interfaces Group [RFC2863] McCloghrie, K. and F. Kastenholz, "The Interfaces Group
MIB", RFC 2863, June 2000. MIB", RFC 2863, June 2000.
[RFC3471] Berger, L., "Generalized Multi-Protocol Label Switching [RFC3471] Berger, L., "Generalized Multi-Protocol Label Switching
(GMPLS) Signaling Functional Description", RFC 3471, (GMPLS) Signaling Functional Description", RFC 3471,
January 2003. January 2003.
[G.694.1] ITU-T Recommendation G.694.1, "Spectral grids for WDM [G.694.1] ITU-T Recommendation G.694.1, "Spectral grids for WDM
applications: DWDM frequency grid", June, 2002. applications: DWDM frequency grid", June, 2002.
[RFC4202] Kompella, K., Ed., and Y. Rekhter, Ed., "Routing Extensions [RFC4202] Kompella, K., Ed., and Y. Rekhter, Ed., "Routing
in Support of Generalized Multi-Protocol Label Switching Extensions in Support of Generalized Multi-Protocol Label
(GMPLS)", RFC 4202, October 2005 Switching (GMPLS)", RFC 4202, October 2005
[RFC4203] Kompella, K., Ed., and Y. Rekhter, Ed., "OSPF Extensions in [RFC4203] Kompella, K., Ed., and Y. Rekhter, Ed., "OSPF Extensions
Support of Generalized Multi-Protocol Label Switching in Support of Generalized Multi-Protocol Label Switching
(GMPLS)", RFC 4203, October 2005. (GMPLS)", RFC 4203, October 2005.
6.2. Informative References 6.2. Informative References
[G.694.1] ITU-T Recommendation G.694.1, Spectral grids for WDM [G.694.1] ITU-T Recommendation G.694.1, Spectral grids for WDM
applications: DWDM frequency grid, June 2002. applications: DWDM frequency grid, June 2002.
[G.694.2] ITU-T Recommendation G.694.2, Spectral grids for WDM [G.694.2] ITU-T Recommendation G.694.2, Spectral grids for WDM
applications: CWDM wavelength grid, December 2003. applications: CWDM wavelength grid, December 2003.
[RFC5307] Kompella, K., Ed., and Y. Rekhter, Ed., "IS-IS Extensions [RFC5307] Kompella, K., Ed., and Y. Rekhter, Ed., "IS-IS Extensions
in Support of Generalized Multi-Protocol Label Switching in Support of Generalized Multi-Protocol Label Switching
(GMPLS)", RFC 5307, October 2008. (GMPLS)", RFC 5307, October 2008.
[Switch] G. Bernstein, Y. Lee, A. Gavler, J. Martensson, " Modeling [Switch] G. Bernstein, Y. Lee, A. Gavler, J. Martensson, " Modeling
WDM Wavelength Switching Systems for Use in GMPLS and Automated WDM Wavelength Switching Systems for Use in GMPLS and
Path Computation", Journal of Optical Communications and Automated Path Computation", Journal of Optical Communications
Networking, vol. 1, June, 2009, pp. 187-195. and Networking, vol. 1, June, 2009, pp. 187-195.
[PCEP] Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation [PCEP] Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation
Element (PCE) communication Protocol (PCEP) - Version 1", Element (PCE) communication Protocol (PCEP) - Version 1",
RFC5440. RFC5440.
7. Contributors 7. Contributors
Diego Caviglia Diego Caviglia
Ericsson Ericsson
Via A. Negrone 1/A 16153 Via A. Negrone 1/A 16153
skipping to change at page 26, line 4 skipping to change at page 27, 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
skipping to change at page 27, line 44 skipping to change at page 28, line 27
claimed to pertain to the implementation or use of the technology claimed to pertain to the implementation or use of the technology
described in any IETF Document or the extent to which any license described in any IETF Document or the extent to which any license
under such rights might or might not be available; nor does it under such rights might or might not be available; nor does it
represent that it has made any independent effort to identify any represent that it has made any independent effort to identify any
such rights. such rights.
Copies of Intellectual Property disclosures made to the IETF Copies of Intellectual Property disclosures made to the IETF
Secretariat and any assurances of licenses to be made available, or Secretariat and any assurances of licenses to be made available, or
the result of an attempt made to obtain a general license or the result of an attempt made to obtain a general license or
permission for the use of such proprietary rights by implementers or permission for the use of such proprietary rights by implementers or
users of this specification can be obtained from the IETF on-line IPR users of this specification can be obtained from the IETF on-line
repository at http://www.ietf.org/ipr IPR repository at http://www.ietf.org/ipr
The IETF invites any interested party to bring to its attention any The IETF invites any interested party to bring to its attention any
copyrights, patents or patent applications, or other proprietary copyrights, patents or patent applications, or other proprietary
rights that may cover technology that may be required to implement rights that may cover technology that may be required to implement
any standard or specification contained in an IETF Document. Please any standard or specification contained in an IETF Document. Please
address the information to the IETF at ietf-ipr@ietf.org. address the information to the IETF at ietf-ipr@ietf.org.
Disclaimer of Validity Disclaimer of Validity
All IETF Documents and the information contained therein are provided All IETF Documents and the information contained therein are
on an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE provided on an "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION
REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE HE/SHE REPRESENTS OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY,
IETF TRUST AND THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL THE IETF TRUST AND THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL
WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTIES, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY
WARRANTY THAT THE USE OF THE INFORMATION THEREIN WILL NOT INFRINGE WARRANTY THAT THE USE OF THE INFORMATION THEREIN WILL NOT INFRINGE
ANY RIGHTS OR ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS ANY RIGHTS OR ANY IMPLIED WARRANTIES OF MERCHANTABILITY OR FITNESS
FOR A PARTICULAR PURPOSE. FOR A PARTICULAR PURPOSE.
Acknowledgment Acknowledgment
Funding for the RFC Editor function is currently provided by the Funding for the RFC Editor function is currently provided by the
Internet Society. Internet Society.
 End of changes. 76 change blocks. 
241 lines changed or deleted 257 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/