draft-ietf-detnet-problem-statement-00.txt   draft-ietf-detnet-problem-statement-01.txt 
detnet N. Finn detnet N. Finn
Internet-Draft P. Thubert Internet-Draft Self-employed
Intended status: Standards Track Cisco Intended status: Informational P. Thubert
Expires: October 6, 2016 April 4, 2016 Expires: April 1, 2017 Cisco
September 28, 2016
Deterministic Networking Problem Statement Deterministic Networking Problem Statement
draft-ietf-detnet-problem-statement-00 draft-ietf-detnet-problem-statement-01
Abstract Abstract
This paper documents the needs in various industries to establish This paper documents the needs in various industries to establish
multi-hop paths for characterized flows with deterministic properties multi-hop paths for characterized flows with deterministic properties
. .
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
skipping to change at page 1, line 32 skipping to change at page 1, line 33
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 http://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 October 6, 2016. This Internet-Draft will expire on April 1, 2017.
Copyright Notice Copyright Notice
Copyright (c) 2016 IETF Trust and the persons identified as the Copyright (c) 2016 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of (http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License. described in the Simplified BSD License.
Table of Contents Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3 2. On Deterministic Networking . . . . . . . . . . . . . . . . . 3
3. On Deterministic Networking . . . . . . . . . . . . . . . . . 4 3. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 6
4. Problem Statement . . . . . . . . . . . . . . . . . . . . . . 6 3.1. Supported topologies . . . . . . . . . . . . . . . . . . 6
4.1. Supported topologies . . . . . . . . . . . . . . . . . . 6 3.2. Flow Characterization . . . . . . . . . . . . . . . . . . 6
4.2. Flow Characterization . . . . . . . . . . . . . . . . . . 6 3.3. Centralized Path Computation and Installation . . . . . . 6
4.3. Centralized Path Computation and Installation . . . . . . 6 3.4. Distributed Path Setup . . . . . . . . . . . . . . . . . 7
4.4. Distributed Path Setup . . . . . . . . . . . . . . . . . 7 3.5. Duplicated data format . . . . . . . . . . . . . . . . . 8
4.5. Duplicated data format . . . . . . . . . . . . . . . . . 8 4. Security Considerations . . . . . . . . . . . . . . . . . . . 8
5. Security Considerations . . . . . . . . . . . . . . . . . . . 8 5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 9
6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 9 6. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 9
7. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 9 7. Informative References . . . . . . . . . . . . . . . . . . . 9
8. References . . . . . . . . . . . . . . . . . . . . . . . . . 9 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 10
8.1. Normative References . . . . . . . . . . . . . . . . . . 9
8.2. Informative References . . . . . . . . . . . . . . . . . 9
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 15
1. Introduction 1. Introduction
The Deterministic Networking Use Cases The Deterministic Networking Use Cases [I-D.ietf-detnet-use-cases]
[I-D.grossman-detnet-use-cases] document illustrates that beyond the document illustrates that beyond the classical case of industrial
classical case of industrial automation and control systems (IACS), automation and control systems (IACS), there are in fact multiple
there are in fact multiple industries with strong and yet relatively industries with strong and yet relatively similar needs for
similar needs for deterministic network services with latency deterministic network services with latency guarantees and ultra-low
guarantees and ultra-low packet loss. packet loss.
The generalization of the needs for more deterministic networks have The generalization of the needs for more deterministic networks have
led to the IEEE 802.1 AVB Task Group becoming the Time-Sensitive led to the IEEE 802.1 AVB Task Group becoming the Time-Sensitive
Networking (TSN) [IEEE802.1TSNTG] Task Group (TG), with a much- Networking (TSN) [IEEE802.1TSNTG] Task Group (TG), with a much-
expanded constituency from the industrial and vehicular markets. expanded constituency from the industrial and vehicular markets.
Along with this expansion, the networks in consideration are becoming Along with this expansion, the networks in consideration are becoming
larger and structured, requiring deterministic forwarding beyond the larger and structured, requiring deterministic forwarding beyond the
LAN boundaries. For instance, IACS segregates the network along the LAN boundaries. For instance, IACS segregates the network along the
broad lines of the Purdue Enterprise Reference Architecture (PERA) broad lines of the Purdue Enterprise Reference Architecture (PERA)
skipping to change at page 3, line 44 skipping to change at page 3, line 41
ultra-low jitter, duplication and elimination of packets over non- ultra-low jitter, duplication and elimination of packets over non-
congruent paths for a higher delivery ratio, and/or zero congestion congruent paths for a higher delivery ratio, and/or zero congestion
loss, regardless of the amount of other flows in the network. loss, regardless of the amount of other flows in the network.
Depending on the network capabilities and on the current state, Depending on the network capabilities and on the current state,
requests to establish a path by an end-node or a network management requests to establish a path by an end-node or a network management
entity may be granted or rejected, an existing path may be moved or entity may be granted or rejected, an existing path may be moved or
removed, and DetNet flows exceeding their contract may face packet removed, and DetNet flows exceeding their contract may face packet
declassification and drop. declassification and drop.
2. Terminology 2. On Deterministic Networking
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in [RFC2119].
3. On Deterministic Networking
The Internet is not the only digital network that has grown The Internet is not the only digital network that has grown
dramatically over the last 30-40 years. Video and audio dramatically over the last 30-40 years. Video and audio
entertainment, and control systems for machinery, manufacturing entertainment, and control systems for machinery, manufacturing
processes, and vehicles are also ubiquitous, and are now based almost processes, and vehicles are also ubiquitous, and are now based almost
entirely on digital technologies. Over the past 10 years, engineers entirely on digital technologies. Over the past 10 years, engineers
in these fields have come to realize that significant advantages in in these fields have come to realize that significant advantages in
both cost and in the ability to accelerate growth can be obtained by both cost and in the ability to accelerate growth can be obtained by
basing all of these disparate digital technologies on packet basing all of these disparate digital technologies on packet
networks. networks.
The goals of Deterministic Networking are to enable the migration of The goals of Deterministic Networking are to enable the migration of
applications that use special-purpose fieldbus technologies (HDMI, applications that use special-purpose fieldbus technologies (HDMI,
CANbus, ProfiBus, etc... even RS-232!) to packet technologies in CANbus, ProfiBus, etc... even RS-232!) to packet technologies in
general, and the Internet Protocol in particular, and to support both general, and the Internet Protocol in particular, and to support both
these new applications, and existing packet network applications, these new applications, and existing packet network applications,
over the same physical network. over the same physical network.
Considerable experience ([ODVA],[AVnu], [Profinet],[IEC62439], Considerable experience ([ODVA]/[EIP],[AVnu],
[Profinet],[HART],[IEC62439], [ISA100.11a] and [WirelessHART],
etc...) has shown that these applications need a some or all of a etc...) has shown that these applications need a some or all of a
suite of features that includes: suite of features that includes:
1. Time synchronization of all host and network nodes (routers and/ 1. Time synchronization of all host and network nodes (routers and/
or bridges), accurate to something between 10 nanoseconds and 10 or bridges), accurate to something between 10 nanoseconds and 10
microseconds, depending on the application. microseconds, depending on the application.
2. Support for critical packet flows that: 2. Support for critical packet flows that:
* Can be unicast or multicast; * Can be unicast or multicast;
skipping to change at page 6, line 13 skipping to change at page 6, line 5
avoid. In the first place, a network cannot deliver finite latency avoid. In the first place, a network cannot deliver finite latency
and practically zero packet loss to an arbitrarily high offered load. and practically zero packet loss to an arbitrarily high offered load.
Secondly, achieving practically zero packet loss for un-throttled Secondly, achieving practically zero packet loss for un-throttled
(though bandwidth limited) flows means that bridges and routers have (though bandwidth limited) flows means that bridges and routers have
to dedicate buffer resources to specific flows or to classes of to dedicate buffer resources to specific flows or to classes of
flows. The requirements of each reservation have to be translated flows. The requirements of each reservation have to be translated
into the parameters that control each host's, bridge's, and router's into the parameters that control each host's, bridge's, and router's
queuing, shaping, and scheduling functions and delivered to the queuing, shaping, and scheduling functions and delivered to the
hosts, bridges, and routers. hosts, bridges, and routers.
4. Problem Statement 3. Problem Statement
4.1. Supported topologies 3.1. Supported topologies
In some use cases, the end point which run the application is In some use cases, the end point which run the application is
involved in the deterministic networking operation, for instance by involved in the deterministic networking operation, for instance by
controlling certain aspects of its throughput such as rate or precise controlling certain aspects of its throughput such as rate or precise
time of emission. In that case, the deterministic path is end-to-end time of emission. In that case, the deterministic path is end-to-end
from application host to application host. from application host to application host.
On the other end, the deterministic portion of a path may be a tunnel On the other end, the deterministic portion of a path may be a tunnel
between and ingress and an egress router. In any case, routers and between and ingress and an egress router. In any case, routers and
switches in between should not need to be aware whether the path is switches in between should not need to be aware whether the path is
end-to-end of a tunnel. end-to-end of a tunnel.
While it is clear that DetNet does not aim at setting up While it is clear that DetNet does not aim at setting up
deterministic paths over the global Internet, there is still a lack deterministic paths over the global Internet, there is still a lack
of clarity on the limits of a domain where a deterministic path can of clarity on the limits of a domain where a deterministic path can
be set up. These limits may depend in the technology that is used to be set up. These limits may depend in the technology that is used to
seu th epath up, whether it is centralized or distributed. seu th epath up, whether it is centralized or distributed.
4.2. Flow Characterization 3.2. Flow Characterization
Deterministic forwarding can only apply on flows with well-defined Deterministic forwarding can only apply on flows with well-defined
characteristics such as periodicity and burstiness. Before a path characteristics such as periodicity and burstiness. Before a path
can be established to serve them, the expression of those can be established to serve them, the expression of those
characteristics, and how the network can serve them, for instance in characteristics, and how the network can serve them, for instance in
shaping and forwarding operations, must be specified. shaping and forwarding operations, must be specified.
4.3. Centralized Path Computation and Installation 3.3. Centralized Path Computation and Installation
A centralized routing model, such as provided with a PCE, enables A centralized routing model, such as provided with a PCE, enables
global and per-flow optimizations. The model is attractive but a global and per-flow optimizations. The model is attractive but a
number of issues are left to be solved. In particular: number of issues are left to be solved. In particular:
o whether and how the path computation can be installed by 1) an end o whether and how the path computation can be installed by 1) an end
device or 2) a Network Management entity, device or 2) a Network Management entity,
o and how the path is set up, either by installing state at each hop o and how the path is set up, either by installing state at each hop
with a direct interaction between the forwarding device and the with a direct interaction between the forwarding device and the
skipping to change at page 7, line 38 skipping to change at page 7, line 28
o support for adaptability to cope with various events such as loss o support for adaptability to cope with various events such as loss
of a link, etc... of a link, etc...
o expose the status of the path to the end devices (UNI interface) o expose the status of the path to the end devices (UNI interface)
o provide additional reliability through redundancy, in particular o provide additional reliability through redundancy, in particular
with packet replication and elimination; with packet replication and elimination;
o indicate the flows and packet sequences in-band with the flows; o indicate the flows and packet sequences in-band with the flows;
4.4. Distributed Path Setup 3.4. Distributed Path Setup
Whether a distributed alternative without a PCE can be valuable could Whether a distributed alternative without a PCE can be valuable could
be studied as well. Such an alternative could for instance inherit be studied as well. Such an alternative could for instance inherit
from the Resource ReSerVation Protocol [RFC3209] (RSVP-TE) flows. from the Resource ReSerVation Protocol [RFC3209] (RSVP-TE) flows.
But the focus of the work should be to deliver the centralized But the focus of the work should be to deliver the centralized
approach first. approach first.
To enable a RSVP-TE like functionality, the following steps would To enable a RSVP-TE like functionality, the following steps would
take place: take place:
skipping to change at page 8, line 15 skipping to change at page 8, line 5
2. A constrained path is calculated with an improved version of CSPF 2. A constrained path is calculated with an improved version of CSPF
that is aware of DetNet. that is aware of DetNet.
3. The path is installed using RSVP-TE, associated with flow 3. The path is installed using RSVP-TE, associated with flow
identification, per-hop behavior such as replication and identification, per-hop behavior such as replication and
elimination, blocked resources, and flow timing information. elimination, blocked resources, and flow timing information.
4. Traffic flows are transported through the MPLS-TE tunnel, using 4. Traffic flows are transported through the MPLS-TE tunnel, using
the reserved resources for this flow at each hop. the reserved resources for this flow at each hop.
4.5. Duplicated data format 3.5. Duplicated data format
In some cases the duplication and elimination of packets over non- In some cases the duplication and elimination of packets over non-
congruent paths is required to achieve a sufficiently high delivery congruent paths is required to achieve a sufficiently high delivery
ratio to meet application needs. In these cases, a small number of ratio to meet application needs. In these cases, a small number of
packet formats and supporting protocols are required (preferably, packet formats and supporting protocols are required (preferably,
just one) to serialize the packets of a DetNet stream at one point in just one) to serialize the packets of a DetNet stream at one point in
the network, replicate them at one or more points in the network, and the network, replicate them at one or more points in the network, and
discard duplicates at one or more other points in the network, discard duplicates at one or more other points in the network,
including perhaps the destination host. Using an existing solution including perhaps the destination host. Using an existing solution
would be preferable to inventing a new one. would be preferable to inventing a new one.
5. Security Considerations 4. Security Considerations
Security in the context of Deterministic Networking has an added Security in the context of Deterministic Networking has an added
dimension; the time of delivery of a packet can be just as important dimension; the time of delivery of a packet can be just as important
as the contents of the packet, itself. A man-in-the-middle attack, as the contents of the packet, itself. A man-in-the-middle attack,
for example, can impose, and then systematically adjust, additional for example, can impose, and then systematically adjust, additional
delays into a link, and thus disrupt or subvert a real-time delays into a link, and thus disrupt or subvert a real-time
application without having to crack any encryption methods employed. application without having to crack any encryption methods employed.
See [RFC7384] for an exploration of this issue in a related context. See [RFC7384] for an exploration of this issue in a related context.
Typical control networks today rely on complete physical isolation to Typical control networks today rely on complete physical isolation to
skipping to change at page 9, line 14 skipping to change at page 9, line 5
o the protection of the signaling protocol o the protection of the signaling protocol
o the authentication and authorization of the controlling nodes o the authentication and authorization of the controlling nodes
o the identification and shaping of the flows o the identification and shaping of the flows
o the isolation of flows from leakage and other influences from any o the isolation of flows from leakage and other influences from any
activity sharing physical resources. activity sharing physical resources.
6. IANA Considerations 5. IANA Considerations
This document does not require an action from IANA. This document does not require an action from IANA.
7. Acknowledgments 6. Acknowledgments
The authors wish to thank Lou Berger, Jouni Korhonen, Erik Nordmark, The authors wish to thank Lou Berger, Jouni Korhonen, Erik Nordmark,
George Swallow, Rudy Klecka, Anca Zamfir, David Black, Thomas George Swallow, Rudy Klecka, Anca Zamfir, David Black, Thomas
Watteyne, Shitanshu Shah, Craig Gunther, Rodney Cummings, Wilfried Watteyne, Shitanshu Shah, Craig Gunther, Rodney Cummings, Wilfried
Steiner, Marcel Kiessling, Karl Weber, Ethan Grossman, Patrick Steiner, Marcel Kiessling, Karl Weber, Ethan Grossman, Patrick
Wetterwald, Subha Dhesikan, Rudy Klecka and Pat Thaler for their Wetterwald, Subha Dhesikan, Rudy Klecka and Pat Thaler for their
various contribution to this work. various contribution to this work.
8. References 7. Informative References
8.1. Normative References
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997,
<http://www.rfc-editor.org/info/rfc2119>.
8.2. Informative References
[AVnu] http://www.avnu.org/, "The AVnu Alliance tests and [AVnu] http://www.avnu.org/, "The AVnu Alliance tests and
certifies devices for interoperability, providing a simple certifies devices for interoperability, providing a simple
and reliable networking solution for AV network and reliable networking solution for AV network
implementation based on the IEEE Audio Video Bridging implementation based on the IEEE Audio Video Bridging
(AVB) and Time-Sensitive Networking (TSN) standards.". (AVB) and Time-Sensitive Networking (TSN) standards.".
[CCAMP] IETF, "Common Control and Measurement Plane",
<https://datatracker.ietf.org/doc/charter-ietf-ccamp/>.
[EIP] http://www.odva.org/, "EtherNet/IP provides users with the [EIP] http://www.odva.org/, "EtherNet/IP provides users with the
network tools to deploy standard Ethernet technology (IEEE network tools to deploy standard Ethernet technology (IEEE
802.3 combined with the TCP/IP Suite) for industrial 802.3 combined with the TCP/IP Suite) for industrial
automation applications while enabling Internet and automation applications while enabling Internet and
enterprise connectivity data anytime, anywhere.", enterprise connectivity data anytime, anywhere.",
<http://www.odva.org/Portals/0/Library/ <http://www.odva.org/Portals/0/Library/
Publications_Numbered/ Publications_Numbered/
PUB00138R3_CIP_Adv_Tech_Series_EtherNetIP.pdf>. PUB00138R3_CIP_Adv_Tech_Series_EtherNetIP.pdf>.
[HART] www.hartcomm.org, "Highway Addressable Remote Transducer, [HART] www.hartcomm.org, "Highway Addressable Remote Transducer,
a group of specifications for industrial process and a group of specifications for industrial process and
control devices administered by the HART Foundation". control devices administered by the HART Foundation".
[I-D.finn-detnet-architecture] [I-D.ietf-detnet-use-cases]
Finn, N., Thubert, P., and M. Teener, "Deterministic
Networking Architecture", draft-finn-detnet-
architecture-04 (work in progress), March 2016.
[I-D.grossman-detnet-use-cases]
Grossman, E., Gunther, C., Thubert, P., Wetterwald, P., Grossman, E., Gunther, C., Thubert, P., Wetterwald, P.,
Raymond, J., Korhonen, J., Kaneko, Y., Das, S., and Y. Raymond, J., Korhonen, J., Kaneko, Y., Das, S., Zha, Y.,
Zha, "Deterministic Networking Use Cases", draft-grossman- Varga, B., Farkas, J., Goetz, F., and J. Schmitt,
detnet-use-cases-01 (work in progress), November 2015. "Deterministic Networking Use Cases", draft-ietf-detnet-
use-cases-10 (work in progress), July 2016.
[I-D.ietf-6tisch-architecture]
Thubert, P., "An Architecture for IPv6 over the TSCH mode
of IEEE 802.15.4", draft-ietf-6tisch-architecture-09 (work
in progress), November 2015.
[I-D.ietf-roll-rpl-industrial-applicability]
Phinney, T., Thubert, P., and R. Assimiti, "RPL
applicability in industrial networks", draft-ietf-roll-
rpl-industrial-applicability-02 (work in progress),
October 2013.
[I-D.ietf-teas-yang-te-topo]
Liu, X., Bryskin, I., Beeram, V., Saad, T., Shah, H., and
O. Dios, "YANG Data Model for TE Topologies", draft-ietf-
teas-yang-te-topo-04 (work in progress), March 2016.
[I-D.svshah-tsvwg-deterministic-forwarding]
Shah, S. and P. Thubert, "Deterministic Forwarding PHB",
draft-svshah-tsvwg-deterministic-forwarding-04 (work in
progress), August 2015.
[I-D.zhao-pce-pcep-extension-for-pce-controller]
Zhao, Q., Li, Z., Dhody, D., and C. Zhou, "PCEP Procedures
and Protocol Extensions for Using PCE as a Central
Controller (PCECC) of LSPs", draft-zhao-pce-pcep-
extension-for-pce-controller-03 (work in progress), March
2016.
[IEC62439] [IEC62439]
IEC, "Industrial communication networks - High IEC, "Industrial communication networks - High
availability automation networks - Part 3: Parallel availability automation networks - Part 3: Parallel
Redundancy Protocol (PRP) and High-availability Seamless Redundancy Protocol (PRP) and High-availability Seamless
Redundancy (HSR) - IEC62439-3", 2012, Redundancy (HSR) - IEC62439-3", 2012,
<https://webstore.iec.ch/publication/7018>. <https://webstore.iec.ch/publication/7018>.
[IEEE802.1AS-2011]
IEEE, "Timing and Synchronizations (IEEE 802.1AS-2011)",
2011, <http://standards.ieee.org/getieee802/
download/802.1AS-2011.pdf>.
[IEEE802.1BA-2011]
IEEE, "AVB Systems (IEEE 802.1BA-2011)", 2011,
<http://standards.ieee.org/getieee802/
download/802.1BA-2011.pdf>.
[IEEE802.1Q-2011]
IEEE, "MAC Bridges and VLANs (IEEE 802.1Q-2011", 2011,
<http://standards.ieee.org/getieee802/
download/802.1Q-2011.pdf>.
[IEEE802.1Qat-2010]
IEEE, "Stream Reservation Protocol (IEEE 802.1Qat-2010)",
2010, <http://standards.ieee.org/getieee802/
download/802.1Qat-2010.pdf>.
[IEEE802.1Qav]
IEEE, "Forwarding and Queuing (IEEE 802.1Qav-2009)", 2009,
<http://standards.ieee.org/getieee802/
download/802.1Qav-2009.pdf>.
[IEEE802.1TSNTG] [IEEE802.1TSNTG]
IEEE Standards Association, "IEEE 802.1 Time-Sensitive IEEE Standards Association, "IEEE 802.1 Time-Sensitive
Networks Task Group", 2013, Networks Task Group", 2013,
<http://www.ieee802.org/1/pages/avbridges.html>. <http://www.ieee802.org/1/pages/avbridges.html>.
[IEEE802154]
IEEE standard for Information Technology, "IEEE std.
802.15.4, Part. 15.4: Wireless Medium Access Control (MAC)
and Physical Layer (PHY) Specifications for Low-Rate
Wireless Personal Area Networks".
[IEEE802154e]
IEEE standard for Information Technology, "IEEE std.
802.15.4e, Part. 15.4: Low-Rate Wireless Personal Area
Networks (LR-WPANs) Amendment 1: MAC sublayer", April
2012.
[ISA100.11a] [ISA100.11a]
ISA/IEC, "ISA100.11a, Wireless Systems for Automation, ISA/IEC, "ISA100.11a, Wireless Systems for Automation,
also IEC 62734", 2011, < http://www.isa100wci.org/en- also IEC 62734", 2011, < http://www.isa100wci.org/en-
US/Documents/PDF/3405-ISA100-WirelessSystems-Future-broch- US/Documents/PDF/3405-ISA100-WirelessSystems-Future-broch-
WEB-ETSI.aspx>. WEB-ETSI.aspx>.
[ISA95] ANSI/ISA, "Enterprise-Control System Integration Part 1: [ISA95] ANSI/ISA, "Enterprise-Control System Integration Part 1:
Models and Terminology", 2000, <https://www.isa.org/ Models and Terminology", 2000, <https://www.isa.org/
isa95/>. isa95/>.
[MPLS] IETF, "Multiprotocol Label Switching",
<https://datatracker.ietf.org/doc/charter-ietf-mpls/>.
[ODVA] http://www.odva.org/, "The organization that supports [ODVA] http://www.odva.org/, "The organization that supports
network technologies built on the Common Industrial network technologies built on the Common Industrial
Protocol (CIP) including EtherNet/IP.". Protocol (CIP) including EtherNet/IP.".
[PCE] IETF, "Path Computation Element",
<https://datatracker.ietf.org/doc/charter-ietf-pce/>.
[Profinet] [Profinet]
http://us.profinet.com/technology/profinet/, "PROFINET is http://us.profinet.com/technology/profinet/, "PROFINET is
a standard for industrial networking in automation.", a standard for industrial networking in automation.",
<http://us.profinet.com/technology/profinet/>. <http://us.profinet.com/technology/profinet/>.
[RFC2547] Rosen, E. and Y. Rekhter, "BGP/MPLS VPNs", RFC 2547,
DOI 10.17487/RFC2547, March 1999,
<http://www.rfc-editor.org/info/rfc2547>.
[RFC2702] Awduche, D., Malcolm, J., Agogbua, J., O'Dell, M., and J.
McManus, "Requirements for Traffic Engineering Over MPLS",
RFC 2702, DOI 10.17487/RFC2702, September 1999,
<http://www.rfc-editor.org/info/rfc2702>.
[RFC3031] Rosen, E., Viswanathan, A., and R. Callon, "Multiprotocol
Label Switching Architecture", RFC 3031,
DOI 10.17487/RFC3031, January 2001,
<http://www.rfc-editor.org/info/rfc3031>.
[RFC3209] Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., [RFC3209] Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V.,
and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP and G. Swallow, "RSVP-TE: Extensions to RSVP for LSP
Tunnels", RFC 3209, DOI 10.17487/RFC3209, December 2001, Tunnels", RFC 3209, DOI 10.17487/RFC3209, December 2001,
<http://www.rfc-editor.org/info/rfc3209>. <http://www.rfc-editor.org/info/rfc3209>.
[RFC3272] Awduche, D., Chiu, A., Elwalid, A., Widjaja, I., and X.
Xiao, "Overview and Principles of Internet Traffic
Engineering", RFC 3272, DOI 10.17487/RFC3272, May 2002,
<http://www.rfc-editor.org/info/rfc3272>.
[RFC3630] Katz, D., Kompella, K., and D. Yeung, "Traffic Engineering
(TE) Extensions to OSPF Version 2", RFC 3630,
DOI 10.17487/RFC3630, September 2003,
<http://www.rfc-editor.org/info/rfc3630>.
[RFC3945] Mannie, E., Ed., "Generalized Multi-Protocol Label
Switching (GMPLS) Architecture", RFC 3945,
DOI 10.17487/RFC3945, October 2004,
<http://www.rfc-editor.org/info/rfc3945>.
[RFC3985] Bryant, S., Ed. and P. Pate, Ed., "Pseudo Wire Emulation
Edge-to-Edge (PWE3) Architecture", RFC 3985,
DOI 10.17487/RFC3985, March 2005,
<http://www.rfc-editor.org/info/rfc3985>.
[RFC4203] Kompella, K., Ed. and Y. Rekhter, Ed., "OSPF Extensions in
Support of Generalized Multi-Protocol Label Switching
(GMPLS)", RFC 4203, DOI 10.17487/RFC4203, October 2005,
<http://www.rfc-editor.org/info/rfc4203>.
[RFC4655] Farrel, A., Vasseur, J., and J. Ash, "A Path Computation
Element (PCE)-Based Architecture", RFC 4655,
DOI 10.17487/RFC4655, August 2006,
<http://www.rfc-editor.org/info/rfc4655>.
[RFC4664] Andersson, L., Ed. and E. Rosen, Ed., "Framework for Layer
2 Virtual Private Networks (L2VPNs)", RFC 4664,
DOI 10.17487/RFC4664, September 2006,
<http://www.rfc-editor.org/info/rfc4664>.
[RFC5127] Chan, K., Babiarz, J., and F. Baker, "Aggregation of
Diffserv Service Classes", RFC 5127, DOI 10.17487/RFC5127,
February 2008, <http://www.rfc-editor.org/info/rfc5127>.
[RFC5151] Farrel, A., Ed., Ayyangar, A., and JP. Vasseur, "Inter-
Domain MPLS and GMPLS Traffic Engineering -- Resource
Reservation Protocol-Traffic Engineering (RSVP-TE)
Extensions", RFC 5151, DOI 10.17487/RFC5151, February
2008, <http://www.rfc-editor.org/info/rfc5151>.
[RFC5305] Li, T. and H. Smit, "IS-IS Extensions for Traffic
Engineering", RFC 5305, DOI 10.17487/RFC5305, October
2008, <http://www.rfc-editor.org/info/rfc5305>.
[RFC5329] Ishiguro, K., Manral, V., Davey, A., and A. Lindem, Ed.,
"Traffic Engineering Extensions to OSPF Version 3",
RFC 5329, DOI 10.17487/RFC5329, September 2008,
<http://www.rfc-editor.org/info/rfc5329>.
[RFC5440] Vasseur, JP., Ed. and JL. Le Roux, Ed., "Path Computation
Element (PCE) Communication Protocol (PCEP)", RFC 5440,
DOI 10.17487/RFC5440, March 2009,
<http://www.rfc-editor.org/info/rfc5440>.
[RFC5673] Pister, K., Ed., Thubert, P., Ed., Dwars, S., and T.
Phinney, "Industrial Routing Requirements in Low-Power and
Lossy Networks", RFC 5673, DOI 10.17487/RFC5673, October
2009, <http://www.rfc-editor.org/info/rfc5673>.
[RFC7384] Mizrahi, T., "Security Requirements of Time Protocols in [RFC7384] Mizrahi, T., "Security Requirements of Time Protocols in
Packet Switched Networks", RFC 7384, DOI 10.17487/RFC7384, Packet Switched Networks", RFC 7384, DOI 10.17487/RFC7384,
October 2014, <http://www.rfc-editor.org/info/rfc7384>. October 2014, <http://www.rfc-editor.org/info/rfc7384>.
[RFC7426] Haleplidis, E., Ed., Pentikousis, K., Ed., Denazis, S.,
Hadi Salim, J., Meyer, D., and O. Koufopavlou, "Software-
Defined Networking (SDN): Layers and Architecture
Terminology", RFC 7426, DOI 10.17487/RFC7426, January
2015, <http://www.rfc-editor.org/info/rfc7426>.
[RFC7554] Watteyne, T., Ed., Palattella, M., and L. Grieco, "Using
IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) in the
Internet of Things (IoT): Problem Statement", RFC 7554,
DOI 10.17487/RFC7554, May 2015,
<http://www.rfc-editor.org/info/rfc7554>.
[TEAS] IETF, "Traffic Engineering Architecture and Signaling",
<https://datatracker.ietf.org/doc/charter-ietf-teas/>.
[TiSCH] IETF, "IPv6 over the TSCH mode over 802.15.4",
<https://datatracker.ietf.org/doc/charter-ietf-6tisch/>.
[WirelessHART] [WirelessHART]
www.hartcomm.org, "Industrial Communication Networks - www.hartcomm.org, "Industrial Communication Networks -
Wireless Communication Network and Communication Profiles Wireless Communication Network and Communication Profiles
- WirelessHART - IEC 62591", 2010. - WirelessHART - IEC 62591", 2010.
Authors' Addresses Authors' Addresses
Norman Finn
Self-employed
1807 Santa Rita Rd
Suite D, PMB 345
Pleasanton, California 94566
US
Norm Finn Phone: +1 925 980 6430
Cisco Systems Email: nfinn@alumni.caltech.edu
510 McCarthy Blvd
SJ-24
Milpitas, California 95035
USA
Phone: +1 408 526 4495
Email: nfinn@cisco.com
Pascal Thubert Pascal Thubert
Cisco Systems Cisco Systems
Village d'Entreprises Green Side Village d'Entreprises Green Side
400, Avenue de Roumanille 400, Avenue de Roumanille
Batiment T3 Batiment T3
Biot - Sophia Antipolis 06410 Biot - Sophia Antipolis 06410
FRANCE FRANCE
Phone: +33 4 97 23 26 34 Phone: +33 4 97 23 26 34
 End of changes. 29 change blocks. 
241 lines changed or deleted 50 lines changed or added

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