System and method for automatically testing performance of high-volume web navigation tree services
AssigneeWipro Limited
InventorsSourav Sam Bhattacharya, Mohammed Asharaf
Life of this patent
Estimating the term…
Abstract
The present disclosure relates to methods and systems for testing navigation graph services. Embodiments of the present disclosure may provide a directed graph based on a navigation graph service, determine a set of paths between nodes in the directed graph, and generate a testing script for an arbitrary performance testing tool based on the determined set of paths. The set of paths may comprise edge-disjoint paths between nodes in the directed graph.
Claims22
A method for testing a navigation graph service comprising:
- providing, by one or more hardware processors, a directed graph based on the navigation graph service, wherein nodes of the directed graph are associated with load levels;
- determining, by the one or more hardware processors, a set of paths (S) between a root node (R) in the directed graph and a plurality of other non-root nodes in the directed graph based on the load levels associated with the nodes, wherein the determining comprises selecting a previously non-selected path (P) from a set of edge-disjoint paths between the R and a node X in the directed graph that is associated with a lowest non zero and a positive load level (L), and adding the P to the set of the paths (S), wherein the load level of each node in the P is reduced by L/K, wherein ties between the nodes are arbitrarily resolved, wherein the number of determined edge-disjoint paths is the K, and wherein each path in the set of paths (S) corresponds to an edge-disjoint path between the R and one of the plurality of the other non-root node in the directed graph;
- generating, by the one or more hardware processors, a testing script for an arbitrary performance testing tool based on the set of paths (S);
- and
- executing the testing script using the arbitrary performance testing tool.
A system for testing a navigation graph service comprising:
- a memory storing instructions;
- and
- one or more hardware processors configured to execute the instructions to:
- provide a directed graph based on the navigation graph service, wherein nodes of the directed graph are associated with load levels;
- determine a set of paths (S) between a root node (R) in the directed graph and a plurality of other non-root nodes in the directed graph based on the load levels associated with the nodes, wherein the determining comprises selecting a previously non-selected path (P) from a set of edge-disjoint paths between the R and a node X in the directed graph that is associated with a lowest nonzero and a positive load level (L), and adding the P to the set of the paths (S), wherein the load level of each node in the P is reduced by L/K, wherein ties between the nodes are arbitrarily resolved, wherein the number of determined edge-disjoint paths is the K, and wherein each path in the set of paths (S) corresponds to an edge-disjoint path between the R and one of the plurality of the other non-root node in the directed graph;
- generate a testing script for an arbitrary performance testing tool based on the set of paths (S);
- and
- execute the testing script using the arbitrary performance testing tool.
A non-transitory computer-readable medium storing instructions for testing a navigation graph service, wherein upon execution of the instructions by one or more hardware processors, the one or more hardware processors are configured by the instructions to:
- provide a directed graph based on the navigation graph service, wherein nodes of the directed graph are associated with load levels;
- determine a set of paths (S) between a root node (R) in the directed graph and a plurality of other non-root nodes in the directed graph based on the load levels associated with the nodes, wherein the determining comprises selecting a previously non-selected path (P) from a set of edge-disjoint paths between the R and a node X in the directed graph that is associated with a lowest nonzero and a positive load level (L), and adding the P to the set of the paths (S), wherein the load level of each node in the P is reduced by L/K, wherein ties between the nodes are arbitrarily resolved, wherein the number of determined edge-disjoint paths is the K, and wherein each path in the set of paths (S) corresponds to an edge-disjoint path between the R and one of the plurality of the other non-root node in the directed graph;
- generate a testing script for an arbitrary performance testing tool based on the set of paths (S);
- and
- execute the testing script using the arbitrary performance testing tool.
Dependencies are inferred from the claim text.