Abstract: In one embodiment, a method comprises: determining, by a constrained network device in a low power and lossy network (LLN), a self-estimated density value of neighboring LLN devices based on wirelessly receiving an identified number of beacon message transmissions within an identified time interval from neighboring transmitting LLN devices in the LLN; setting, by the constrained network device, a first wireless transmit power value based on the self-estimated density value; and transmitting a beacon message at the first wireless transmit power value, the beacon message specifying the self-estimated density value, a corresponding trust metric for the self-estimated density value, and the first wireless transmit power value used by the constrained network device for transmitting the beacon message.

Abstract: In one embodiment, a method comprises: determining, by a constrained network device in a low power and lossy network (LLN), a self-estimated density value of neighboring LLN devices based on wirelessly receiving an identified number of beacon message transmissions within an identified time interval from neighboring transmitting LLN devices in the LLN; setting, by the constrained network device, a first wireless transmit power value based on the self-estimated density value; and transmitting a beacon message at the first wireless transmit power value, the beacon message specifying the self-estimated density value, a corresponding trust metric for the self-estimated density value, and the first wireless transmit power value used by the constrained network device for transmitting the beacon message.

Abstract: In one embodiment, a method comprises: receiving, by a transport layer executed by a processor circuit in an apparatus, a flow of application data having been originated by an executable application; storing, by the transport layer, the application data as transport layer packets in a buffer circuit in the apparatus, each transport layer packet having a corresponding transport sequence identifier identifying a corresponding position of the transport layer packet relative to a transmit order of the transport layer packets; and causing, by the transport layer, a plurality of deterministic network interface circuits to deterministically retrieve the transport layer packets, in the transmit order, from the buffer circuit for deterministic transmission across respective deterministic links, the transport sequence identifiers enabling a destination transport layer to recover the transmit order of the transport layer following the deterministic transmission across the deterministic links, regardless of order of rece

Abstract: In one embodiment, a method comprises: receiving, by a constrained wireless network device comprising a local clock, a plurality of messages from respective neighboring wireless network devices advertising as available parent devices in a directed acyclic graph of a time-synchronized network that is synchronized to a master clock device; determining, by the constrained wireless network device, a corresponding timing error of the local clock relative to each message output by the corresponding available parent device; and executing, by the constrained wireless network device, a distributed time synchronization of the local clock with the master clock device based on correlating the respective timing errors relative to the local clock.

Abstract: In one embodiment, a method comprises: determining, by a network switching device, whether the network switching device is configured as one of multiple leaf network switching devices, one of multiple Top-of-Fabric (ToF) switching devices, or one of multiple intermediate switching devices in a switched data network having a leaf-spine switching architecture; if configured as a leaf switching device, limiting flooding of an advertisement only to a subset of the intermediate switching devices in response to detecting a mobile destination is reachable; if configured as an intermediate switching device, flooding the advertisement, received from any one of the leaf network switching devices, to connected ToF switching devices without installing any routing information specified within the advertisement; if configured as a ToF switching device, installing from the flooded advertisement the routing information and tunneling a data packet, destined for the mobile destination, to the leaf switching device having trans

Abstract: In one embodiment, a method comprises: identifying, by a receiving network device, a deterministic schedule comprising allocated time slots, each allocated time slot allocated for the receiving network device receiving a data packet from one of a plurality of transmitting network devices in a wireless deterministic data network; and selectively transmitting, by the receiving network device, an expectation message at initiation of each of the allocated time slots, each expectation message preempting transmission by any other network device during the corresponding allocated time slot, each expectation message generated by the receiving network device and identifying a corresponding transmitting network device that is expected to deterministically transmit a corresponding expected data packet to the receiving network device during the corresponding allocated time slot; the expectation message causing the corresponding identified transmitting network device to transmit the corresponding expected data packet duri

Abstract: In one embodiment, a method comprises: receiving, by a parent network device providing at least a 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: determining, by a constrained network device in a low power and lossy network (LLN), a self-estimated density value of neighboring LLN devices based on wirelessly receiving an identified number of beacon message transmissions within an identified time interval from neighboring transmitting LLN devices in the LLN; setting, by the constrained network device, a first wireless transmit power value based on the self-estimated density value; and transmitting a beacon message at the first wireless transmit power value, the beacon message specifying the self-estimated density value, a corresponding trust metric for the self-estimated density value, and the first wireless transmit power value used by the constrained network device for transmitting the beacon message.

Abstract: In one embodiment, a method comprises: receiving, by a switching device in a deterministic network, a first data packet associated with an identified flow of data packets, and queuing the first data packet for deterministic transmission at a deterministic transmit instance to a next-hop device in the deterministic network; detecting, by the switching device, reception of a newest data packet associated with the identified flow and before the deterministic transmission of the first data packet; and prioritizing for the identified flow, by the switching device, the newest data packet based on deterministically transmitting, at the deterministic transmit instance, the newest data packet instead of the first data packet.

Abstract: In one embodiment, a method comprises: detecting, by a constrained network device in a low power and lossy network, a loss of synchronization with a neighboring network device based on a determined absence of a prescribed transmission activity by the neighboring network device within a prescribed listening interval that is limited to a prescribed guard time according to a wireless time-slotted transmission protocol; and executing, by the constrained network device, localized sync recovery based on shifting a next listening interval to a shifted listening interval based on selectively shifting, based on a selected shift amount, the prescribed guard time of a corresponding next instance of the prescribed listening interval, enabling the constrained network device to recover synchronization with the neighboring network device based on detecting the prescribed transmission activity that is outside the prescribed listening interval and within the shifted listening interval.

Abstract: In one embodiment, an access point is configured with a plurality of resource units (RUs). Each RU is configured to use a frequency range that differs from frequency ranges used by the other RUs. The access point receives first information indicating, for each RU, a first signal quality that the station associates with the respective RU. The access point receives second information indicating, for each RU, a second signal quality that the station associates with the respective RU. The access point further determines, based on at least the first information and the second information, a pattern indicating a recurring signal quality that the station associates with each RU. The access point uses the pattern to allocate one of the RUs for communicating with the station.

Abstract: In one embodiment, a method comprises: receiving, by a switching device in a deterministic network, a first data packet associated with an identified flow of data packets, and queuing the first data packet for deterministic transmission at a deterministic transmit instance to a next-hop device in the deterministic network; detecting, by the switching device, reception of a newest data packet associated with the identified flow and before the deterministic transmission of the first data packet; and prioritizing for the identified flow, by the switching device, the newest data packet based on deterministically transmitting, at the deterministic transmit instance, the newest data packet instead of the first data packet.

Abstract: In one embodiment, a method comprises: receiving, by a constrained wireless network device comprising a local clock, a plurality of messages from respective neighboring wireless network devices advertising as available parent devices in a directed acyclic graph of a time-synchronized network that is synchronized to a master clock device; determining, by the constrained wireless network device, a corresponding timing error of the local clock relative to each message output by the corresponding available parent device; and executing, by the constrained wireless network device, a distributed time synchronization of the local clock with the master clock device based on correlating the respective timing errors relative to the local clock.

Abstract: In one embodiment, a method comprises: storing, by a computing device in a non-deterministic data network, a plurality of data packets originated by a source device into a mass storage medium associated with the computing device; receiving, by the computing device, a data request originated by an access point device providing deterministic reachability to a deterministic device in a deterministic data network providing reachability to multiple deterministic devices, the request specifying one or more deterministic constraints associated with reaching the deterministic device; and supplying, by the computing device, a selected one of the data packets to the access point device for delivery of data stored therein to the deterministic device according to the one or more deterministic constraints.

Abstract: In one embodiment, a method comprises: detecting, by a constrained network device in a low power and lossy network, a loss of synchronization with a neighboring network device based on a determined absence of a prescribed transmission activity by the neighboring network device within a prescribed listening interval that is limited to a prescribed guard time according to a wireless time-slotted transmission protocol; and executing, by the constrained network device, localized sync recovery based on shifting a next listening interval to a shifted listening interval based on selectively shifting, based on a selected shift amount, the prescribed guard time of a corresponding next instance of the prescribed listening interval, enabling the constrained network device to recover synchronization with the neighboring network device based on detecting the prescribed transmission activity that is outside the prescribed listening interval and within the shifted listening interval.

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 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 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, by a network switching device, whether the network switching device is configured as one of multiple leaf network switching devices, one of multiple Top-of-Fabric (ToF) switching devices, or one of multiple intermediate switching devices in a switched data network having a leaf-spine switching architecture; if configured as a leaf switching device, limiting flooding of an advertisement only to a subset of the intermediate switching devices in response to detecting a mobile destination is reachable; if configured as an intermediate switching device, flooding the advertisement, received from any one of the leaf network switching devices, to connected ToF switching devices without installing any routing information specified within the advertisement; if configured as a ToF switching device, installing from the flooded advertisement the routing information and tunneling a data packet, destined for the mobile destination, to the leaf switching device having trans

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.