Abstract:
In one embodiment, a method comprises attaching, by a constrained network device in a data network, to a first parent network device in a tree-based storing mode topology in response to receiving a first advertisement message generated by the first parent network device; outputting to the first parent network device a plurality of routes stored in the constrained network device, the routes identifying destinations reachable via the constrained network device; determining, by the constrained network device, that the first parent network device is encountering saturation of stored routes based on the constrained network device receiving a second advertisement message from the first parent network device; and eliminating, by the constrained network device, the saturation encountered by the first parent network device based on moving at least a portion of the routes from the first parent network device to a second parent network device in the tree-based storing mode topology.
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:
A management device for a low power wide area network can: generate and send, to each constrained wireless network device via a wired gateway, a link layer multicast listener command specifying a listening interval and causing each constrained wireless network device to change from a low-power optimized mode to a listening mode until reception of a multicast data packet within the listening interval; generate collision avoidance parameters including a minimum waiting interval, a maximum waiting interval relative to the listening interval, and a redundancy constant; and instruct the wired gateways to selectively transmit the multicast data packet based on the collision avoidance parameters, wherein each wired gateway responds by waiting a randomly-selected wait interval between the minimum and maximum waiting intervals, and selectively transmitting the multicast data packet only if a received number of the multicast data packet by the corresponding wired gateway is less than the redundancy constant.
Abstract:
In one embodiment, a method comprises receiving, by a transport layer executed by a processor circuit in an apparatus, an identifiable grouping of data; storing, by the transport layer, the data as transport layer packets in a buffer circuit in the apparatus, the storing including inserting into each transport layer packet a grouping identifier that identifies the transport layer packets as belonging to the identifiable grouping; and causing, by the transport layer, a plurality of transmitting deterministic network interface circuits to deterministically retrieve the transport layer packets from the buffer circuit for deterministic transmission across respective deterministic links, the grouping identifier enabling receiving deterministic network interface circuits to group the received transport layer packets, regardless of deterministic link, into a single processing group for a next receiving transport layer.
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: 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 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 creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node; identifying, within the loop-free routing topology, non-congruent paths for a source network node to reach the destination node; and determining, from the non-congruent paths, a non-congruent path pair providing no more than a prescribed difference of latency from the source network node to the destination node, enabling the source network node to forward a data packet in a first direction of the one non-congruent path pair and a bicasted copy of the data packet in a second direction of the one non-congruent path pair, for reception of the data packet and the bicasted copy by the destination node within the prescribed difference of latency.
Abstract:
In one embodiment, a method comprises: a first network device in a deterministic network identifying first and second slots for transmission of a data packet toward a destination device along a deterministic track of the deterministic network, the first slot reserved for the first network device receiving the data packet from a second network device and the second slot reserved for transmission by the first network device of the data packet toward the destination device along the deterministic track; the first network device detecting, in the first slot, an absence of receiving the data packet from the second network device; and the first network device selectively generating and transmitting in the second slot, in response to the absence of receiving the data packet, a management packet along the deterministic track.
Abstract:
In one embodiment, a method comprises receiving, by a network device, a data packet specifying alarm data generated by a sensor node; and outputting, by the network device, the data packet at an alarm level priority that is higher than any network-level priority of any wireless routing topology.