Abstract: In one embodiment, a method comprises: generating, by a transmitting network device, a hashed source media access control (MAC) address and a hashed destination MAC address based on hashing a MAC address of the transmitting network device and a destination MAC address of a destination wireless network device, respectively, relative to an epochal transmission sequence value; and transmitting a data frame at a time slot associated with the epochal transmission sequence value, using the hashed source MAC address and the hashed destination MAC address, to the destination wireless network device.

Abstract: In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.

Abstract: In one embodiment, a method comprises generating, by a network device, a Bloom filter bit vector based on applying Bloom filter parameters to a candidate address autoconfigured by the network device; and selectively repeating, by the network device, the autoconfiguring of the candidate address until the corresponding Bloom filter bit vector includes a bit set at a reserved bit vector position that is reserved for the network device, the reserved bit vector position providing uniqueness of the candidate address within a link layer domain.

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 device in a network receives metrics regarding a node in the network. The device uses the metrics as input to a machine learning model. The device determines, using the machine learning model and based on the metrics, an indication of abnormality of the node oscillating between using a plurality of different routing parents in the network. The device provides a results notification based on the indication of abnormality of the node oscillating between using the plurality of different routing parents.

Abstract: In one embodiment, a method comprises: receiving, by a parent network device in a directed acyclic graph (DAG) network topology, a data packet destined toward a DAG root and having been output by a target device in the network topology; identifying, by the parent network device based on the received data packet, an identifiable condition for caching a downward path enabling the parent network device to reach the target device independent of any route table entry in the parent network device; and caching, in the parent network device, the downward path enabling the parent network device to reach the target device independent of any route table entry in the parent network device.

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 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 device in an anchorless network receives an update message from a first neighbor of the device. The update message indicates a movement of a node in the network to a new position in the network. The device updates a forwarding table of the device to reverse a link direction associated with the node, in response to receiving the update message. The device sends the update message to a second neighbor of the device towards a prior position of the node in the network.

Abstract: In one embodiment, a method comprises generating, by a network device in a network, a Bloom filter bit vector representing services provided by service provider devices in the network; and the network device executing a service discovery operation based on identifying, relative to the Bloom filter bit vector, whether an identified service in a received message is executed in the network.

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: A network includes routing arcs for routing network traffic to a destination. Each arc comprising nodes connected in sequence by reversible links oriented to direct network traffic to first and second edge nodes through which the network traffic exits the arc. The nodes in the arc detect a first failure. In response, the nodes exchange first management frames to reverse links in the arc 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 exits the arc. The nodes detect a second failure in the arc that is spaced apart from the first failure. In response, the nodes exchange second management frames to freeze incoming edges of parent arcs to prevent network traffic in the corresponding parent arc from entering the arc.

Abstract: In one embodiment, a network of nodes is configured to communicate according to a configuration of a vertical ladder topology as well as monitoring communication in the network, and/or selectively controls whether or not provisioned particular links will be used. One embodiment colors nodes of the network (e.g., a wireless deterministic network) along different paths through the network and marks packets with the color of each traversed node to track a path taken by a packet. One embodiment sends a particular packet through the network and marks over which links the packet traverses and aggregates these traversed links of other copies of the particular packet. One embodiment controls whether or not the provisioned time slots are used based on flooding a control packet through the network with enable or disable information for each of these links.

Abstract: In one embodiment, a method comprises detecting a traffic condition by a network device in a loop-free routing topology comprising routing arcs for reaching a destination device, each routing arc comprising a first edge, a second edge, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device and exiting via any one of the first or second edges of the routing arc, the traffic condition proximate to the first edge of at least one of the routing arcs in which the network device is positioned; and the network device initiating load balancing based on sending a management frame over a data plane of the at least one routing arc toward the corresponding second edge, the management frame requesting a change in load balancing for at least one of an identified traffic class based on the detected traffic condition.

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 method comprises receiving, by an apparatus from each of a plurality of wireless sensor devices in a wireless sensor network, clock drift information associated with a clock in the corresponding wireless sensor device; determining for each wireless sensor device, by the apparatus, an expected clock drift based at least on the clock drift information from the corresponding wireless sensor device; and sending, by the apparatus to each wireless sensor device, a corresponding drift compensation command for correcting the corresponding expected clock drift, enabling controlled synchronization of the corresponding wireless sensor device within the wireless sensor network.

Abstract: In one embodiment, an agent device discovers a set of path computation elements (PCEs) and corresponding available capabilities and resources, and determines particular capabilities and resources of interest in a particular computer network. Upon building a simplified view of the available capabilities and resources of the set of PCEs based on the particular capabilities and resources of interest, the agent device advertises the simplified view of the available capabilities and resources into the particular computer network.

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 detecting, by a network device, an endpoint device attempting to access a data network via a data link; and generating, by the network device, a unique device signature for identifying the endpoint device based on the network device identifying a sequence of link layer data packets transmitted by the endpoint device upon connection to the data link, the unique device signature identifying a behavior of the endpoint device independent of any link layer address used by the endpoint device.

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.