< draft-chen-pce-pcc-ted-04.txt   draft-chen-pce-pcc-ted-05.txt >
PCE Working Group H. Chen PCE Working Group H. Chen
Internet-Draft Huawei Technologies Internet-Draft Futurewei
Intended status: Standards Track M. Toy Intended status: Standards Track M. Toy
Expires: September 6, 2018 Verizon Expires: January 8, 2020 Verizon
X. Liu X. Liu
Jabil Volta Networks
L. Liu L. Liu
Fujitsu Fujitsu
Z. Li Z. Li
China Mobile China Mobile
March 5, 2018 July 7, 2019
Static PCEP Link State Static PCEP Link State
draft-chen-pce-pcc-ted-04 draft-chen-pce-pcc-ted-05
Abstract Abstract
This document presents extensions to the Path Computation Element This document presents extensions to the Path Computation Element
Communication Protocol (PCEP) for a PCC to advertise the information Communication Protocol (PCEP) for a PCC to advertise the information
about the links without running IGP and for a PCE to build a TED about the links without running IGP and for a PCE to build a TED
based on the information received. based on the information received.
Status of This Memo Status of This Memo
This Internet-Draft is submitted in full conformance with the This Internet-Draft is submitted 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). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
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."
This Internet-Draft will expire on September 6, 2018. This Internet-Draft will expire on January 8, 2020.
Copyright Notice Copyright Notice
Copyright (c) 2018 IETF Trust and the persons identified as the Copyright (c) 2019 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 (https://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
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 3 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Conventions Used in This Document . . . . . . . . . . . . . . . 3 3. Conventions Used in This Document . . . . . . . . . . . . . . 3
4. Link Information . . . . . . . . . . . . . . . . . . . . . . . 3 4. Link Information . . . . . . . . . . . . . . . . . . . . . . 3
5. Extensions to PCEP . . . . . . . . . . . . . . . . . . . . . . 4 5. Extensions to PCEP . . . . . . . . . . . . . . . . . . . . . 4
5.1. Extension to Existing Message . . . . . . . . . . . . . . . 4 5.1. Extension to Existing Message . . . . . . . . . . . . . . 4
5.1.1. TLVs . . . . . . . . . . . . . . . . . . . . . . . . . 5 5.1.1. TLVs . . . . . . . . . . . . . . . . . . . . . . . . 4
5.1.2. Sub-TLVs . . . . . . . . . . . . . . . . . . . . . . . 5 5.1.2. Sub-TLVs . . . . . . . . . . . . . . . . . . . . . . 5
5.2. Procedures . . . . . . . . . . . . . . . . . . . . . . . . 6 5.2. Procedures . . . . . . . . . . . . . . . . . . . . . . . 6
5.2.1. PCC Procedures . . . . . . . . . . . . . . . . . . . . 6 5.2.1. PCC Procedures . . . . . . . . . . . . . . . . . . . 6
5.2.2. PCE Procedures . . . . . . . . . . . . . . . . . . . . 7 5.2.2. PCE Procedures . . . . . . . . . . . . . . . . . . . 7
6. Security Considerations . . . . . . . . . . . . . . . . . . . . 8 6. Security Considerations . . . . . . . . . . . . . . . . . . . 8
7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . . 8 7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8
8. Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . . 8 8. Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . 8
9. References . . . . . . . . . . . . . . . . . . . . . . . . . . 9 9. References . . . . . . . . . . . . . . . . . . . . . . . . . 8
9.1. Normative References . . . . . . . . . . . . . . . . . . . 9 9.1. Normative References . . . . . . . . . . . . . . . . . . 8
9.2. Informative References . . . . . . . . . . . . . . . . . . 9 9.2. Informative References . . . . . . . . . . . . . . . . . 9
Appendix A. New Message . . . . . . . . . . . . . . . . . . . . . 9 Appendix A. New Message . . . . . . . . . . . . . . . . . . . . 10
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 11
1. Introduction 1. Introduction
A PCE architecture is described in RFC 4655, in which a Traffic A PCE architecture is described in RFC 4655, in which a Traffic
Engineering Database (TED) for a PCE is constructed based on the link Engineering Database (TED) for a PCE is constructed based on the link
information from IGP (OSPF or IS-IS) running in the domain for which information from IGP (OSPF or IS-IS) running in the domain for which
the PCE is responsible. the PCE is responsible.
For a domain without running IGP, the PCE responsible for the domain For a domain without running IGP, the PCE responsible for the domain
may obtain the link information from a PCC running on each node in may obtain the link information from a PCC running on each node in
skipping to change at page 8, line 10 skipping to change at page 7, line 43
For a message containing Update Links, it updates the links For a message containing Update Links, it updates the links
accordingly. For a message containing Withdraw Links, it removes the accordingly. For a message containing Withdraw Links, it removes the
links. When a node is down, the PCE removes the links attached to links. When a node is down, the PCE removes the links attached to
the node. the node.
For a new P2P link between node A and B with no link ID configured, For a new P2P link between node A and B with no link ID configured,
when receiving a message containing the link from the PCC running on when receiving a message containing the link from the PCC running on
A, the PCE stores the link for A (i.e., the link from A) into its A, the PCE stores the link for A (i.e., the link from A) into its
TED. It will find the link's remote end B using the remote IP TED. It will find the link's remote end B using the remote IP
address of the link. After finding B, it associates the link for A address of the link. After finding B, it associates the link for A
with B and the link for B with A. This creates a bidirectional with B and the link for B with A. This creates a bidirectional
connection between A and B. connection between A and B.
For a new broadcast link connecting multiple nodes with no link ID For a new broadcast link connecting multiple nodes with no link ID
configured, when receiving a message containing the link from the PCC configured, when receiving a message containing the link from the PCC
running on each of the nodes X, the PCE stores the link for X (i.e., running on each of the nodes X, the PCE stores the link for X (i.e.,
the link from X) into its TED. It will find the link's remote end P the link from X) into its TED. It will find the link's remote end P
using the link's local IP address with network mask. P is a Pseudo using the link's local IP address with network mask. P is a Pseudo
node identified by the local IP address of the designated node node identified by the local IP address of the designated node
selected from the nodes connected to the link. After finding P, it selected from the nodes connected to the link. After finding P, it
associates the link for X with P and the link for P with X. This associates the link for X with P and the link for P with X. This
creates a bidirectional connection between X and P. creates a bidirectional connection between X and P.
The first node and second node from which the PCE receives a message The first node and second node from which the PCE receives a message
containing the link is selected as the designed node and backup containing the link is selected as the designed node and backup
designed node respectively. After the designed node is down, the designed node respectively. After the designed node is down, the
backup designed node becomes the designed node and the node other backup designed node becomes the designed node and the node other
than the designed node with the largest local IP address connecting than the designed node with the largest local IP address connecting
to the link is selected as the backup designed node. to the link is selected as the backup designed node.
When the old designed node is down and the backup designed node When the old designed node is down and the backup designed node
skipping to change at page 9, line 4 skipping to change at page 8, line 36
7. IANA Considerations 7. IANA Considerations
This section specifies requests for IANA allocation. This section specifies requests for IANA allocation.
8. Acknowledgement 8. Acknowledgement
The authors would like to thank Jescia Chen, and Eric Wu for their The authors would like to thank Jescia Chen, and Eric Wu for their
valuable comments on this draft. valuable comments on this draft.
9. References 9. References
9.1. Normative References 9.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, DOI 10.17487/ Requirement Levels", BCP 14, RFC 2119,
RFC2119, March 1997, DOI 10.17487/RFC2119, March 1997,
<https://www.rfc-editor.org/info/rfc2119>. <https://www.rfc-editor.org/info/rfc2119>.
[RFC4655] Farrel, A., Vasseur, J., and J. Ash, "A Path Computation [RFC4655] Farrel, A., Vasseur, J., and J. Ash, "A Path Computation
Element (PCE)-Based Architecture", RFC 4655, DOI 10.17487/ Element (PCE)-Based Architecture", RFC 4655,
RFC4655, August 2006, DOI 10.17487/RFC4655, August 2006,
<https://www.rfc-editor.org/info/rfc4655>. <https://www.rfc-editor.org/info/rfc4655>.
[RFC5440] Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation [RFC5440] Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation
Element (PCE) Communication Protocol (PCEP)", RFC 5440, Element (PCE) Communication Protocol (PCEP)", RFC 5440,
DOI 10.17487/RFC5440, March 2009, DOI 10.17487/RFC5440, March 2009,
<https://www.rfc-editor.org/info/rfc5440>. <https://www.rfc-editor.org/info/rfc5440>.
[RFC3630] Katz, D., Kompella, K., and D. Yeung, "Traffic Engineering [RFC3630] Katz, D., Kompella, K., and D. Yeung, "Traffic Engineering
(TE) Extensions to OSPF Version 2", RFC 3630, (TE) Extensions to OSPF Version 2", RFC 3630,
DOI 10.17487/RFC3630, September 2003, DOI 10.17487/RFC3630, September 2003,
skipping to change at page 10, line 34 skipping to change at page 11, line 8
~ ~ ~ ~
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Flag W=1 indicates Withdraw links. W=0 indicates Updated links. Flag W=1 indicates Withdraw links. W=0 indicates Updated links.
Router-ID TLV is optional. Link TLVs are mandatory. They are the Router-ID TLV is optional. Link TLVs are mandatory. They are the
same as described in section 5. same as described in section 5.
Authors' Addresses Authors' Addresses
Huaimo Chen Huaimo Chen
Huawei Technologies Futurewei
Boston, MA, Boston, MA
USA USA
EMail: Huaimo.chen@huawei.com EMail: Huaimo.chen@futurewei.com
Mehmet Toy Mehmet Toy
Verizon Verizon
USA USA
EMail: mehmet.toy@verizon.com EMail: mehmet.toy@verizon.com
Xufeng Liu Xufeng Liu
Jabil Volta Networks
McLean, VA McLean, VA
USA USA
EMail: Xufeng_Liu@jabil.com EMail: xufeng.liu.ietf@gmail.com
Lei Liu Lei Liu
Fujitsu Fujitsu
USA USA
EMail: lliu@us.fujitsu.com EMail: liulei.kddi@gmail.com
Zhenqiang Li Zhenqiang Li
China Mobile China Mobile
No.32 Xuanwumenxi Ave., Xicheng District No.32 Xuanwumenxi Ave., Xicheng District
Beijing 100032 Beijing 100032
P.R. China P.R. China
EMail: li_zhenqiang@hotmail.com EMail: li_zhenqiang@hotmail.com
 End of changes. 21 change blocks. 
39 lines changed or deleted 42 lines changed or added

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