draft-ietf-pce-monitoring-00.txt   draft-ietf-pce-monitoring-01.txt 
Networking Working Group JP. Vasseur, Ed. Networking Working Group JP. Vasseur, Ed.
Internet-Draft Cisco Systems, Inc Internet-Draft Cisco Systems, Inc
Intended status: Standards Track JL. Le Roux Intended status: Standards Track JL. Le Roux
Expires: March 21, 2008 France Telecom Expires: August 9, 2008 France Telecom
Y. Ikejiri Y. Ikejiri
NTT Communications Corporation NTT Communications Corporation
September 18, 2007 February 6, 2008
A set of monitoring tools for Path Computation Element based A set of monitoring tools for Path Computation Element based
Architecture Architecture
draft-ietf-pce-monitoring-00.txt draft-ietf-pce-monitoring-01.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 1, line 38 skipping to change at page 1, line 38
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt. http://www.ietf.org/ietf/1id-abstracts.txt.
The list of Internet-Draft Shadow Directories can be accessed at The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html. http://www.ietf.org/shadow.html.
This Internet-Draft will expire on March 21, 2008. This Internet-Draft will expire on August 9, 2008.
Copyright Notice Copyright Notice
Copyright (C) The IETF Trust (2007). Copyright (C) The IETF Trust (2008).
Abstract Abstract
A Path Computation Element (PCE) based architecture has been A Path Computation Element (PCE) based architecture has been
specified for the computation of Traffic Engineering (TE) Label specified for the computation of Traffic Engineering (TE) Label
Switched Paths (LSPs) in Multiprotocol Label Switching (MPLS) and Switched Paths (LSPs) in Multiprotocol Label Switching (MPLS) and
Generalized MPLS (GMPLS) networks in the context of single or Generalized MPLS (GMPLS) networks in the context of single or
multiple domains (where a domain is referred to as a collection of multiple domains (where a domain is referred to as a collection of
network elements within a common sphere of address management or path network elements within a common sphere of address management or path
computational responsibility such as IGP areas and Autonomous computational responsibility such as IGP areas and Autonomous
skipping to change at page 4, line 47 skipping to change at page 4, line 47
of path computation times are examples of such metrics of interest. of path computation times are examples of such metrics of interest.
This document specifies procedures and extensions to the Path This document specifies procedures and extensions to the Path
Computation Element Protocol (PCEP) ([I-D.ietf-pce-pcep]) in order to Computation Element Protocol (PCEP) ([I-D.ietf-pce-pcep]) in order to
monitor the path computation chain and gather various performance monitor the path computation chain and gather various performance
metrics. metrics.
As discussed in [RFC4655], a TE LSP may be computed by one PCE As discussed in [RFC4655], a TE LSP may be computed by one PCE
(referred to as single PCE path computation) or several PCEs (referred to as single PCE path computation) or several PCEs
(referred to as multiple PCE path computation). In the former case, (referred to as multiple PCE path computation). In the former case,
the PCC may be able to use IGP extensions to check the liveness of the PCC may be able to use IGP extensions to check the liveness of
the PCE (see [I-D.ietf-pce-disco-proto-ospf] and the PCE (see [RFC5088] and [RFC5089]) or PCEP using Keepalive
[I-D.ietf-pce-disco-proto-isis]) or PCEP using Keepalive messages. messages. In contrast, when multiple PCEs are involved in the path
In contrast, when multiple PCEs are involved in the path computation computation chain an example of which is the BRPC procedure defined
chain an example of which is the BRPC procedure defined in in [I-D.ietf-pce-brpc], the PCC's visibility may be limited to the
[I-D.ietf-pce-brpc], the PCC's visibility may be limited to the first first PCE involved in the path computation chain. Thus, it is
PCE involved in the path computation chain. Thus, it is critical to critical to define mechanisms in order to monitor the state of the
define mechanisms in order to monitor the state of the path path computation chain.
computation chain.
The aim of this document is to specify PCEP extensions in order to The aim of this document is to specify PCEP extensions in order to
gather various state metrics along the path computation chain. In gather various state metrics along the path computation chain. In
this document we call a "state metric" a metric that characterizes a this document we call a "state metric" a metric that characterizes a
PCE state. For example, such metric can have a form of a bolean (PCE PCE state. For example, such metric can have a form of a bolean (PCE
is alive or not, PCE is congested or not) or a performance metric is alive or not, PCE is congested or not) or a performance metric
(path computation time at each PCE). (path computation time at each PCE).
PCE state metrics collection can be gathered in two different PCE state metrics collection can be gathered in two different
contexts: in band or out of band. By "In band" we refer to the contexts: in band or out of band. By "In band" we refer to the
skipping to change at page 7, line 35 skipping to change at page 7, line 35
[<IRO>] [<IRO>]
[<LOAD-BALANCING>] [<LOAD-BALANCING>]
[<XRO>] [<XRO>]
<metric-list>::=<METRIC>[<metric-list>] <metric-list>::=<METRIC>[<metric-list>]
<pce-list>::=<PCE-ID>[<pce-list>] <pce-list>::=<PCE-ID>[<pce-list>]
The SVEC, RP, END-POINTS, LSPA, BANDWIDTH, METRIC, ERO, IRO and LOAD- The SVEC, RP, END-POINTS, LSPA, BANDWIDTH, METRIC, ERO, IRO and LOAD-
BALANCING objects are defined in [I-D.ietf-pce-pcep]. The XRO object BALANCING objects are defined in [I-D.ietf-pce-pcep]. The XRO object
is defined in [I-D.oki-pce-pcep-xro] and the OF object is defined in is defined in [I-D.ietf-pce-pcep-xro] and the OF object is defined in
[I-D.leroux-pce-of]. [I-D.ietf-pce-of].
The PCMonReq message is used to gather various PCE state metrics The PCMonReq message is used to gather various PCE state metrics
along a path computation chain. The path computation chain may be along a path computation chain. The path computation chain may be
determined by the PCC (in the form of a series of a series of PCE-ID determined by the PCC (in the form of a series of a series of PCE-ID
objects defined in Section 4.2.) or may alternatively be determined objects defined in Section 4.2.) or may alternatively be determined
by the path computation procedure. For example, if the BRPC by the path computation procedure. For example, if the BRPC
procedure ([I-D.ietf-pce-brpc]) is used to compute an inter-domain TE procedure ([I-D.ietf-pce-brpc]) is used to compute an inter-domain TE
LSP, the PCE chain may be determined dynamically. In that case, the LSP, the PCE chain may be determined dynamically. In that case, the
PCC sends a PCMonReq message that contains the PCEP objects that PCC sends a PCMonReq message that contains the PCEP objects that
charaterize the TE LSP attributes along with the monitoring objects charaterize the TE LSP attributes along with the monitoring objects
skipping to change at page 12, line 26 skipping to change at page 12, line 26
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| | | |
| IPv6 Address | | IPv6 Address |
| | | |
| | | |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
The PCE-ID object body has a fixed length of 4 octets for IPv4 and 16 The PCE-ID object body has a fixed length of 4 octets for IPv4 and 16
octets for IPv6. octets for IPv6.
A PCE MUST use the same IP address as the address used in the PCE- A PCE MUST use the same IP address as the address used in the PCE-
ADDRESS sub-TLV defined in [I-D.ietf-pce-disco-proto-ospf] and ADDRESS sub-TLV defined in [RFC5088] and [RFC5089] should a dynamic
[I-D.ietf-pce-disco-proto-isis] should a dynamic discovery mechanism discovery mechanism be used for PCE discovery.
be used for PCE discovery.
4.3. PROC-TIME Object 4.3. PROC-TIME Object
The PROC-TIME object MUST be present within a PCMonRep or a PCRep The PROC-TIME object MUST be present within a PCMonRep or a PCRep
message if the P bit of the MONITORING object carried within the message if the P bit of the MONITORING object carried within the
corresponding PCMonReq or PCReq message is set. The PROC-TIME object corresponding PCMonReq or PCReq message is set. The PROC-TIME object
is used to report various processing time related metrics. is used to report various processing time related metrics.
1) Case of general monitoring requests 1) Case of general monitoring requests
skipping to change at page 18, line 15 skipping to change at page 18, line 15
12. Acknowledgements 12. Acknowledgements
The authors would like to thank Eiji Oki, Mach Chen and Dimitri The authors would like to thank Eiji Oki, Mach Chen and Dimitri
Papadimitriou for their useful comments. Papadimitriou for their useful comments.
13. References 13. References
13.1. Normative References 13.1. Normative References
[I-D.ietf-pce-pcep] [I-D.ietf-pce-pcep]
Roux, J. and J. Vasseur, "Path Computation Element (PCE) Ayyangar, A., Oki, E., Atlas, A., Dolganow, A., Ikejiri,
communication Protocol (PCEP)", draft-ietf-pce-pcep-08 Y., Kumaki, K., Vasseur, J., and J. Roux, "Path
(work in progress), July 2007. Computation Element (PCE) communication Protocol (PCEP)",
draft-ietf-pce-pcep-09 (work in progress), November 2007.
[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.
[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, August 2006. Element (PCE)-Based Architecture", RFC 4655, August 2006.
13.2. Informative References 13.2. Informative References
[I-D.ietf-pce-brpc] [I-D.ietf-pce-brpc]
Vasseur, J., "A Backward Recursive PCE-based Computation Vasseur, J., "A Backward Recursive PCE-based Computation
(BRPC) procedure to compute shortest inter-domain Traffic (BRPC) procedure to compute shortest inter-domain Traffic
Engineering Label Switched Paths", draft-ietf-pce-brpc-06 Engineering Label Switched Paths", draft-ietf-pce-brpc-06
(work in progress), September 2007. (work in progress), September 2007.
[I-D.ietf-pce-disco-proto-isis] [I-D.ietf-pce-disco-proto-isis]
Roux, J., "IS-IS protocol extensions for Path Computation Roux, J., "IS-IS Protocol Extensions for Path Computation
Element (PCE) Discovery",
draft-ietf-pce-disco-proto-isis-07 (work in progress),
September 2007.
[I-D.ietf-pce-disco-proto-ospf]
Roux, J., "OSPF protocol extensions for Path Computation
Element (PCE) Discovery", Element (PCE) Discovery",
draft-ietf-pce-disco-proto-ospf-07 (work in progress), draft-ietf-pce-disco-proto-isis-08 (work in progress),
September 2007. September 2007.
[I-D.leroux-pce-of] [I-D.ietf-pce-of]
Roux, J., "Encoding of Objective Functions in Path Roux, J., "Encoding of Objective Functions in Path
Computation Element (PCE) communication and discovery Computation Element communication Protocol (PCEP)",
protocols", draft-leroux-pce-of-01 (work in progress), draft-ietf-pce-of-01 (work in progress), November 2007.
July 2007.
[I-D.oki-pce-pcep-xro] [I-D.ietf-pce-pcep-xro]
Oki, E. and A. Farrel, "Extensions to the Path Computation Oki, E. and A. Farrel, "Extensions to the Path Computation
Element Communication Protocol (PCEP) for Route Element Communication Protocol (PCEP) for Route
Exclusions", draft-oki-pce-pcep-xro-00 (work in progress), Exclusions", draft-ietf-pce-pcep-xro-02 (work in
January 2007. progress), September 2007.
[RFC5088] Le Roux, JL., Vasseur, JP., Ikejiri, Y., and R. Zhang,
"OSPF Protocol Extensions for Path Computation Element
(PCE) Discovery", RFC 5088, January 2008.
[RFC5089] Le Roux, JL., Vasseur, JP., Ikejiri, Y., and R. Zhang,
"IS-IS Protocol Extensions for Path Computation Element
(PCE) Discovery", RFC 5089, January 2008.
Authors' Addresses Authors' Addresses
JP Vasseur (editor) JP Vasseur (editor)
Cisco Systems, Inc Cisco Systems, Inc
1414 Massachusetts Avenue 1414 Massachusetts Avenue
Boxborough, MA 01719 Boxborough, MA 01719
USA USA
Email: jpv@cisco.com Email: jpv@cisco.com
skipping to change at page 20, line 7 skipping to change at page 20, line 7
Yuichi Ikejiri Yuichi Ikejiri
NTT Communications Corporation NTT Communications Corporation
1-1-6, Uchisaiwai-cho, Chiyoda-ku 1-1-6, Uchisaiwai-cho, Chiyoda-ku
Tokyo, 100-8019 Tokyo, 100-8019
Japan Japan
Email: : y.ikejiri@ntt.com Email: : y.ikejiri@ntt.com
Full Copyright Statement Full Copyright Statement
Copyright (C) The IETF Trust (2007). Copyright (C) The IETF Trust (2008).
This document is subject to the rights, licenses and restrictions This document is subject to the rights, licenses and restrictions
contained in BCP 78, and except as set forth therein, the authors contained in BCP 78, and except as set forth therein, the authors
retain all their rights. 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, THE IETF TRUST AND OR IS SPONSORED BY (IF ANY), THE INTERNET SOCIETY, THE IETF TRUST AND
THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS THE INTERNET ENGINEERING TASK FORCE DISCLAIM ALL WARRANTIES, EXPRESS
OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF OR IMPLIED, INCLUDING BUT NOT LIMITED TO ANY WARRANTY THAT THE USE OF
 End of changes. 16 change blocks. 
37 lines changed or deleted 37 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/