6TiSCH MR. Palattella, Ed. Internet-DraftSnT/Univ. of LuxembourgLIST Intended status: Informational P. Thubert Expires:September 22, 2016June 19, 2017 cisco T. Watteyne Linear Technology / Dust Networks Q. Wang Univ. of Sci. and Tech. BeijingMarch 21,December 16, 2016 Terminology in IPv6 over the TSCH mode of IEEE 802.15.4edraft-ietf-6tisch-terminology-07draft-ietf-6tisch-terminology-08 Abstract6TiSCH proposes an architecture for an IPv6 multi-link subnet that is composed of a high speed powered backbone andThis document provides anumberglossary ofIEEE802.15.4eterminology used in IPv6 over the TSCHwireless networks attached and synchronized by backbone routers.mode of IEEE 802.15.4e (6TiSCH). This document extends existing terminology documentsavailablefor Low-power and LossyNetworks to provide additional terminology elements. Requirements Language The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119 [RFC2119].Networks. Status of This Memo This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79. Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at http://datatracker.ietf.org/drafts/current/. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." This Internet-Draft will expire onSeptember 22, 2016.June 19, 2017. Copyright Notice Copyright (c) 2016 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (http://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License. Table of Contents 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 2 3.IANA Considerations . . . . . . . . . . . . . . . . . . . . . 10 4.Security Considerations . . . . . . . . . . . . . . . . . . .10 5. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 11 6.8 4. References . . . . . . . . . . . . . . . . . . . . . . . . .11 6.1.8 4.1. Normative References . . . . . . . . . . . . . . . . . .11 6.2.8 4.2. Informative References . . . . . . . . . . . . . . . . .12 6.3.9 4.3. External Informative References . . . . . . . . . . . . .1310 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . .1310 1. Introduction The IEEE802.15.4 Medium Access Control (MAC) has evolved withIEEE802.15.4e which provides in particularthe Time Slotted Channel Hopping (TSCH) mode for industrial-type applications. It provides deterministic capabilities to the point that a packet that pertains to a certain flow crosses the network from node to node following a very precise schedule, like a train leaves intermediate stations at precise times along its path. This document provides additional terminology elements to cover terms that are new to the context of TSCH wireless networks and other deterministic networks. 2. Terminology The draft extends[I-D.ietf-roll-terminology][RFC7102] and use terms fromRFC 6550[RFC6550] andRFC 6552[RFC6552], which are all included here by reference. The draft does not reuse terms from IEEE802.15.4e such as "path" or "link" which bear a meaning that is quite different from classical IETF parlance. This document adds the following terms: 6TiSCH: IPv6 over the Timeslotted Channel Hopping (TSCH) mode of IEEE802.15.4e. It defines(i)the(i) the 6top sublayer; (ii) a set of protocols for setting up a TSCH schedulewith a centralized and/orin distributed approach, for managing the allocation of resources; and (iii) the architecture to bind them together, for use in IPv6 TSCH based networks.6F: IPv6 Forwarding. One of the three forwarding models supported by 6TiSCH. Packets are routed at layer 3, where Quality of Service (QoS) and Active Queue Management (e.g., Random Early Detection, RED, [RFC2309]) operations are expected to prioritize flows with differentiated services.6top: The "6TiSCH Operation Sublayer" (6top) is the next highest layer of the IEEE802.15.4e TSCH medium access controllayer in the 6TiSCH Architecture.layer. It implements and terminates the "6top Protocol" (6P), and containsone or morea "6top Scheduling Function" (SF).It is defined in [I-D.wang-6tisch-6top-protocol]. 6top Data Convey Model: Model describing how the 6top adaptation layer feeds the data flow coming from upper layers into TSCH. It is composed by an I-MUX module, a MUX module, a set of priority queues, and a PDU (Payload Data Unit). See [I-D.wang-6tisch-6top-protocol].SF: The "6top Scheduling Function" (SF)is"is the cell management entity that add or delete cells dynamically based on its allocation policyinside the "6TiSCH Operation Sublayer" (6top) which decides whenin order toadd/remove cells.fulfill cell requirements. The cell negotiation with a neighbor is done using 6P. General guidelines for designing a SF are provided in[I-D.wang-6tisch-6top-protocol].[I-D.ietf-6tisch-6top-protocol]. SFID: The "6top Scheduling Function Identifier" (SFID) is a1-byte4-bit field identifying a SF.It is definedDefined in[I-D.wang-6tisch-6top-protocol].[I-D.ietf-6tisch-6top-protocol]. 6P: The "6top Protocol" (6P) allows neighbor nodes to communicate to add/delete cells to one another in their TSCH schedule.It is definedDefined in[I-D.wang-6tisch-6top-protocol].[I-D.ietf-6tisch-6top-protocol]. 6P Transaction: Part of the "6top Protocol" (6P),it consists in a complete negotiation between two neighbor nodes. A transaction starts when a node wishes to add/delete one or more cells to one of its neighbors; it ends whenthecell(s) have been added / deleted from the scheduleaction ofboth neighbor, or when the transaction has failed. It is defined in [I-D.wang-6tisch-6top-protocol]. ARO: [RFC6775] definestwo neighbors exchanging anumber of new Neighbor Discovery options including6P request message and theAddress Registration Option (ARO).corresponding 6P response message. Defined in [I-D.ietf-6tisch-6top-protocol]. ASN: Absolute Slot Number, the total number of timeslots thathashave elapsed since the PAN coordinator has started the TSCH network.It is incrementedIncremented by one at each timeslot. It is wide enough to not roll over in practice. See[IEEE802154e].[IEEE802154-2015] and [RFC7554]. Blacklist of Frequencies:Simply defined Blacklist in [IEEE802154e], it is theA set of frequenciesamong the 16 available ones,which should not be used for communication. See [IEEE802154-2015] and [RFC7554]. BBR: Backbone Router. In the 6TiSCH architecture,it isan LBR and also a IPv6 ND-efficiency-aware Router (NEAR) [I-D.chakrabarti-nordmark-6man-efficient-nd].It performsPerforms ND proxy operations between registered devices and classical ND devices that are located over the backbone. Broadcast Cell: A scheduled cell used for broadcast transmission. Bundle: A group of equivalent scheduled cells, i.e. cells identified by different [slotOffset, channelOffset], which are scheduled for a same purpose, with the same neighbor, with the same flags, and the same slotframe. The size of the bundle refers to the number of cells it contains.Given the length of the slotframe,For a given slotframe length, the size of the bundle translates directly into bandwidth. A bundle is a local abstraction thar represents a half-duplex linkbetween nodes, one transmitter and onefor either sending ormore receivers,receiving, withabandwidth thatamountamounts to the sum of the cells in the bundle. A bundle is globally identified by (source MAC, destination MAC, TrackID). At Layer33, a pair of bundles forms a link. Byusiningusing a well-known constant, NULLT, as TrackId for a L3 link, the IP link between adjacent nodes A and B comprises 2 bundles: (macA, macB, NULLT) and (macB, macA, NULLT). AtL2Layer 2, a pair of bundles forms a switching state. Considered a segment A-B-C along a track, there are two bundles in node B, one incoming = (macA, macB, trackId) and one outgoing = (macB, macC, trackId). CCA: Clear Channel Assessment. Mechanism defined in [IEEE802154-2015], section 6.2.5.2. In a TSCH network, CCA can be used to detect other radio networks in vicinity. Nodes listen the channel before sending, to detect other ongoing transmissions. Because the network is synchronized, CCA cannot be used to detect colliding transmission within the same network. CCA is necessary for the 6TiSCH minimal configuration [I-D.ietf-6tisch-minimal] in shared slots, and in presence of multiple instances of 6TiSCH networks. Cell: A single element in the TSCH schedule, identified by a slotOffset, a channelOffset, a slotframeHandle. A cell can be scheduled or unscheduled. Centralized Cell Reservation: A reservation of a cell done by a centralized entity (e.g., a PCE) in the network. Centralized Track Reservation: A reservation of a track done by a centralized entity (e.g., a PCE) in the network. ChannelOffset: Identifies a row in the TSCH schedule. The number of availablechannelOffsetschannelOffset values is equal to the number of available frequencies. The channelOffset translates into a frequency when the communication takes place, resulting in channelhopping, as detailed inhopping. See [RFC7554]. Channel Distribution/Usage (CDU) matrix: : Matrix of cells (i,j) representing the spectrum (channel) distribution among the different nodes in the 6TiSCH network. The CDU matrix has width in timeslots, equal to the period of the network scheduling operation, and height equal to the number of available channels. Every cell (i,j) in the CDU, identified by (slotOffset, channelOffset), belongs to a specific chunk. It has to be noticed that such a matrix which includes all the cells grouped in chunks, belonging to different slotframes, is different from the TSCH schedule. Chunk: A well-known list of cells, distributed in time and frequency, within a CDU matrix; a chunk represents a portion of a CDU matrix. The partition of the CDU in chunks is globally known by all the nodes in the network to support the appropriation process, which is a negotiation between nodes within an interference domain. A node that manages to appropriate a chunk gets to decide which transmissions will occur over the cells in the chunk within its interference domain (i.e., a parent node will decide when the cells within the appropriated chunk are used and by which node, among itschildren.) Communication Paradigm: It is Associated with the Information Model [RFC3444] of the state that is exchanged, and indicates: the location of that state (e.g., centralized vs. distributed, RESTful, etc.), the numbers of parties (e.g., point to point, P2P, vs. point to multi-point, P2MP) and the relationship between parties (e.g., master/ slave vs. peers) at a high level of protocol abstraction. Layer 5 client/server REST is a typical communication paradigm, but industrial protocols also use publish/ subscribe which is P2MP and source/sink which is multi- point to multi-point (MP2MP) and primarily used for alarms and alerts at the application layer. At layer 3, basic flooding, P2P synchronization and path-marking (RSVP-like) are commonly used paradigms, whereas at layer 2, master/slave polling and peer-to-peer forwarding are classical examples. DAR/DAC: [RFC6775] defines the Duplicate Address Request (DAR) and Duplicate Address Confirmation (DAC) options to turn the multicast Duplicate Address Detection protocol into a unicast-based multi-hop process between routers and the backbone router.children. Dedicated Cell: A cell that is reserved for a given node to transmit to a specific neighbor. Deterministic Network:A Deterministic Network supports traffic flows with communication patterns that are known a priori. Thus, routing paths and communication schedules can be computed in advance,The generic concept of deterministic network is defined ina fashion similar[I-D.ietf-detnet-architecture]. When applied toa railway system,6TiSCH it refers toavoid losses duethe reservation of tracks which guarantee an end topacket collisions,end latency andto perform global optimizations across multiple flows. A deterministic network can allocates the required resources (buffers, processors, medium access) alongoptimize themulti-hop routing path at the precise moment the resources are needed.PDR for well-characterized flows. Distributed Cell Reservation: A reservation of a cell done by one or more in-network entities (typically a connection endpoint). Distributed Track Reservation: A reservation of a track done by one or more in-network entities (typically a connection endpoint).EARO: [I-D.thubert-6lo-rfc6775-update-reqs] extends the ARO option to include some additional fields necessary to distinguish duplicate addresses from nodes that have moved networks when there are mulitple LLNs linked over a backbone.EB: Enhanced Beacon frame used by a node to announce the presence of the network. It containsusefulenough information(see [IEEE802154e]fordetails) that allowanewjoining node tosynhronize and join the network. FF: 6LoWPAN Fragment Forwarding. It is one of the three forwarding models supported by 6TiSCH. The 6LoWPAN Fragment is used as a label for switching at the 6LoWPAN sublayer, as defined in [I-D.thubert-roll-forwarding-frags]. GMPLS: Generalized Multi-Protocol Label Switching, a 2.5 layer service that is usedsynchronize toforward packets based ontheconcept of generalized labels.network. See [IEEE802154-2015] and [RFC7554]. Hard Cell: A scheduled cell which the 6top sublayer cannotreallocate. See [I-D.wang-6tisch-6top-protocol].relocate. Hopping Sequence: Ordered sequence of frequencies, identified by a Hopping_Sequence_ID, used for channel hopping, when translating the channel offset value into a frequency (i.e., PHY channel). See[IEEE802154e][IEEE802154-2015] and [RFC7554]. IE: InformationElements,Element, alist ofType-Length-Value containers placed at the end of the MAC header, used to pass data between layers or devices.A small number of typesSome IE identifiers aredefinedmanaged by[IEEE802154e], but a range of types is available for extensions, and thus, is exploitable by 6TiSCH. See [IEEE802154e]. I-MUX module: Inverse-Multiplexer, a classifier that receives 6LoWPAN frames and places them into priority queues. See [I-D.wang-6tisch-6top-protocol]. Interaction Model: It is a particular way of implementing a communication paradigm. Defined at a lower level of abstraction, it includes protocol-specific details such as a particular method (e.g., a REST GET) and a Data Model for the state to be exchanged. Interference Domain: The Interference Domain of a given (transmitter) node A includes all the nodes in its neighbourhood that can generate interference at its receiver B, when transmitting onthesame channel (i.e., usingIEEE [IEEE802154-2015]. Some IE identifiers are managed by thesame frequency).IETF [I-D.kivinen-802-15-ie]. JCE: The Join Coordination Entity (JCE) is a central entitylike the Path Computation Element (PCE),thatmay assist in several aspectscoordinates the joining of new nodes in thejoin protocol, such as authentication, authorization,network. See [I-D.ietf-6tisch-minimal-security] andconfiguration.[I-D.ietf-6tisch-dtsecurity-secure-join]. JA: The Join Assistant (JA) is a one-hop neighbor of a joining node that may facilitate it to become meaningful part of the network (e.g., by serving as a local connectivity point to the remainder of the network). JA emits EBs, used by JNs to synchronize to the network. See [I-D.ietf-6tisch-minimal-security] and [I-D.ietf-6tisch-dtsecurity-secure-join]. JN: The Joining Node (JN) is a device attempting to join a particular 6TiSCH network. See [I-D.ietf-6tisch-minimal-security]. Join Protocol: The protocol which secures initial communication between a joining node and the JCE. LBR: Low-power Lossy Network (LLN) Border Router. It is an LLN device, usually powered, that acts as a Border Router to the outside within the 6TiSCH architecture. Link: A communication facility or medium over which nodes can communicate at the link layer, i.e., the layer immediately below IP. Thus, the IETF parlance for the term "Link" is adopted, as opposed to the IEEE802.15.4e terminology.In the context of the 6TiSCH architecture, which applies to Low Power Lossy Networks (LLNs), an IPv6 subnet is usually not congruent to a single link and techniques such as IPv6 Neighbor Discovery Proxying are used to achieve reachability within the multilink subnet. A link is distinct from a track. In fact, link local addresses are not expected to be used over a track for end to end communication. Finally, from the Layer 3 perspective (where the inner complexities of TSCH operations are hidden to enable classical IP routing and forwarding), a single radio interface may be seen as a number of Links with different capabilities for unicast or multicast services. MAC: Medium Access Control. MUX Module: Multiplexer, the entity that dequeues frames from priority queues and associates them to a cell for transmission. See [I-D.wang-6tisch-6top-sublayer]. NEAR: IPv6 ND-efficiency-aware Router, as defined in [I-D.chakrabarti-nordmark-6man-efficient-nd]. NME: Network Management Entity, the entity in the network managing cells and other device resources. It may cooperate with the PCE. It interacts with LLN nodes through the backbone router.Operational Network: A IEEE802.15.4e network whose encryption/ authentication keys are determined by some algorithms/ protocols. There may be network-wide group keys, or per- link keys.Operational Network Key: A Link-layer key known by all authorized nodes, used for multicast messages. PCE: Path Computation Element, the entity in the network which is responsible for building and maintaining the TSCH schedule, when centralized scheduling is used. QoS: Quality of Service.(to)ReallocateRelocate a Cell: The action operated by the 6top sublayer of changing the slotOffset and/or channelOffset of a soft cell. (to) Schedule a Cell: The action of turning an unscheduled cell into a scheduled cell. Scheduled cell: A cell which is assigned a neighbor MAC address (broadcast address is also possible), and one or more of the following flags: TX, RX, shared, timeskeeping. A scheduled cell can be used by the IEEE802.15.4e TSCH implementation to communicate. A scheduled cell can be either a hard or a soft cell. Shared Cell: A cell marked with both the "TX" and "shared" flags. This cell can be used by more than one transmitter node. Abackoffback-off algorithm is used to resolve contention. See [IEEE802154-2015] and [RFC7554]. SlotOffset: Identifies a column in the TSCH schedule, i.e., the number of timeslots since the beginning of the current iteration of the slotframe. See [IEEE802154-2015] and [RFC7554]. Slotframe: AMAC-level abstraction that is internal to the node and contains a seriescollection of timeslots repeating in time, analogous to a superframe in that it defines periods ofequal length and priority.communication opportunities. It is characterized by a slotframe_ID, and a slotframe_size. Multiple slotframes can coexist in a node's schedule, i.e., a node can have multiple activities scheduled in different slotframes, based on the priority of its packets/traffic flows. The timeslots in the Slotframe are indexed by the SlotOffset; the first timeslot is at SlotOffset 0. See [IEEE802154-2015] and [RFC7554]. Soft Cell: A scheduled cell which the 6top sublayer canreallocate, as described in [I-D.wang-6tisch-6top-protocol]. TF: Track Forwarding. It is the simplest and fastest forwarding model supported by 6TiSCH. It is a GMPLS-like forwarding model. The incoming bundle (and thus, the input cell) characterizes the flow and indicates the outgoing bundle (and output cell).relocate. Timeslot: A basic communication unit in TSCH which allows a transmitter node to send a frame to a receiver neighbor, and that receiver neighbor to optionally send back an acknowledgment. See [IEEE802154-2015] and [RFC7554]. Time Source Neighbor: A neighbor that a node uses as its time reference, and to which it needs to keep its clock synchronized.A node can have one or more time source neighbors.See [IEEE802154-2015] and [RFC7554]. Track: A determined sequence of cells along a multi-hop path. It is typically the result of a track reservation. The node that initializes the processforof establishing a track is the owner of the track. The latter assigns a unique identifier to the track, called TrackID. TrackID: Unique identifier of a track, assigned by the owner of the track. TSCH: Time Slotted Channel Hopping, a medium access mode of the[IEEE802154e][IEEE802154-2015] standard which uses time synchronization to achieve ultra low-power operation and channel hopping to enable high reliability. See [IEEE802154-2015] and [RFC7554]. TSCH Schedule: A matrix of cells, each cell indexed by a slotOffset and a channelOffset. The TSCH schedule contains all the scheduled cells from all slotframes and is sufficient to qualify the communication in the TSCH network. The"width of the matrix is equal to the number of scheduled timeslots in all the concurrent active slotframes. Thenumber of channelOffset values (the "height" of the matrix) is equal to the number of available frequencies. See [IEEE802154-2015] and [RFC7554]. Unscheduled Cell: A cell which is not used by the IEEE802.15.4e TSCH implementation. See [IEEE802154-2015] and [RFC7554]. 3.IANA Considerations This specification does not require IANA action. 4.Security ConsiderationsThis specification isSince this document specifies terminology and does notfound to introducespecify new procedures or protocols, it raises no new securitythreats. 5. Acknowledgments Thanks to the IoT6 European Project (STREP) of the 7th Framework Program (Grant 288445). 6.issues. 4. References6.1.4.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>.[RFC2309] Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., Peterson, L., Ramakrishnan, K., Shenker, S., Wroclawski, J., and L. Zhang, "Recommendations on Queue Management and Congestion Avoidance in the Internet", RFC 2309, DOI 10.17487/RFC2309, April 1998, <http://www.rfc-editor.org/info/rfc2309>. [RFC3444] Pras, A. and J. Schoenwaelder, "On the Difference between Information Models and Data Models", RFC 3444, DOI 10.17487/RFC3444, January 2003, <http://www.rfc-editor.org/info/rfc3444>.[RFC5191] Forsberg, D., Ohba, Y., Ed., Patil, B., Tschofenig, H., and A. Yegin, "Protocol for Carrying Authentication for Network Access (PANA)", RFC 5191, DOI 10.17487/RFC5191, May 2008, <http://www.rfc-editor.org/info/rfc5191>. [RFC6347] Rescorla, E. and N. Modadugu, "Datagram Transport Layer Security Version 1.2", RFC 6347, DOI 10.17487/RFC6347, January 2012, <http://www.rfc-editor.org/info/rfc6347>.[RFC6550] Winter, T., Ed., Thubert, P., Ed., Brandt, A., Hui, J., Kelsey, R., Levis, P., Pister, K., Struik, R., Vasseur, JP., and R. Alexander, "RPL: IPv6 Routing Protocol for Low-Power and Lossy Networks", RFC 6550, DOI 10.17487/RFC6550, March 2012, <http://www.rfc-editor.org/info/rfc6550>. [RFC6552] Thubert, P., Ed., "Objective Function Zero for the Routing Protocol for Low-Power and Lossy Networks (RPL)", RFC 6552, DOI 10.17487/RFC6552, March 2012, <http://www.rfc-editor.org/info/rfc6552>. [RFC6775] Shelby, Z., Ed., Chakrabarti, S., Nordmark, E., and C. Bormann, "Neighbor Discovery Optimization for IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs)", RFC 6775, DOI 10.17487/RFC6775, November 2012, <http://www.rfc-editor.org/info/rfc6775>.[RFC7252] Shelby, Z., Hartke, K.,[RFC7102] Vasseur, JP., "Terms Used in Routing for Low-Power andC. Bormann, "The Constrained Application Protocol (CoAP)",Lossy Networks", RFC7252,7102, DOI10.17487/RFC7252, June10.17487/RFC7102, January 2014,<http://www.rfc-editor.org/info/rfc7252>.<http://www.rfc-editor.org/info/rfc7102>. [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>.6.2.4.2. Informative References [I-D.chakrabarti-nordmark-6man-efficient-nd] Chakrabarti, S., Nordmark, E., Thubert, P., and M. Wasserman, "IPv6 Neighbor Discovery Optimizations for Wired and Wireless Networks", draft-chakrabarti-nordmark- 6man-efficient-nd-07 (work in progress), February 2015.[I-D.ietf-roll-terminology] Vasseur,[I-D.ietf-6tisch-6top-protocol] Wang, Q. and X. Vilajosana, "6top Protocol (6P)", draft- ietf-6tisch-6top-protocol-03 (work in progress), October 2016. [I-D.ietf-6tisch-dtsecurity-secure-join] Richardson, M., "6tisch Secure Join protocol", draft-ietf- 6tisch-dtsecurity-secure-join-00 (work in progress), December 2016. [I-D.ietf-6tisch-minimal] Vilajosana, X. and K. Pister, "Minimal 6TiSCH Configuration", draft-ietf-6tisch-minimal-17 (work in progress), November 2016. [I-D.ietf-6tisch-minimal-security] malisa.vucinic@st.com, m., Simon, J.,"Terms usedand K. Pister, "Minimal Security Framework for 6TiSCH", draft-ietf- 6tisch-minimal-security-00 (work inRoutingprogress), December 2016. [I-D.ietf-detnet-architecture] Finn, N. and P. Thubert, "Deterministic Networking Architecture", draft-ietf-detnet-architecture-00 (work in progress), September 2016. [I-D.kivinen-802-15-ie] Kivinen, T. and P. Kinney, "IEEE 802.15.4 Information Element forLow power And Lossy Networks", draft-ietf-roll-terminology-13IETF", draft-kivinen-802-15-ie-04 (work in progress), October2013.2016. [I-D.thubert-6lo-rfc6775-update-reqs] Thubert, P. and P. Stok, "Requirements for an update to 6LoWPAN ND",draft-thubert-6lo-rfc6775-update-reqs-06draft-thubert-6lo-rfc6775-update-reqs-07 (work in progress),January 2015.April 2016. [I-D.thubert-roll-forwarding-frags] Thubert, P. and J. Hui, "LLN Fragment Forwarding and Recovery", draft-thubert-roll-forwarding-frags-02 (work in progress), September 2013.[I-D.wang-6tisch-6top-protocol] Wang, Q. and X. Vilajosana, "6top Protocol (6P)", draft- wang-6tisch-6top-protocol-00 (work in progress), March 2016. [I-D.wang-6tisch-6top-sublayer] Wang, Q. and X. Vilajosana, "6TiSCH Operation Sublayer (6top)", draft-wang-6tisch-6top-sublayer-04 (work in progress), November 2015. 6.3.4.3. External Informative References[IEEE802154e][IEEE802154-2015] IEEE standard for Information Technology, "IEEEstd. 802.15.4e, Part. 15.4:Std 802.15.4-2015 Standard for Low-Rate Wireless Personal Area Networks(LR-WPANs) Amendment 1: MAC sublayer", April 2012.(WPANs)", December 2015. Authors' Addresses Maria Rita Palattella (editor)University ofLuxembourgInterdisciplinary Centre for Security, ReliabilityInstitute of Science andTrust 4,Technology Department 'Environmental Research and Innovation' (ERIN) 41, rueAlphonse Weicker Luxembourg L-2721du Brill Belvaux L-4422 Luxembourg Phone: (+352)46 66 44 5841275 888-5055 Email:maria-rita.palattella@uni.lumariarita.palattella@list.lu Pascal Thubert Cisco Systems, Inc Village d'Entreprises Green Side 400, Avenue de Roumanille Batiment T3 Biot - Sophia Antipolis 06410 France Phone: +33 497 23 26 34 Email: pthubert@cisco.com Thomas Watteyne Linear Technology / Dust Networks 30695 Huntwood Avenue Hayward, CA 94544 USA Phone: +1 (510) 400-2978 Email: twatteyne@linear.com Qin Wang Univ. of Sci. and Tech. Beijing 30 Xueyuan Road Beijing 100083 China Phone: +86 (10) 6233 4781 Email: wangqin@ies.ustb.edu.cn