Abstract:
In one embodiment, a device receives a destination unreachable message originated by a particular node along a first source route, the message carrying an encapsulated packet as received by the particular node. In response, the device may determine a failed link along the first source route based on a tunnel header and the particular node. Once determining an alternate source route without the failed link, the device may re-encapsulate and re-transmit the original packet on an alternate source route with a new tunnel header indicating the alternate source route (e.g., and a new hop limit count for the tunnel header and an adjusted hop limit count in the original packet).
Abstract:
In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network.
Abstract:
In a multiple interface, low power and lossy network comprising multiple nodes, a root phase device obtains phase differential and absolute phase information from the devices in various network paths. Each device in a network path determines the differential phase data compared to its parent device in a network path. The device transmits the differential phase data to the parent device. The parent device transmits the differential phase data up the network path toward the root phase device. The root phase device collects the differential phase data and transmits the data to a central device. The central device determines the absolute phase of all devices. The root phase device can propagate absolute phase information to all devices within the network. Each device determines the absolute phase data by comparing the phase data of the device with the absolute phase data. The phase data is transmitted to a central device.
Abstract:
In one embodiment, a device in a channel hopping, communication network independently maintains a slot counter, and computes a channel identification (ID) based on a function having inputs of a unique feature of the device, ii) a current slot of the slot counter, and iii) a set of possible channel IDs. Accordingly, the device configures its radio to receive on the computed channel ID for the respective current slot. In another embodiment, the device may determine, for a neighbor device, a current neighbor slot and unique neighbor feature, and correspondingly computes a neighbor channel ID based on the function using the unique neighbor feature, the current neighbor slot, and the set of a possible channel IDs. As such, the device configures its radio to transmit on the computed neighbor channel ID for the respective current neighbor slot.
Abstract:
In one embodiment, a time at which a first device in a frequency-hopping communication network is expected to transmit a data message is determined. A first schedule is then generated based on the determined time, and the first schedule is overlaid on a frequency-hopping schedule for a second device in the network. The first schedule defines a first timeslot during which the second device listens for the data message, while the frequency-hopping schedule defines second timeslots during which the second device listens for data messages from other devices in the network. Notably, a duration of the first timeslot is greater than respective durations of the second timeslots.
Abstract:
In one embodiment, an aggregating node receives feedback messages from one or more destination nodes in the network. The destination nodes are designated to receive data as packets from a source node using rateless coding. Further, the feedback messages indicate whether packets are needed at a corresponding destination node to complete the data. Then, the feedback messages are aggregated into a single aggregated message, and the aggregated message is transmitted toward the source node.
Abstract:
In one embodiment, network parameters are dynamically adjusted using weather forecasts. The embodiments include determining a weather forecast that predicts a weather condition proximate to a network. Network parameters are then selected for adjustment based on the predicted weather condition. The selected network parameters are adjusted to improve performance of the network in response to the predicted weather condition.
Abstract:
In one embodiment, a first node in a shared-media communication network may receive a message indicated a scheduled downtime of a second node located between the first node and a destination. The first node may determine whether to perform a search for an alternate route toward the destination. In response to determining to perform the search, the first node may perform the search for an alternate route toward the destination for use at least during the scheduled downtime.
Abstract:
In one embodiment, nodes are polled in a network for Quality of Service (QoS) measurements, and a QoS anomaly that affects a plurality of potentially faulty nodes is detected based on the QoS measurements. A path, which traverses the plurality of potentially faulty nodes, is then computed from a first endpoint to a second endpoint. Also, a median node that is located at a point along the path between the first endpoint and the second endpoint is computed. Time-stamped packets are received from the median node, and the first endpoint and the second endpoint of the path are updated based on the received time-stamped packets, such that an amount of potentially faulty nodes is reduced. Then, the faulty node is identified from a reduced amount of potentially faulty nodes.
Abstract:
In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.