Abstract: Embodiments include technologies for creating a manifest for a conferencing event in a network, adding a name tag identifying the conferencing event to the manifest, receiving an interest packet including one or more parameters indicating a named flow being produced at a source node, adding content metadata of the named flow to the manifest, and sending the manifest to the source node. Further embodiments include adding, to the manifest, session-level metadata associated with a user of the source node. Embodiments include receiving a second interest packet with one or more second parameters identifying a user of a client node, where the second interest packet indicates a request to authorize the user of the client node to subscribe to the conferencing event. In further embodiments, session-level metadata associated with the user is added to the manifest if the user is authorized to subscribe to the conferencing event.

Abstract: According to one or more embodiments of the disclosure, a first tunnel router may receive a reservation request to establish a deterministic path between a first node and a second node. The first tunnel router may determine, based on the reservation request, a destination address of the second node. The first tunnel router may identify, based on the destination address of the second node, a second tunnel router associated with the second node. The first tunnel router may encapsulate a deterministic packet sent by the first towards the second node into a tunnel packet, wherein a multicast address in a header of the tunnel packet is set to the destination address of the second node. The first tunnel router can forward the tunnel packet along the deterministic path. The multicast address in the header of the tunnel packet causes nodes to send the tunnel packet according to the deterministic path.

Abstract: In one embodiment, a tracking device detects a first device connecting to a computer network, and forces an install of fake routing information on the first device that is unique to the first device. Upon detecting a second device connecting to the computer network, the second device having at least one identifying property in common with the first device and at least one identifying property differing from the first device, the tracking device may then query the second device to determine if the second device knows the fake routing information unique to the first device. As such, the tracking device may then determine that the second device is the first device in response to the second device knowing the fake routing information unique to the first device.

Abstract: Disclosed are systems, methods, and computer-readable media for integrating deterministic packet transmissions scheduling of short range local area networks (e.g., 6TiSCH networks) with deterministic packet transmission scheduling for wireless networks such as LTE/4G/5G networks. In one aspect, a wireless communication network includes a plurality of first nodes configured to communicate using a first communication protocol; and a second node configured to communicate with the plurality of first nodes using the first communication protocol and configured to communicate with a third node using a second communication protocol, the second node being further configured to map corresponding transmission schedule of the first communication protocol to a second transmission schedule for the second communication protocol.

Abstract: Telemetry for cloud switches queuing excursion may be provided. A first hysteresis threshold and a second hysteresis threshold for a queue of the network switch may be specified. Next, a queue position relative to the first hysteresis threshold and the second hysteresis threshold may be determined for each incoming packets for the queue. A number of crossings including the queue position passing the first hysteresis threshold and subsequently passing the second hysteresis threshold in a first predetermined time period may be determined. A number of data packets being sent to the queue of the network switch may then be altered based on one or more of the number of crossings, the first hysteresis threshold, and the second hysteresis threshold.

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 particular device in a deterministic network performs classification of one or more packets of a traffic flow between a source and a destination in the deterministic network. The particular device determines, based on the classification of the one or more packets, a requirement of the traffic flow. The particular device performs, based on the requirement, a packet operation on at least one packet of the traffic flow. The particular device sends packets of the traffic flow towards the destination via two or more paths in the deterministic network.

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: 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 illustrative example, a network node connected in a network fabric may identify that it is established as part of a multicast distribution tree for forwarding multicast traffic from a source node to one or more host receiver devices of a multicast group. In response, the network node may propagate in the network fabric a message for advertising the network node as a candidate local source node at which to join the multicast group. The message for advertising may include data such as a reachability metric. The propagation of the message may be part of a flooding of such messages in the network fabric. The network node serving as the candidate local source node may thereafter “locally” join a host receiver device in the multicast group at the network node so that the device may receive the multicast traffic from the source node via the network node.

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: 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: Embodiments include technologies for creating a manifest for a conferencing event in a network, adding a name tag identifying the conferencing event to the manifest, receiving an interest packet including one or more parameters indicating a named flow being produced at a source node, adding content metadata of the named flow to the manifest, and sending the manifest to the source node. Further embodiments include adding, to the manifest, session-level metadata associated with a user of the source node. Embodiments include receiving a second interest packet with one or more second parameters identifying a user of a client node, where the second interest packet indicates a request to authorize the user of the client node to subscribe to the conferencing event. In further embodiments, session-level metadata associated with the user is added to the manifest if the user is authorized to subscribe to the conferencing event.

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: A source access network device multicasts copies of a packet to multiple core switches, for switching to a same target access network device. The core switches are selected for the multicast based on a load balancing algorithm managed by a central controller. The target access network device receives at least one of the copies of the packet and generates at least metric indicative of a level of traffic congestion at the core switches and feeds back information regarding the recorded at least one metric to the controller. The controller adjusts the load balancing algorithm based on the fed back information for selection of core switches for a subsequent data flow.

Abstract: In one embodiment, a device receives data indicative of a routing topology of a network. The network includes a root node and each node in the network has an associated network depth relative to the root. The device selects a first subset of timeslots from a slotframe of a communication schedule based on the network depth of a particular node in the network. The device selects a second subset of timeslots from the first subset, based on a media access control (MAC) address of the particular node. The device assigns the second subset of timeslots to the particular node for reception in the slotframe of the communication schedule. The device sends the communication schedule to one or more nodes in the network.

Abstract: In one embodiment, a supervisory device for a software defined networking (SDN) fabric obtains telemetry data regarding congestion levels on a plurality of links in the SDN fabric. The supervisory device predicts seasonal congestion on a particular one of the plurality of links by using the telemetry data as input to a machine learning-based model. The supervisory device identifies a period of time associated with the predicted seasonal congestion on the particular link. The supervisory device initiates, in advance of the identified period of time, re-computation of equal-cost multi-path (ECMP) weights associated with the plurality of links that prevent occurrence of the predicted seasonal congestion on the particular link during the identified period of time.

Abstract: In one embodiment, a method comprises: registering, by a root network device in a low power and lossy network, a constrained network device that is reachable within the low power and lossy network; obtaining, by the root network device, executable code associated with execution of a network service operation by the constrained network device; receiving a data packet from a source device and destined for the constrained network device; and causing execution on the data packet, by the root network device, of the network service operation on behalf of the constrained network device in response to reception of the data packet.

Abstract: In one embodiment, a device of a software defined wide area network (SD-WAN) predicts characteristics of a new traffic flow to be admitted to the SD-WAN, based on a set of initial packets of the flow. The device predicts an impact of admitting the flow to the SD-WAN, based in part on extrinsic or exogenous data regarding the SD-WAN. The device admits the flow to the SD-WAN, based on the predicted impact. The supervisory device uses reinforcement learning to adjust one or more call admission control (CAC) parameters of the SD-WAN, based on captured telemetry data regarding the admitted flow.

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.