Abstract: In one embodiment, a first node in a wireless deterministic network communicates to a second node configuration information identifying a destination-facing path portion of a particular one-way path traversing from a source node to a destination node within the wireless deterministic network. The destination-facing portion includes a path traversing from the second node over one or more additional nodes to the destination node over which to forward packets received over a first portion of the particular one-way path from the source node to the second node. The configuration information includes a particular time slot for the second node to receive packets being sent over the particular one-way path. In one embodiment, the first node receives from the second node an acknowledgement message in the particular time slot that the destination-facing portion of the particular one-way path was configured and activated.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology for reaching a destination device, the loop-free routing topology comprising distinct paths for reaching the destination device; generating a set of serialized representations describing the loop-free routing topology, each serialized representation describing a corresponding one of the paths; and propagating the set of serialized representations from the destination device to network nodes in the computing network, enabling the network nodes to establish loop-free label switched paths for reaching the destination device via the loop-free routing topology.

Abstract: In one embodiment, a device in a network receives one or more packets that are part of a traffic flow. The device provides a sample packet to a path computation element (PCE) that includes a signature that uniquely identifies the traffic flow. The device receives a traffic flow policy for the traffic flow from a policy engine and enforces the traffic flow policy for the traffic flow.

Abstract: In one embodiment, a parent node in a network observes time slot usage of a channel hopping schedule by one or more child nodes of the parent node to communicate with the parent node. The parent node also identifies high priority traffic from a particular child node. The parent node detects time contention for the high priority traffic based on an indication that at least a portion of the traffic has been rerouted by a particular child node to a different parent node. In response to detecting the time contention, the parent node adjusts a communication strategy used by the one or more child nodes.

Abstract: In one embodiment, a network node monitors communications between a sender node and an intermediary receiver node during a set of time slots of a channel hopping schedule. The sender node, intermediary receiver node, and a final destination node for the communications may all be located along a primary communication path in the network. The network node stores a copy of one of the communications sent from the sender node to the intermediary receiver node during a particular time slot in the set of time slots. The network node forwards the copy of the communication to a listener node configured to monitor communications between the intermediary receiver node and another node located along the primary communication path. The intermediary receiver node is also configured to monitor communications between the network node and the listener node.

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.

Abstract: In one embodiment, a scheduling device in a network receives routing metrics regarding a network path between a device controller and a networked device. The scheduling device also receives controller metrics for the device controller. The scheduling device determines time costs associated with the network path and one or more control operations performed by the device controller, based on the routing and controller metrics. The scheduling device generates a communication schedule based on the time costs and instructs the device controller and the networked device to use the communication schedule.

Abstract: In one embodiment, a device in a network receives one or more time slot usage reports regarding a use of time slots of a channel hopping schedule by nodes in the network. The device predicts a time slot demand change for a particular node based on the one or more time slot usage reports. The device identifies a time frame associated with the predicted time slot demand change. The device adjusts a time slot assignment for the particular node in the channel hopping schedule based on predicted demand change and the identified time frame associated with the predicted time slot demand change.

Abstract: In one embodiment, a device in a network receives an indication of an appropriation and defense time slot for a set of time slots in a channel hopping schedule. The device appropriates ownership of the set of time slots using an appropriation window of the appropriation and defense time slot. The device receives an appropriation request from a second device during the appropriation window. In response to receiving the appropriation request, the device sends a defense notification during a defense window of the appropriation and defense time slot.

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: One embodiment includes: forwarding a particular packet through an Available Routing Construct (ARC) chain topology network. In one embodiment, this forwarding includes: sending the particular packet by each particular non-edge node on an arc of the plurality of arcs receiving the particular packet to each sibling on the arc that did not send the particular packet to said particular non-edge node, while not sending the particular packet if it was received from both siblings of said particular edge node; and sending the particular packet to a respective child node on a second arc of the plurality of arcs by each particular edge node of two edge nodes on the arc after receiving the particular packet. In one embodiment, the network is a wireless deterministic network with pre-assigned time slots for receiving and subsequently sending a same particular packet by each node of the network.

Abstract: In one embodiment, a method comprises receiving, by a network device, a data packet specifying alarm data generated by a sensor node; and outputting, by the network device, the data packet at an alarm level priority that is higher than any network-level priority of any wireless routing topology.

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, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.

Abstract: A node in a Low power and Lossy Network (LLN) is managed by monitoring a routing configuration on a node in a LLN. A triggering parameter that is used to invoke an address change on a child node is tracked and a threshold against which to compare the triggering parameter is accessed. The triggering parameter is compared to the threshold. Based on results of comparing the triggering parameter to the threshold, it is determined that an address change at the child node is appropriate. An address change of a child node appearing in the routing configuration is invoked based on the determination that an address change is appropriate.

Abstract: In one embodiment, a method comprises receiving, by an apparatus, a Media Access Control (MAC) frame destined for a destination device; dividing, by the apparatus, the MAC frame into frame fragments; coding the frame fragments into encoded cells; and causing, by the apparatus, transmission of selected subsets of the encoded cells, as distinct flows of the encoded cells, by respective optical physical layer transmitter devices reachable by the destination device.

Abstract: The invention prevents robots from browsing a Web site beyond a welcome page. When an initial request from an undefined originator is received, the Web site responds to it with a welcome page including a challenge. Then, on receiving a further request from the undefined originator, the Web site can check whether the challenge is fulfilled or not. If fulfilled, the undefined originator is assumed to be a human being and authorized to go on. If the challenge is not fulfilled, the undefined originator is assumed to be a robot, in which case site access is further denied. The invention prevents Web site contents from being investigated by robots while not requiring users to have to log on.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and causing the network traffic to be forwarded along at least one of the routing arcs to the destination device.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.

Abstract: In one embodiment, a switch in a computer network may receive a neighbor solicitation (NS) message for a target node for which no neighbor authentication (NA) reply has been received at the switch. The switch may then determine whether to forward the NS message to only non-constrained links of the switch, or to both non-constrained links and constrained links of the switch. The determining may be configured to intermittently result in forwarding the NS message for the target node to both the non-constrained links and the constrained links. The switch may then forward the NS message according to the determination.