Abstract:
In one embodiment, a triggered reboot of a field area router (FAR) of a computer network is initiated, and gathered states of the FAR are saved. The nodes in the computer network are informed of the triggered reboot, and then feedback may be collected from the nodes in response to the triggered reboot. As such, it can be determined whether to complete the triggered reboot based on the feedback, and the FAR is rebooted in response to determining to complete the triggered reboot. In another embodiment, a node receives information about the initiated triggered reboot of the FAR, and determines whether it has critical traffic. If not, the node buffers non-critical traffic and indicates positive feedback in response to the triggered reboot, but if so, then the node continues to process the critical traffic and indicates negative feedback in response to the triggered reboot.
Abstract:
In one embodiment, a node in a shared-media communication network may determine a first directed acyclic graph (DAG) topology, wherein the first DAG topology has a particular direction. The node may determine a second DAG topology in the shared-media communication network based on the first DAG topology. The second DAG topology may share the particular direction of the first DAG topology, to prevent loops between the first and the second DAG topologies.
Abstract:
In one embodiment, a method is disclosed in which physical layer information is received from one or more nodes along a path in a network. Self-interference information is also received from the one or more network nodes. The presence of self-interference along the path is identified and a transmission strategy of the one or more nodes is altered based on the identified self-interference and the received physical layer information.
Abstract:
In one embodiment, certain nodes in a computer network maintain a plurality of routing topologies, each associated with a different corresponding delay (e.g., dynamically adjusted). Upon receiving a packet with an indicated delay budget at a particular node, the node updates the delay budget based on an incurred delay up to and including the particular node since the indicated delay budget was last updated, and selects a particular routing topology on which to forward the packet based on the updated delay budget and the corresponding routing topology delays. The packet may then be forwarded with the updated delay budget on the selected routing topology, accordingly.
Abstract:
In one embodiment, a source node monitors a quality of a primary link, and forwards one or more duplicate copies of a packet in response to poor quality of the primary link. Specifically, forwarding generally comprises transmitting a first copy of the packet on the primary link with an indication of duplicate copies, and transmitting a second copy of the packet on a backup link with an indication of duplicate copies. In another embodiment, an intermediate node receives a first copy of a packet with an indication of duplicate copies, and stores an identifier of the first copy of the packet in response to the indication. Upon receiving a second copy of the packet with the indication of duplicate copies, the node determines whether the identifier of the second copy matches the stored identifier of the first copy, such that in response to a match, the second copy is dropped.
Abstract:
In one embodiment, a multicast communication is received at a particular node of a plurality of nodes receiving the multicast communication in a network. The particular node selects a subset of subcarriers using a probabilistic data structure, such that each of the plurality of nodes selects a respective subset of subcarriers using the probabilistic data structure. The particular node transmits an acknowledgement of receipt of the multicast communication on the subset of subcarriers selected by the particular node. The transmission occurs simultaneously with transmissions of acknowledgements from the other of the plurality of nodes.
Abstract:
In one embodiment, asynchronous broadcast communication is performed based on time-based events in channel-hopping networks. The embodiments include determining a plurality of channels in a channel-hopping network, on which a plurality of nodes communicate, and identifying an asynchronous broadcast message to transmit from a particular node. A plurality of time-based events is determined, and in response to each time-based event, the asynchronous broadcast message is transmitted on a single selected channel of the plurality of channels per time-based event.
Abstract:
In one embodiment, a device in a network obtains information regarding a transmission between the device and a neighbor of the device in the network. The device determines whether to use the information regarding the transmission to update an expected transmission count associated with the neighbor based on a rate of samples used to compute expected transmission counts. The device updates the expected transmission count, in response to determining that the information regarding the transmission should be used to update the expected transmission count. The device selects a routing path in the network based in part on the updated expected transmission count associated with the neighbor.
Abstract:
In one embodiment, a device receives connected phase data from a neighboring device indicative of one or more electrical phases to which the neighboring device is connected. A determination is made, based on the connected phase data for the neighboring device, whether to transmit the message to the neighboring device over a single electrical phase at a higher output power or over a plurality of electrical phases at a lower output power. The message is then transmitted to the neighboring device over the determined one or more electrical phases.
Abstract:
In one embodiment, techniques are shown and described relating to quarantine-based mitigation of effects of a local DoS attack. A management device may receive data indicating that one or more nodes in a shared-media communication network are under attack by an attacking node. The management device may then communicate a quarantine request packet to the one or more nodes under attack, the quarantine request packet providing instructions to the one or more nodes under attack to alter their frequency hopping schedule without allowing the attacking node to learn of the altered frequency hopping schedule.