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 tracking device detects a first device connecting to a computer network, and forces an install of fake routing information on the first device that is unique to the first device. Upon detecting a second device connecting to the computer network, the second device having at least one identifying property in common with the first device and at least one identifying property differing from the first device, the tracking device may then query the second device to determine if the second device knows the fake routing information unique to the first device. As such, the tracking device may then determine that the second device is the first device in response to the second device knowing the fake routing information unique to the first device.
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, 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 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 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, 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 method comprises: generating, by a first network device in a network, a Bloom filter bit vector representing device addresses of devices having attached to at least one of the first network device or a second network device in the network; and determining whether a new device address is not a duplicate of any of the device addresses in the network based on the Bloom filter bit vector.
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 load balancing the network traffic along the routing arcs based on traffic metrics obtained at the first and second ends of the routing arcs, including selectively sending a backpressure command to a first one of the routing arcs supplying at least a portion of the network traffic to a congested one of the routing arcs.
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.