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 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: The present disclosure provides Border Gateway Protocol route aggregation in a Clos fabric when one or more communication failures are detected. A method includes receiving a prefix component of a first aggregate route from a first next hop node, the prefix component being associated with a failed network element; announcing, to one or more neighboring nodes, the first aggregate route along with the prefix component and the first next hop node associated with the failed network element; identifying, by the one or more neighboring nodes, a second aggregate route, the second aggregate route being a shortest aggregate route that contains the first aggregate route; and generating, from the second aggregate route, one or more Chad routes to the prefix component of the first aggregate route, wherein the one or more Chad routes are associated with one or more next hop nodes that are different from the first next hop node.

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: In one embodiment, a supervisory service for a wireless network receives telemetry data indicative of client movement of wireless clients of the network within a location. The service determines a measure of client movement stability for the location, based on the received telemetry data. The service selects one or more of the clients for wireless access point reassignment, when the determined measure of client movement stability exceeds a predefined threshold. The service causes the selected one or more clients to switch from a first wireless access point at the location to a second wireless access point at the location.

Abstract: In one embodiment, a device configures a plurality of subinterfaces for each of a plurality of physical ports of a software defined network (SDN). The device allocates a fixed amount of bandwidth to each of the subinterfaces. The device forms a plurality of midlays for the SDN by assigning subsets of the plurality of subinterfaces to each of the midlays. The device assigns a network slice to one or more of the midlays, based on a bandwidth requirement of the network slice.

Abstract: In one embodiment, a plurality of PODs is formed in a software defined networking (SDN) fabric, each POD comprising a plurality of leaf nodes and connected to a plurality of spine nodes in a spine layer of the SDN fabric. One of the plurality of PODs is designated as a super POD and link state information is provided for the entire fabric to the super POD by sending northbound advertisements in the fabric to the super POD. A disconnection is identified between a leaf node in the SDN fabric and a particular one of the spine nodes in the spine layer, based on the link state information provided to the super POD. The disconnection is repaired between the leaf node and the particular spine node in the spine layer.

Abstract: In one embodiment, a device in a network receives node information regarding a plurality of nodes that are to join the network. The device determines network formation parameters based on the received node information. The network formation parameters are indicative of a network join schedule and join location for a particular node from the plurality of nodes. The device generates, according to the network join schedule, a join invitation for the particular node based on the network formation parameters. The join invitation allows the particular node to attempt joining the network at the join location via a specified access point. The device causes the sending of one or more beacons via the network that include the join invitation to the particular node. The particular node attempts to join the network via the specified access point based on the one or more beacons.

Abstract: In one embodiment, a method is performed. A fat tree route miner (FT-RM) entity may be used to establish a control plane session with a first spine node in communication with a network. The FT-RM entity may identify a prefix that is unreachable by the first spine node. The FT-RM entity may instruct a spine node to disaggregate the prefix.

Abstract: In one embodiment, a method includes training a deep neural network using a first set of network characteristics corresponding to a first time and a second set of network characteristics corresponding to a second time, generating, using the deep neural network, a predictive set of network characteristics corresponding to a future time, and assigning a task of a distributed application to a processing unit based on the predictive set of network characteristics.

Abstract: The present disclosure provides a proactive method of prefix disaggregation in a network fabric when one or more communication failures are detected. In one aspect, a method includes determining, by a first node of a network fabric, a corresponding prefix disaggregation policy for at least one second node of the network fabric, the corresponding prefix disaggregation policy identifying one or more network prefixes that are inaccessible via the first node when at least one communication failure is detected in association with the first node; sending the corresponding prefix disaggregation policy to the second node; and causing the second node to implement the prefix disaggregation policy upon detecting the at least one communication failure.

Abstract: In one embodiment, a device in a network receives a path computation agent configured to determine a path in the network that satisfies an objective function. The device executes the path computation agent to update state information regarding the network maintained by the path computation agent. The device selects a neighbor of the device in the network to execute the path computation agent based on the updated state information regarding the network. The device instructs the selected neighbor to execute the path computation agent with the updated state information regarding the network. The device unloads the path computation agent from the device after selecting the neighbor of the device to execute the path computation agent.

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, an elimination point device in a network obtains a master secret from a network controller. The elimination point device assesses, using the master secret, whether an incoming packet received by the elimination point device from a redundant path between the elimination point device and a replication point device in the network includes a valid message integrity check (MIC). The elimination point device determines whether the incoming packet was injected maliciously into the redundant path, based on the assessment of the incoming packet. The elimination point device initiates performance of a mitigation action in the network, when the elimination point device determines that the incoming packet was injected maliciously into the redundant path.

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 node in the routing topology. The device assigns the nodes in the network to timeslots of a channel-hopping communication schedule in order of their associated network depths. The device assigns transmit and receive actions to the timeslots of the communication schedule for a particular time such that parent-to-child and child-to-parent communications alternate with network depth in the timeslots. The device sends the communication schedule with the node and action assignments to one or more of the nodes in the network.

Abstract: In one embodiment, a supervisory device in a network forms a virtual access point (VAP) for a node in the network. A plurality of access points (APs) in the network are mapped to the VAP as part of a VAP mapping and the node treats the APs in the VAP mapping as a single AP for purposes of communicating with the network. The supervisory device determines a traffic type of traffic associated with the node. The supervisory device assigns the node to a selected wireless channel based in part on the traffic type of the traffic associated with the node. The supervisory device controls the VAP to use the channel assigned to the node.

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 supervisory device in a network assigns different access points in the network to different access point groupings. Each of the different access point groupings uses a different network path to communicate with a given endpoint in the network. The supervisory device selects at least one of the access points in each of the different access point groupings for mapping to a virtual access point (VAP) for a node in the network as part of a VAP mapping. The supervisory device instructs the selected access points to form a VAP for the node. The node treats the access points in the VAP mapping as a single access point for purposes of communicating with the network.

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 supervisory device for a software defined networking (SDN) fabric predicts a failure in the SDN fabric using a machine learning-based failure prediction model. The supervisory device identifies a plurality of traffic flows having associated leaves in the SDN fabric that would be affected by the predicted failure. The supervisory device selects a subset of the identified plurality of traffic flows and their associated leaves. The supervisory device disaggregates routes for the selected subset of traffic flows and their associated leaves, to avoid the predicted failure.