draft-ietf-ospf-te-node-addr-03.txt   draft-ietf-ospf-te-node-addr-04.txt 
Network Working Group R. Aggarwal Network Working Group R. Aggarwal
Internet Draft Juniper Networks Internet Draft Juniper Networks
Expiration Date: December 2006 Expiration Date: May 21, 2008
K. Kompella K. Kompella
Juniper Networks Juniper Networks
November 18, 2007
Advertising a Router's Local Addresses in OSPF TE Extensions Advertising a Router's Local Addresses in OSPF TE Extensions
draft-ietf-ospf-te-node-addr-03.txt draft-ietf-ospf-te-node-addr-04.txt
Status of this Memo Status of this Memo
By submitting this Internet-Draft, each author represents that any By submitting this Internet-Draft, each author represents that any
applicable patent or other IPR claims of which he or she is aware applicable patent or other IPR claims of which he or she is aware
have been or will be disclosed, and any of which he or she becomes have been or will be disclosed, and any of which he or she becomes
aware will be disclosed, in accordance with Section 6 of BCP 79. aware will be disclosed, in accordance with Section 6 of 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
skipping to change at page 2, line 12 skipping to change at page 2, line 11
addresses. Currently, the only addresses belonging to a router that addresses. Currently, the only addresses belonging to a router that
are advertised in TE LSAs are the local addresses corresponding to TE are advertised in TE LSAs are the local addresses corresponding to TE
enabled links and the local address corresponding to the Router ID. enabled links and the local address corresponding to the Router ID.
Table of Contents Table of Contents
1 Specification of requirements ......................... 2 1 Specification of requirements ......................... 2
2 Motivation ............................................ 2 2 Motivation ............................................ 2
3 A Potential Solution .................................. 3 3 A Potential Solution .................................. 3
4 Proposed Solution ..................................... 3 4 Proposed Solution ..................................... 3
4.1 Node Attribute TLV .................................... 4 4.1 Node Attribute TLV .................................... 3
4.2 Operation ............................................. 5 4.2 Operation ............................................. 5
5 Security Considerations ............................... 5 5 Security Considerations ............................... 5
6 IANA Considerations ................................... 5 6 IANA Considerations ................................... 5
7 Acknowledgments ....................................... 5 7 Acknowledgments ....................................... 5
8 References ............................................ 5 8 References ............................................ 5
8.1 Normative References .................................. 5 8.1 Normative References .................................. 6
8.2 Informative References ................................ 6 8.2 Informative References ................................ 6
9 Author Information .................................... 6 9 Author's Address ...................................... 6
10 Intellectual Property Statement ....................... 6 10 Intellectual Property Statement ....................... 7
11 Full Copyright Statement .............................. 7 11 Copyright Notice ...................................... 7
1. Specification of requirements 1. Specification of requirements
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in [RFC2119]. document are to be interpreted as described in [RFC2119].
2. Motivation 2. Motivation
In some cases it is desirable to setup constrained shortest path In some cases it is desirable to setup constrained shortest path
skipping to change at page 3, line 19 skipping to change at page 3, line 14
However currently routers in an OSPF network can only use CSPF to However currently routers in an OSPF network can only use CSPF to
compute MPLS TE LSPs to the router ID or the local addresses of TE compute MPLS TE LSPs to the router ID or the local addresses of TE
enabled links of a remote router. This restriction arises because enabled links of a remote router. This restriction arises because
OSPF TE extensions [OSPF-TE, OSPFv3-TE] only advertise the router ID OSPF TE extensions [OSPF-TE, OSPFv3-TE] only advertise the router ID
and the local addresses of TE enabled links of a given router. Other and the local addresses of TE enabled links of a given router. Other
routers in the network can populate their traffic engineering routers in the network can populate their traffic engineering
database (TED) with these local addresses belonging to the database (TED) with these local addresses belonging to the
advertising router. However they cannot populate the TED with other advertising router. However they cannot populate the TED with other
local addresses of the advertising router i.e. loopback and non-TE local addresses of the advertising router i.e. loopback and non-TE
interface addresses. OSPFv2 stub links in the router LSA [OSPFv2], interface addresses. OSPFv2 stub links in the router LSA [OSPF],
provide stub reachability information to the router but are not provide stub reachability information to the router but are not
sufficient to learn all the local addresses of a router. In sufficient to learn all the local addresses of a router. In
particular for a subnetted point-to-point (P2P) interface the stub particular for a subnetted point-to-point (P2P) interface the stub
link ID is the subnet address, while for a non-subnetted interface link ID is the subnet address, while for a non-subnetted interface
the stub link ID is the neighbor address. Intra-prefix LSAs in OSPFv3 the stub link ID is the neighbor address. Intra-prefix LSAs in OSPFv3
[OSPFv3] are also not sufficient to learn the local addresses. [OSPFv3] are also not sufficient to learn the local addresses.
For the above reasons this document proposes an enhancement to OSPF For the above reasons this document proposes an enhancement to OSPF
TE extensions to advertise the local addresses of a node. TE extensions to advertise the local addresses of a node.
skipping to change at page 4, line 30 skipping to change at page 4, line 20
| 1 | Length | | 1 | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| IPv4 Address 1 | | IPv4 Address 1 |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
. . . . . .
. . . . . .
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| IPv4 Address n | | IPv4 Address n |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
The length is set to 4 * n where n is the number of local addresses Each local IPv4 address is encoded as a <Address Length, Address>
included in the sub-TLV. tuple. Address Length is encoded in 1 byte. It is the number of bits
in the Address and can be at most 32. Address is an IPv4 address
prefix and can be at most 4 bytes.
The Node IPv4 Local Address sub-TLV length is the sum of all n IPv4
Address encodings in the sub-TLV where n is the number of local
addresses included in the sub-TLV.
The node IPv6 local address sub-TLV has a type of 2 and contains one The node IPv6 local address sub-TLV has a type of 2 and contains one
or more local IPv6 addresses. It has the following format: or more local IPv6 addresses. It has the following format:
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 | Length | | 2 | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| IPv6 Address 1 | | IPv6 Address 1 |
skipping to change at page 5, line 6 skipping to change at page 4, line 51
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
. . . . . .
. . . . . .
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| IPv6 Address n | | IPv6 Address n |
| | | |
| | | |
| | | |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-- +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+--
The length is set to 16 * n where n is the number of local addresses Each local IPv6 address is encoded as a <Address Length, Address>
included in the sub-TLV. tuple. Address Length is encoded in 1 byte. It is the number of bits
in the address and can be at most 128. Address is an IPv6 address
prefix and can be at most 16 bytes.
The Node IPv6 Local Address sub-TLV length is the sum of all n IPv6
Address encodings in the sub-TLV where n is the number of local
addresses included in the sub-TLV.
4.2. Operation 4.2. Operation
A router announces one or more local addresses in the node attribute A router announces one or more local addresses in the node attribute
TLV. The local addresses that can be learned from TE LSAs i.e. TLV. The local addresses that can be learned from TE LSAs i.e.
router address and TE interface addresses SHOULD not be advertised in router address and TE interface addresses SHOULD not be advertised in
the node local address sub-TLV. The local addresses advertised will the node local address sub-TLV. The local addresses advertised will
depend on the local configuration of the advertising router. The depend on the local configuration of the advertising router. The
default behavior MAY be to advertise all the loopback interface default behavior MAY be to advertise all the loopback interface
addresses. addresses.
skipping to change at page 6, line 12 skipping to change at page 6, line 23
Extensions to OSPF version 2", RFC 3630, Extensions to OSPF version 2", RFC 3630,
September 2003. September 2003.
[OSPFv3] R. Coltun, D. Ferguson, J. Moy, "OSPF for IPv6", [OSPFv3] R. Coltun, D. Ferguson, J. Moy, "OSPF for IPv6",
RFC 2740. RFC 2740.
8.2. Informative References 8.2. Informative References
[OSPFv3-TE] K. Ishiguro, T. Takada, "Traffic Engineering [OSPFv3-TE] K. Ishiguro, T. Takada, "Traffic Engineering
Extensions to OSPF version 3", Extensions to OSPF version 3",
draft-ietf-ospf-ospfv3-traffic-01.txt. draft-ietf-ospf-ospfv3-traffic-09.txt.
9. Author Information 9. Author's Address
Rahul Aggarwal Rahul Aggarwal
Juniper Networks Juniper Networks
1194 North Mathilda Ave. 1194 North Mathilda Ave.
Sunnyvale, CA 94089 Sunnyvale, CA 94089
Phone: +1-408-936-2720
Email: rahul@juniper.net Email: rahul@juniper.net
Kireeti Kompella Kireeti Kompella
Juniper Networks Juniper Networks
1194 North Mathilda Ave. 1194 North Mathilda Ave.
Sunnyvale, CA 94089 Sunnyvale, CA 94089
Email: kireeti@juniper.net Email: kireeti@juniper.net
10. Intellectual Property Statement 10. Intellectual Property Statement
skipping to change at page 7, line 7 skipping to change at page 7, line 29
such proprietary rights by implementers or users of this such proprietary rights by implementers or users of this
specification can be obtained from the IETF on-line IPR repository at specification can be obtained from the IETF on-line IPR repository at
http://www.ietf.org/ipr. 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
this standard. Please address the information to the IETF at ietf- this standard. Please address the information to the IETF at ietf-
ipr@ietf.org. ipr@ietf.org.
11. Full Copyright Statement 11. Copyright Notice
Copyright (C) The Internet Society (2006). This document is subject Copyright (C) The IETF Trust (2007).
to the rights, licenses and restrictions contained in BCP 78, and
except as set forth therein, the authors retain all their rights. This document is subject to the rights, licenses and restrictions
contained in BCP 78, and except as set forth therein, the authors
retain all their rights.
This document and the information contained herein are provided on an This document and the information contained herein are provided on an
"AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS "AS IS" basis and THE CONTRIBUTOR, THE ORGANIZATION HE/SHE REPRESENTS
OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY AND THE INTERNET OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS OR IMPLIED, THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF THE OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED THE INFORMATION HEREIN WILL NOT INFRINGE ANY RIGHTS OR ANY IMPLIED
WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
 End of changes. 15 change blocks. 
22 lines changed or deleted 41 lines changed or added

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