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:
In one embodiment, a device in a network receives information regarding one or more traffic flows in the network. The device identifies a particular one of the one or more traffic flows as a seasonal traffic flow based on the information regarding the one or more traffic flows. The device determines whether a service level agreement associated with the seasonal traffic flow is met. The device causes a time-based path for the seasonal traffic flow to be provisioned, in response to a determination that the service level agreement associated with the seasonal traffic flow is not met.
Abstract:
In one embodiment, a supervisory device in a network receives from a plurality of access points (APs) in the network data regarding a network availability request broadcast by a node seeking to access the network and received by the APs in the plurality. The supervisory device uniquely associates the node with a virtual access point (VAP) for the node and forms a VAP mapping between the VAP for the node and a set of the APs in the plurality selected based on the received data regarding the network availability request. One of the APs in the mapping is designated as a primary access point for the node. The supervisory device instructs the primary AP to send a network availability response to the node that includes information for the VAP. The node uses the information for the VAP to access the network via the set of APs in the VAP mapping.
Abstract:
In one embodiment, a server instructs one or more networking devices in a local area network (LAN) to form a virtual network overlay in the LAN that redirects traffic associated with a particular node in the LAN to the server. The server receives the redirected traffic associated with the particular node. The server trains a machine learning-based behavioral model for the particular node based on the redirected traffic. The server controls whether a particular redirected traffic flow associated with the node in the LAN is sent to a destination of the traffic flow using the trained behavioral model.
Abstract:
In one embodiment, a device in a network sets a timer interval based in part on a distance between the device and a backbone of the network. The device receives a unicast communication destined for a remote destination that was sent via broadcast. The device determines a count of receipt acknowledgements of the communication sent by other devices in the network. At the end of the timer interval, the device sends a receipt acknowledgement of the communication via broadcast, in response to the count of receipt acknowledgements sent by other devices in the network being below a threshold amount.
Abstract:
In one embodiment, a method comprises: allocating, to each network device in a time slotted channel hopping network, a corresponding swapping schedule that maps the network device to different unique sequence offsets for different timeslots allocated to the corresponding network device, each unique sequence offset identifying a corresponding shifted position in a prescribed repeating channel hopping sequence relative to an epochal start of a linearly increasing timeslot value; and causing each network device to transmit according to its corresponding swapping schedule, enabling a channel hopping sequence of each network device to be undetectable relative to the prescribed repeating channel hopping sequence.
Abstract:
In one embodiment, an intermediate node in a contention-based shared-media computer network determines a scheduled window within which a packet (with an assigned priority) should be transmitted by the intermediate node. In particular, the intermediate node may specifically determine whether an actual transmission time is prior to, during, or after the window, and sets a priority of the packet as either i) a reduced priority when the actual transmission time is prior to the window, ii) the assigned priority when the actual transmission time is during the window, or iii) an augmented priority when the actual transmission time is after the window. As such, the intermediate node may then transmit the packet from the intermediate node with the set priority at the actual transmission time.
Abstract:
In one embodiment, a network node provides a time slotted channel hopping (TSCH) schedule to one or more child nodes of the network node. The TSCH schedule includes one or more mandatory routing protocol report time slots. The network node receives routing protocol reports from the one or more child nodes according to the TSCH schedule. The network node aggregates the received routing protocol reports into an aggregated routing protocol report. The network node provides the aggregated routing protocol report to a parent of the network node during a time slot that is subsequent to the one or more mandatory time slots for the one or more child nodes.
Abstract:
In one embodiment, a method comprises identifying, by a network device operating in a network topology as a directed acyclic graph (DAG) root, a source-route path for reaching a destination device in the network topology; determining whether one or more parent devices along the source-route path between the network device and the destination device are capable of storing a route entry specifying routing information for reaching the destination device; and causing installation of a route entry for reaching the destination device in one or more of the parent devices determined as capable of storing the corresponding route entry.
Abstract:
In one embodiment, a device determines that a latency between a receive timeslot of a channel hopping schedule of the device and a transmit timeslot of the channel hopping schedule is greater than a latency threshold for a particular traffic flow to be received during the receive timeslot. The device requests an additional transmit timeslot for the channel hopping schedule from a parent node of the device in the network. The device receives an indication of a newly allocated transmit timeslot for the channel hopping schedule from the parent node. The device maps the receive timeslot to one of the transmit timeslots of the channel hopping schedule, wherein the particular traffic flow is to be forwarded to a second device during the mapped transmit timeslot.