Abstract: In one embodiment, a method comprises determining a movable network device is moving along a repeatable sequence of access point devices in a deterministic network; and establishing a deterministic track along the repeatable sequence of access point devices, the deterministic track comprising insertion slots allocated for insertion of a data packet, by the movable network device, into the deterministic track via any one of the respective access point devices.

Abstract: In one embodiment, a method comprises identifying, by a path computation element, essential parent devices from a nonstoring destination oriented directed acyclic graph (DODAG) topology as dominating set members belonging to a dominating set; receiving, by the path computation element, an advertisement message specifying a first dominating set member having reachability to a second dominating set member, the reachability distinct from the nonstoring DODAG topology; and generating, by the path computation element based on the advertisement message, an optimized path for reaching a destination network device in the nonstoring DODAG topology via a selected sequence of dominating set members, the optimized path providing cut-through optimization across the nonstoring DODAG topology.

Abstract: In one embodiment, a method comprises causing, by an apparatus, establishment of first and second multicast trees within one or more underlay switching fabrics of one or more fat tree topologies, the first and second multicast trees comprising first and second multicast roots for multicast transmission to leaf network devices in the respective first and second multicast trees; causing, by the apparatus, establishment of an overlay tunnel between the first and second multicast roots, the overlay tunnel independent and distinct from the first and second multicast trees; causing the first multicast root to multicast transmit, via the first multicast tree, a data packet having been transmitted to the first multicast root; and causing the first multicast root to unicast transmit the data packet to the second multicast root via the overlay tunnel, for multicast transmission of the data packet by the second multicast root via the second multicast tree.

Abstract: In one embodiment, a method comprises identifying within a network topology, by an apparatus, a plurality of network devices; and establishing by the apparatus, a multiple tree topology comprising a first multicast tree and a second multicast tree, the first and second multicast trees operable as redundant trees for multicast traffic in the network topology, the establishing including: allocating a first of the network devices as a corresponding root of the first multicast tree, allocating a first group of intermediate devices from the network devices as first forwarding devices in the first multicast tree, allocating a second group of intermediate devices as belonging to first leaf devices in the first multicast tree, and allocating terminal devices of the network devices as belonging to the first leaf devices, and allocating a second of the network devices as the corresponding root of the second multicast tree, allocating the second group of intermediate devices as second forwarding devices in the second mu

Abstract: In one embodiment, a method comprises identifying a fat tree network topology comprising top-of-fabric (ToF) switching devices, an intermediate layer of intermediate switching devices connected to each of the ToF switching devices, and a layer of leaf network devices; and causing a first leaf network device to initiate establishment of first and second redundant multicast trees for multicasting of data packets, including: causing first and second ToF switching devices to operate as roots of the first and second multicast trees according to first and second attribute types, respectively, causing the first leaf network device to select first and second of the intermediate switching devices as first and second flooding relays belonging to the first and second attribute types, respectively, and causing the first and second flooding relays to limit propagation of registration messages generated by the first leaf network device to the first and second ToF switching devices, respectively.

Abstract: In one embodiment, a method comprises: identifying, by a root network device of a directed acyclic graph (DAG) in a low power and lossy network, a child network device in the DAG, including identifying a first rank associated with the child network device; allocating, by the root network device, an allocated rank for the child network device, the allocated rank different from the first rank; and outputting, by the root network device, a message to the child network device specifying the allocated rank, the message causing the child network device to implement the allocated rank in the DAG, including causing the child network device to generate and output a Destination Oriented Directed Acyclic Graph (DODAG) information object (DIO) message specifying the child network device is using the allocated rank.

Abstract: In one embodiment, a method comprises: receiving, by a parent network device providing at least at portion of a directed acyclic graph (DAG) according to a prescribed routing protocol in a low power and lossy network, a destination advertisement object (DAO) message, the DAO message specifying a target Internet Protocol (IP) address claimed by an advertising network device in the DAG and the DAO message further specifying a secure token associated with the target IP address; and selectively issuing a cryptographic challenge to the DAO message to validate whether the advertising network device generated the secure token.

Abstract: In one embodiment, a method comprises generating a switched link layer topology from a source device to a destination device, the switched link layer topology comprising a first sequence of switching devices, a second sequence of switching devices, and one or more bridging links between the first and second sequences of switching devices; generating first and second chains of resilient link layer segments for respective first and second multi-hop link layer connections based on generating a sequence of link layer loops overlying the switched link layer topology, and setting for each of the first and second multi-hop link layer connections a corresponding set of connection blocks in each link layer loop; and causing replication of a data packet across the first and second multi-hop link layer connections, enabling a failure in the switched link layer topology to be bypassed based on removing at least one of the connection blocks.

Abstract: In one embodiment, a method comprises identifying, by a controller device, first and second paths between an ingress network node and an egress network node in a deterministic network for an identified flow of data packets in an identified sequence, the identifying including identifying a replication node for replicating the identified flow into the first and second paths, and identifying an elimination node for receiving transmitted data packets along the first and second paths for the identified flow and transmitting the identified flow of data packets in the identified sequence; determining a jitter difference of the identified flow between the first and second paths, the jitter difference identifying a maximum jitter encountered in an average difference of latency between the first and second paths; and causing at least one of the elimination node or an upstream node along one of the first or second paths to absorb the jitter difference.

Abstract: In one embodiment, a method comprises generating a switched link layer topology from a source device to a destination device, the switched link layer topology comprising a first sequence of switching devices, a second sequence of switching devices, and one or more bridging links between the first and second sequences of switching devices; generating first and second chains of resilient link layer segments for respective first and second multi-hop link layer connections based on generating a sequence of link layer loops overlying the switched link layer topology, and setting for each of the first and second multi-hop link layer connections a corresponding set of connection blocks in each link layer loop; and causing replication of a data packet across the first and second multi-hop link layer connections, enabling a failure in the switched link layer topology to be bypassed based on removing at least one of the connection blocks.

Abstract: In one embodiment, a method comprises: determining access point devices providing network coverage for a mobile network device within a prescribed coverage area of a deterministic network; establishing a deterministic reception tree comprising a root and switching devices associated with the access point devices, the deterministic reception tree enabling any one or more of the switching devices to forward toward the root a data packet, transmitted by the mobile network device at a prescribed transmission time, for deterministic reception by the root at a prescribed reception time regardless of any distance of any of the access point devices from the root; and causing the switching devices to implement the deterministic reception tree enabling the root to deterministically receive the data packet, received by any one or more of the access point devices, at the prescribed reception time.

Abstract: In one embodiment, a method comprises: a first network device in a deterministic network identifying at least one of first and second deterministic transmit opportunities for transmission of a data packet toward a destination device along a deterministic path of the deterministic network, the first deterministic transmit opportunity reserved for the first network device deterministically receiving the data packet from a second network device and the second deterministic transmit opportunity reserved for deterministic transmission by the first network device of the data packet toward the destination device along the deterministic path; the first network device detecting an absence of receiving the data packet from the second network device according to the first deterministic transmit opportunity; and the first network device selectively generating and deterministically transmitting according to the second deterministic transmit opportunity, in response to the absence of receiving the data packet, a management

Abstract: In one embodiment, a method comprises detecting, by a network device, an endpoint device attempting to access a data network via a data link; and generating, by the network device, a unique device signature for identifying the endpoint device based on the network device identifying a sequence of link layer data packets transmitted by the endpoint device upon connection to the data link, the unique device signature identifying a behavior of the endpoint device independent of any link layer address used by the endpoint device.

Abstract: In one embodiment, a method comprises: detecting, by a transport layer executed by a processor circuit in an apparatus, a request message received via a non-deterministic data link from one of a plurality of deterministic network interface circuits, the request message for a transport layer packet having been stored in a buffer circuit storing a plurality of transport layer packets in the apparatus, the deterministic network interface circuits providing respective deterministic links for deterministic transmission of the transport layer packets in a deterministic data network, the request message specifying a first number identifying any missed transmission opportunities on the corresponding deterministic link; determining, by the transport layer, a cause of failure in one or more of the missed transmission opportunities; and selectively executing, by the transport layer based on determining the cause of failure, a corrective action for preventing an increase in latency of the transport layer packets.

Abstract: In one embodiment, a method comprises establishing, by a deterministic device interface circuit, a deterministic link with a peer deterministic interface circuit within a deterministic data network based on identifying a repeating deterministic schedule for transmitting each data packet, allocated to the deterministic schedule, at a corresponding transmission instance coinciding with a reception instance by the peer deterministic interface circuit; determining a latency between sending a request for data to a host device via a non-deterministic data link provided by a network switch, and receiving from the host device a transport layer packet responsive to the request; and sending an instruction to the host device for initiating transfer of the transport layer packet, the instruction correcting for the latency and enabling the deterministic device interface circuit to receive the transport layer packet for transmission of a corresponding data packet on the deterministic link at the corresponding transmission

Abstract: In one embodiment, a method comprises: receiving, by a switching device, one or more identified flows of data packets from first deterministic flows of a first deterministic segment in a first deterministic domain, the first deterministic segment established based on first deterministic attributes in the first deterministic domain; receiving, by the switching device, second deterministic attributes about second deterministic flows for a second deterministic segment in a second different deterministic domain, the second deterministic attributes different than the first deterministic attributes; and allocating, by the switching device based on the first deterministic attributes and the second deterministic attributes, at least a portion of the second deterministic flows for deterministic stitching of the one or more identified flows of data packets from the first deterministic segment in the first deterministic domain into the second deterministic segment in the second deterministic domain according to a guaran

Abstract: In one embodiment, a method comprises: a network device, having attached to a first parent device in a tree-based network topology, attaching to a second parent device advertising better network performance than the first parent device; and the network device detaching from the second parent device, and reattaching to the first parent device, in response to the network device determining the corresponding network performance via the second parent device is worse than any one of the advertised better network performance, the corresponding network performance via the first parent device, or an expected network performance via the second network device.

Abstract: In one embodiment, a method comprises identifying, by a controller device, first and second paths between an ingress network node and an egress network node in a deterministic network for an identified flow of data packets in an identified sequence, the identifying including identifying a replication node for replicating the identified flow into the first and second paths, and identifying an elimination node for receiving transmitted data packets along the first and second paths for the identified flow and transmitting the identified flow of data packets in the identified sequence; determining a jitter difference of the identified flow between the first and second paths, the jitter difference identifying a maximum jitter encountered in an average difference of latency between the first and second paths; and causing at least one of the elimination node or an upstream node along one of the first or second paths to absorb the jitter difference.

Abstract: In one embodiment, a method comprises promiscuously detecting, by a network device in a wireless data network, a wireless data packet comprising a source route header specifying a hop-by-hop path for reaching a destination device in the wireless data network; determining, by the network device, that the network device is identified in the hop-by-hop path as following a first next-hop device targeted for reception of the wireless data packet; and executing intercepted forwarding of the wireless data packet, by the network device, to a second next-hop device successively following the network device in the hop-by-hop path.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and causing the network traffic to be forwarded along at least one of the routing arcs to the destination device.