Hewlett Packard Enterprise Development LP

Pierre Hugo

Rahul Bahal

Leonard Botha

Ashton Hudson

Charl Cater

In certain embodiments, a method includes recursively performing a procedure that includes using an allowed set of object identifiers and a hash function to update a bit array, using a disallowed set of object identifiers and the hash function to further update the bit array where collisions occur, repeating the process with a new allowed set that includes object identifiers from the original allowed set that collided with the disallowed set and a new hash function, until reaching a round where no collisions occurred, generating a data structure that includes the bit arrays created during each recursive round, and compressing the data structure.

Distributable hash filter for nonprobabilistic set inclusion

An example method may include blocks to initiate a network performance analysis on the enterprise network; and receive a translated recording from a backend computing device to be executed as part of the network performance analysis. Additional blocks may add the translated recording to a set of tests in a queue to be executed on the enterprise network; and execute a primary set of low-level instructions of the translated recording using a headless browser. Further blocks may in response to a failed result of the primary set of low-level instructions, execute an alternative set of low-level instructions using the headless browser. Furthermore, blocks may, record, in an activity log, results of executing the translated recording, including at least a total execution time of the executed low-level instructions; and upload the activity log to the backend computing device.

Growing community of inventors

Cape Town, South Africa

Pierre Hugo