Abstract:
In one embodiment, a device in a network receives a request from a neighbor of the device to add the neighbor as a child of the device in the network. The request includes a signed address registration certificate that certifies that a network address of the neighbor is registered in the network. The device determines whether the signed address registration certificate is valid. The device adds the neighbor as a child of the device in the network based on a determination that the signed address registration certificate is valid.
Abstract:
In one embodiment, a device in a network receives a notification from a neighbor of the device indicative of a child node of the device requesting a parent change from the device to the neighbor. The device updates an existing routing path from the device to the child node to be routed through the neighbor, in response to receiving the notification from the neighbor. The device receives an instruction to remove the updated routing path from the device to the child node through the neighbor. The device removes the updated routing path from the device to the child node, in response to receiving the instruction to remove the updated routing path.
Abstract:
In one embodiment, a device in a network sends a first multicast message to a plurality of destinations in the network. The first multicast message includes a first bitmap that identifies the destinations. The device receives one or more acknowledgements from a subset of the destinations. The device determines a retransmission bitmap that identifies those of the plurality of destinations that did not acknowledge the first multicast message, based on the received one or more acknowledgements. The device sends a retransmission multicast message to those of the plurality of destinations that did not acknowledge the first multicast message. The retransmission multicast message includes the retransmission bitmap.
Abstract:
In one embodiment, a method includes receiving a packet from an end node, the packet comprising an authenticated source MAC (Media Access Control) address and a source IP (Internet Protocol) address computed based on the authenticated source MAC address, and verifying the source IP address in the received packet, wherein verifying the source IP address comprises computing an IP address based on the authenticated source MAC address and comparing the computed IP address to the source IP address in the received packet to verify the source IP address. An apparatus is also disclosed herein.
Abstract:
In one embodiment, a method comprises a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network; and the path computation device classifying each member network device belonging to a directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.
Abstract:
In one embodiment, a method comprises creating, in a computing network, a hierarchal routing topology for reaching a destination, the hierarchal routing topology comprising a single parent supernode providing reachability to the destination, and a plurality of child supernodes, each child supernode comprising one or more exit network devices each providing a corresponding link to the parent supernode; receiving, in one of the child supernodes, a data packet for delivery to the destination; causing the data packet to traverse along any available data link in the one child supernode independent of any routing topology established by network devices in the one child supernode, until the data packet reaches one of the exit network devices; and the one exit network device forwarding the data packet to the parent supernode, via the corresponding link, for delivery to the destination.
Abstract:
In one embodiment, a particular node operates a distributed routing protocol in a shared-media communication network, and distributes timeslot allocations using the routing protocol, where the particular node as a parent node allocates a pool of timeslots available to child nodes of the parent node. The parent node specifically allocates particular timeslots from the pool to particular child nodes according to particular flows from a source to a target in the shared-media communication network in order to meet a defined time budget for a resultant time-synchronized path from the source to the target.
Abstract:
In one embodiment, the locations of a plurality of network devices in a low power and lossy network (LLN) are determined along an intelligent wire. One or more neighboring devices for each network device in the plurality are identified based on the locations of the network devices along the intelligent wire. A communication schedule for the network devices is determined that prevents neighboring devices along the intelligent wire from transmitting on the same frequency. The network devices are assigned to communication time slots based on the communication schedule. The network devices are also assigned frequency offsets based on the communication schedule.
Abstract:
A network includes multiple routing arcs for routing network traffic to a destination. Each arc comprising nodes connected in sequence by reversible links oriented away from a node initially holding a cursor toward one of first and second edge nodes through which the network traffic exits the arc. Each node includes a network device. The nodes in the arc detect a first failure in the arc. Responsive to the detecting the first failure, the nodes exchange first management frames over a data plane within the arc in order to transfer the cursor from the node initially holding the cursor to a first node proximate the first failure and reverse links in the arc as appropriate so that the network traffic in the arc is directed away from the first failure toward the first edge node of the arc through which the network traffic is able to exit the arc.
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.