IP Library Granted Patent US 11,044,139
Granted Patent B1
US 11,044,139 · App. 17/037,452 · Granted Jun 22, 2021

Apparatuses, methods, and computer program products for dynamic generation and traversal of object dependency data structures

Inventors: Jeffrey Farber (Mountain View, CA); Rahul Revo (San Jose, CA); Diogo Correa Lucas (Santa Clara, CA)
Assignees: ATLASSIAN PTY LTD; ATLASSIAN, INC.
H04L41/0233G06F9/448G06F9/4484G06F9/465H04L41/0266H04L41/0836H04L41/0859H04L41/12
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,044,139
App. No.
17/037,452
Granted
Jun 22, 2021
Kind
B1
Abstract

Methods, apparatuses, or computer program products provide for generating one or more service object criticality scores for service objects based on service dependency work graph structures. A service dependency work graph structure may be retrieved from a service object repository. The service dependency work graph structure may be traversed. Based at least in part on a strength measure associated with each service object relationship of one or more service object relationships associated with each unique service object identifier, one or more service object criticality scores for the unique service object identifier may be generated in relation to each other service object identifier of the plurality of service object identifiers.

Claims (36)

1. An apparatus for generating one or more service object criticality scores for service objects based on service dependency work graph structures, the apparatus comprising at least one processor and at least one memory including program code that with the processor, cause the apparatus to:

retrieve a service dependency work graph structure from a service object repository, wherein the service dependency work graph structure comprises a plurality of service dependency work graph nodes connected by a plurality of service dependency work graph edges, wherein each service dependency work graph node is associated with a unique service object identifier of a plurality of service object identifiers; and

for each unique service object identifier,

traverse the service dependency work graph structure; and

based at least in part on a strength measure associated with each service object relationship of one or more service object relationships associated with the unique service object identifier, generate the one or more service object criticality scores for the unique service object identifier in relation to each other service object identifier of the plurality of service object identifiers.

2. The apparatus according to claim 1 , wherein the at least one memory including program code that with the processor, further causes the apparatus to:

generate a reliability score for a service represented by the service object based on reliability scores associated with at least a neighboring node or a service object relationship of the service object.

3. The apparatus according to claim 2 , wherein the reliability score is based on historical reliability data.

4. The apparatus according to claim 3 , wherein the historical reliability data is stored in a historical reliability database comprising service object historical data, service object relationship historical data, previous iterations of the service dependency work graph structure, or service outage logs.

5. The apparatus according to claim 1 , wherein the service object criticality scores represent a reliance level for direct comparison between service objects which provide at least one similar service.

6. The apparatus according to claim 5 , wherein the service objects comprising the service dependency work graph structure are interchangeable alternatives to at least one service dependency work graph node.

7. The apparatus according to claim 1 , wherein the service object criticality score represents a level of dependency of a first service object in relation to a second service object.

8. The apparatus according to claim 7 , wherein the level of dependency is based on at least an availability of alternative second service objects or a determination of whether the second service object supports a critical or a non-critical function provided by the first service object.

9. The apparatus according to claim 1 , wherein the service dependency work graph edge represents the service object relationship associated with a first service dependency work graph node and a second service dependency work graph node.

10. The apparatus according to claim 1 , wherein the service object is associated with a service object identifier of the plurality of service object identifiers and a service object data comprising one or more of a service dependency object.

11. The apparatus according to claim 10 , wherein the service dependency object is associated with one or more of a unique service dependency object identifier, a service object identifier, a service dependency interface type, a service dependency data type, or a service dependency data residency type.

12. The apparatus according to claim 1 , wherein the at least one memory including program code that with the processor, further causes the apparatus to:

generate a dependency data structure representing service dependencies for the service object based on associated criticality scores representative of a second service object.

13. The apparatus according to claim 1 , wherein the at least one memory including program code that with the processor, further causes the apparatus to:

determine a ranking for each of a plurality of service objects based on a ranking criteria, wherein the ranking criteria provides the ranking for each of the plurality of service objects based on at least a respective service object criticality score.

14. A non-transitory computer readable storage medium comprising instructions for generating one or more service object criticality scores for service objects based on service dependency work graph structures, when executed by a processor, cause an apparatus comprising at least one processor and at least one memory to:

retrieve a service dependency work graph structure from a service object repository, wherein the service dependency work graph structure comprises a plurality of service dependency work graph nodes connected by a plurality of service dependency work graph edges, wherein each service dependency work graph node is associated with a unique service object identifier of a plurality of service object identifiers; and

for each unique service object identifier,

traverse the service dependency work graph structure; and

based at least in part on a strength measure associated with each service object relationship of one or more service object relationships associated with the unique service object identifier, generate the one or more service object criticality scores for the unique service object identifier in relation to each other service object identifier of the plurality of service object identifiers.

15. The non-transitory computer readable storage medium according to claim 14 , when executed by the processor, further causes the apparatus comprising at least one processor and at least one memory to:

generate a reliability score for a service represented by the service object based on reliability scores associated with at least a neighboring node or a service object relationship of the service object.

16. The non-transitory computer readable storage medium according to claim 15 , wherein the reliability score is based on historical reliability data.

17. The non-transitory computer readable storage medium according to claim 16 , wherein the historical reliability data is stored in a historical reliability database comprising service object historical data, service object relationship historical data, previous iterations of the service dependency work graph structure, or service outage logs.

18. The non-transitory computer readable storage medium according to claim 14 , wherein the service object criticality scores represent a reliance level for direct comparison between service objects which provide at least one similar service.

19. The non-transitory computer readable storage medium according to claim 18 , wherein the service objects comprising the service dependency work graph structure are interchangeable alternatives to at least one service dependency work graph node.

20. A computer implemented method for generating one or more service object criticality scores for service objects based on service dependency work graph structures, comprising:

retrieving a service dependency work graph structure from a service object repository, wherein the service dependency work graph structure comprises a plurality of service dependency work graph nodes connected by a plurality of service dependency work graph edges, wherein each service dependency work graph node is associated with a unique service object identifier of a plurality of service object identifiers; and

for each unique service object identifier,

traversing the service dependency work graph structure; and

based at least in part on a strength measure associated with each service object relationship of one or more service object relationships associated with the unique service object identifier, generating the one or more service object criticality scores for the unique service object identifier in relation to each other service object identifier of the plurality of service object identifiers.

Assignments (2)
CHANGE OF NAME Recorded Jul 24, 2024
From: ATLASSIAN, INC.
To: ATLASSIAN US, INC.
Reel/Frame 068654/0022 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 24, 2021
From: FARBER, JEFFREY; REVO, RAHUL; LUCAS, DIOGO CORREA
To: ATLASSIAN PTY LTD; ATLASSIAN, INC.
Reel/Frame 055697/0470 →
Cited By (5)
US 12,261,904 US 12,353,856 US 12,574,282 US 12,705,035 US 12,710,941